/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/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-fb55353 [2019-11-07 04:05:16,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:05:16,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:05:16,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:05:16,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:05:16,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:05:16,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:05:16,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:05:16,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:05:16,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:05:16,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:05:16,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:05:16,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:05:16,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:05:16,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:05:16,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:05:16,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:05:16,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:05:16,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:05:16,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:05:16,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:05:16,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:05:16,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:05:16,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:05:16,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:05:16,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:05:16,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:05:16,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:05:16,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:05:16,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:05:16,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:05:16,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:05:16,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:05:16,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:05:16,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:05:16,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:05:16,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:05:16,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:05:16,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:05:16,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:05:16,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:05:16,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:05:16,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:05:16,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:05:16,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:05:16,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:05:16,648 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:05:16,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:05:16,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:05:16,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:05:16,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:05:16,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:05:16,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:05:16,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:05:16,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:05:16,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:05:16,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:05:16,650 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:05:16,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:05:16,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:05:16,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:05:16,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:05:16,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:05:16,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:05:16,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:05:16,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:05:16,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:05:16,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:05:16,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:05:16,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:05:16,653 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-11-07 04:05:16,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:05:16,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:05:16,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:05:16,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:05:16,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:05:16,952 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-11-07 04:05:17,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4e97ad0/76a6b1ca54f84734b2b445f8ca70d9c3/FLAGf2095c413 [2019-11-07 04:05:17,566 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:05:17,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-11-07 04:05:17,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4e97ad0/76a6b1ca54f84734b2b445f8ca70d9c3/FLAGf2095c413 [2019-11-07 04:05:17,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4e97ad0/76a6b1ca54f84734b2b445f8ca70d9c3 [2019-11-07 04:05:17,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:05:17,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:05:17,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:17,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:05:17,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:05:17,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:17" (1/1) ... [2019-11-07 04:05:17,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b51c073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:17, skipping insertion in model container [2019-11-07 04:05:17,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:17" (1/1) ... [2019-11-07 04:05:17,902 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:05:18,040 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:05:18,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:18,604 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:05:18,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:18,788 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:05:18,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18 WrapperNode [2019-11-07 04:05:18,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:18,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:05:18,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:05:18,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:05:18,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... [2019-11-07 04:05:18,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:05:18,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:05:18,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:05:18,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:05:18,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:05:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:05:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:05:18,992 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 04:05:18,992 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 04:05:18,992 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-11-07 04:05:18,993 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-11-07 04:05:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-11-07 04:05:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-11-07 04:05:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-11-07 04:05:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-11-07 04:05:18,995 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-11-07 04:05:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-11-07 04:05:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-11-07 04:05:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-11-07 04:05:18,996 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-11-07 04:05:18,997 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-11-07 04:05:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-11-07 04:05:18,999 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-11-07 04:05:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-11-07 04:05:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-11-07 04:05:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-11-07 04:05:19,000 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 04:05:19,001 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 04:05:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-11-07 04:05:19,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-11-07 04:05:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:05:19,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-11-07 04:05:19,003 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-11-07 04:05:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 04:05:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 04:05:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 04:05:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-11-07 04:05:19,006 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-11-07 04:05:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 04:05:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 04:05:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 04:05:19,007 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-11-07 04:05:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-11-07 04:05:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 04:05:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:05:19,008 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 04:05:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:05:19,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:05:19,577 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:19,697 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-11-07 04:05:19,697 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-11-07 04:05:19,704 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:19,765 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-11-07 04:05:19,765 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-11-07 04:05:19,791 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:19,932 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 04:05:19,933 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 04:05:20,047 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,108 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-11-07 04:05:20,109 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-11-07 04:05:20,109 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-11-07 04:05:20,115 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,289 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-11-07 04:05:20,290 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-11-07 04:05:20,291 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,349 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-07 04:05:20,349 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-07 04:05:20,377 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,411 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-11-07 04:05:20,411 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-11-07 04:05:20,417 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,654 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-11-07 04:05:20,654 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-11-07 04:05:20,668 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:20,673 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:20,674 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:21,309 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:05:21,310 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 04:05:21,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:21 BoogieIcfgContainer [2019-11-07 04:05:21,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:05:21,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:05:21,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:05:21,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:05:21,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:05:17" (1/3) ... [2019-11-07 04:05:21,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a7df3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:21, skipping insertion in model container [2019-11-07 04:05:21,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:18" (2/3) ... [2019-11-07 04:05:21,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a7df3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:21, skipping insertion in model container [2019-11-07 04:05:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:21" (3/3) ... [2019-11-07 04:05:21,323 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-11-07 04:05:21,335 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:05:21,348 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:05:21,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:05:21,410 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:05:21,410 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:05:21,410 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:05:21,411 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:05:21,411 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:05:21,411 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:05:21,411 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:05:21,411 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:05:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states. [2019-11-07 04:05:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:05:21,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:21,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:21,460 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1471663135, now seen corresponding path program 1 times [2019-11-07 04:05:21,476 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:21,477 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730877506] [2019-11-07 04:05:21,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:21,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730877506] [2019-11-07 04:05:21,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:21,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:21,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172703384] [2019-11-07 04:05:21,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:21,756 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:21,774 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 3 states. [2019-11-07 04:05:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:22,003 INFO L93 Difference]: Finished difference Result 702 states and 1087 transitions. [2019-11-07 04:05:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:22,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 04:05:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:22,029 INFO L225 Difference]: With dead ends: 702 [2019-11-07 04:05:22,030 INFO L226 Difference]: Without dead ends: 402 [2019-11-07 04:05:22,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-07 04:05:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-11-07 04:05:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-07 04:05:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 579 transitions. [2019-11-07 04:05:22,132 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 579 transitions. Word has length 18 [2019-11-07 04:05:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 579 transitions. [2019-11-07 04:05:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 579 transitions. [2019-11-07 04:05:22,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:05:22,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:22,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:22,135 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1826833932, now seen corresponding path program 1 times [2019-11-07 04:05:22,135 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:22,136 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798972063] [2019-11-07 04:05:22,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:22,294 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798972063] [2019-11-07 04:05:22,295 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:22,299 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:22,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388333986] [2019-11-07 04:05:22,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:22,303 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:22,304 INFO L87 Difference]: Start difference. First operand 402 states and 579 transitions. Second operand 3 states. [2019-11-07 04:05:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:22,591 INFO L93 Difference]: Finished difference Result 572 states and 806 transitions. [2019-11-07 04:05:22,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:22,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 04:05:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:22,604 INFO L225 Difference]: With dead ends: 572 [2019-11-07 04:05:22,604 INFO L226 Difference]: Without dead ends: 475 [2019-11-07 04:05:22,606 INFO L630 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-11-07 04:05:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-07 04:05:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-11-07 04:05:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-07 04:05:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 672 transitions. [2019-11-07 04:05:22,735 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 672 transitions. Word has length 21 [2019-11-07 04:05:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:22,735 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 672 transitions. [2019-11-07 04:05:22,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 672 transitions. [2019-11-07 04:05:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:05:22,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:22,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:22,743 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1575704033, now seen corresponding path program 1 times [2019-11-07 04:05:22,743 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:22,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380405067] [2019-11-07 04:05:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:22,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380405067] [2019-11-07 04:05:22,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:22,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:22,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815574335] [2019-11-07 04:05:22,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:22,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:22,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:22,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:22,890 INFO L87 Difference]: Start difference. First operand 471 states and 672 transitions. Second operand 3 states. [2019-11-07 04:05:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:22,956 INFO L93 Difference]: Finished difference Result 685 states and 950 transitions. [2019-11-07 04:05:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:22,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 04:05:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:22,965 INFO L225 Difference]: With dead ends: 685 [2019-11-07 04:05:22,965 INFO L226 Difference]: Without dead ends: 578 [2019-11-07 04:05:22,967 INFO L630 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-11-07 04:05:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-11-07 04:05:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 541. [2019-11-07 04:05:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-07 04:05:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 764 transitions. [2019-11-07 04:05:23,021 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 764 transitions. Word has length 26 [2019-11-07 04:05:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:23,022 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 764 transitions. [2019-11-07 04:05:23,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 764 transitions. [2019-11-07 04:05:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 04:05:23,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:23,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:23,030 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 673908008, now seen corresponding path program 1 times [2019-11-07 04:05:23,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:23,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487861561] [2019-11-07 04:05:23,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:23,120 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487861561] [2019-11-07 04:05:23,121 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:23,121 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:23,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337099720] [2019-11-07 04:05:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:23,122 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:23,122 INFO L87 Difference]: Start difference. First operand 541 states and 764 transitions. Second operand 3 states. [2019-11-07 04:05:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:23,318 INFO L93 Difference]: Finished difference Result 1024 states and 1490 transitions. [2019-11-07 04:05:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:23,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 04:05:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:23,327 INFO L225 Difference]: With dead ends: 1024 [2019-11-07 04:05:23,328 INFO L226 Difference]: Without dead ends: 818 [2019-11-07 04:05:23,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-07 04:05:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 668. [2019-11-07 04:05:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-11-07 04:05:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2019-11-07 04:05:23,398 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 27 [2019-11-07 04:05:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:23,399 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2019-11-07 04:05:23,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2019-11-07 04:05:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 04:05:23,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:23,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:23,402 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash -822079973, now seen corresponding path program 1 times [2019-11-07 04:05:23,412 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:23,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290017841] [2019-11-07 04:05:23,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:23,526 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290017841] [2019-11-07 04:05:23,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:23,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:23,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777127631] [2019-11-07 04:05:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:23,528 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:23,529 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand 5 states. [2019-11-07 04:05:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:24,313 INFO L93 Difference]: Finished difference Result 1132 states and 1671 transitions. [2019-11-07 04:05:24,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:05:24,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-07 04:05:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:24,319 INFO L225 Difference]: With dead ends: 1132 [2019-11-07 04:05:24,320 INFO L226 Difference]: Without dead ends: 717 [2019-11-07 04:05:24,322 INFO L630 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-11-07 04:05:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-07 04:05:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 656. [2019-11-07 04:05:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-07 04:05:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 966 transitions. [2019-11-07 04:05:24,369 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 966 transitions. Word has length 28 [2019-11-07 04:05:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:24,370 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 966 transitions. [2019-11-07 04:05:24,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 966 transitions. [2019-11-07 04:05:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 04:05:24,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:24,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:24,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:24,373 INFO L82 PathProgramCache]: Analyzing trace with hash -808448961, now seen corresponding path program 1 times [2019-11-07 04:05:24,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:24,374 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665465896] [2019-11-07 04:05:24,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:24,424 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665465896] [2019-11-07 04:05:24,425 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:24,425 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:24,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945137277] [2019-11-07 04:05:24,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:24,426 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:24,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:24,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:24,426 INFO L87 Difference]: Start difference. First operand 656 states and 966 transitions. Second operand 3 states. [2019-11-07 04:05:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:24,509 INFO L93 Difference]: Finished difference Result 659 states and 968 transitions. [2019-11-07 04:05:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:24,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 04:05:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:24,515 INFO L225 Difference]: With dead ends: 659 [2019-11-07 04:05:24,515 INFO L226 Difference]: Without dead ends: 655 [2019-11-07 04:05:24,516 INFO L630 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-11-07 04:05:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-07 04:05:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-07 04:05:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-07 04:05:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 963 transitions. [2019-11-07 04:05:24,561 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 963 transitions. Word has length 29 [2019-11-07 04:05:24,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 963 transitions. [2019-11-07 04:05:24,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 963 transitions. [2019-11-07 04:05:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 04:05:24,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:24,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:24,565 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:24,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1336520426, now seen corresponding path program 1 times [2019-11-07 04:05:24,566 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:24,566 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397698884] [2019-11-07 04:05:24,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:24,620 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397698884] [2019-11-07 04:05:24,620 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:24,621 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590562900] [2019-11-07 04:05:24,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:24,622 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:24,622 INFO L87 Difference]: Start difference. First operand 655 states and 963 transitions. Second operand 3 states. [2019-11-07 04:05:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:24,701 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2019-11-07 04:05:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:24,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 04:05:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:24,707 INFO L225 Difference]: With dead ends: 925 [2019-11-07 04:05:24,707 INFO L226 Difference]: Without dead ends: 737 [2019-11-07 04:05:24,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-07 04:05:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 637. [2019-11-07 04:05:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-11-07 04:05:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 902 transitions. [2019-11-07 04:05:24,748 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 902 transitions. Word has length 35 [2019-11-07 04:05:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:24,749 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 902 transitions. [2019-11-07 04:05:24,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 902 transitions. [2019-11-07 04:05:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 04:05:24,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:24,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:24,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -804463058, now seen corresponding path program 1 times [2019-11-07 04:05:24,752 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:24,752 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030169451] [2019-11-07 04:05:24,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:24,801 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030169451] [2019-11-07 04:05:24,801 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:24,802 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:24,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112140998] [2019-11-07 04:05:24,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:24,803 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:24,803 INFO L87 Difference]: Start difference. First operand 637 states and 902 transitions. Second operand 3 states. [2019-11-07 04:05:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:24,854 INFO L93 Difference]: Finished difference Result 703 states and 983 transitions. [2019-11-07 04:05:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:24,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 04:05:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:24,859 INFO L225 Difference]: With dead ends: 703 [2019-11-07 04:05:24,859 INFO L226 Difference]: Without dead ends: 685 [2019-11-07 04:05:24,860 INFO L630 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-11-07 04:05:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-11-07 04:05:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 670. [2019-11-07 04:05:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-07 04:05:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2019-11-07 04:05:24,902 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 36 [2019-11-07 04:05:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:24,902 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2019-11-07 04:05:24,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2019-11-07 04:05:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:05:24,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:24,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:24,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1782796671, now seen corresponding path program 1 times [2019-11-07 04:05:24,906 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:24,906 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497704773] [2019-11-07 04:05:24,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:24,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497704773] [2019-11-07 04:05:24,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:24,963 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:05:24,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846630124] [2019-11-07 04:05:24,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:05:24,964 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:05:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:05:24,965 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand 4 states. [2019-11-07 04:05:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:25,321 INFO L93 Difference]: Finished difference Result 771 states and 1056 transitions. [2019-11-07 04:05:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:05:25,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-07 04:05:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:25,325 INFO L225 Difference]: With dead ends: 771 [2019-11-07 04:05:25,326 INFO L226 Difference]: Without dead ends: 597 [2019-11-07 04:05:25,327 INFO L630 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-11-07 04:05:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-07 04:05:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 568. [2019-11-07 04:05:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-07 04:05:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 785 transitions. [2019-11-07 04:05:25,361 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 785 transitions. Word has length 42 [2019-11-07 04:05:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:25,361 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 785 transitions. [2019-11-07 04:05:25,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:05:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 785 transitions. [2019-11-07 04:05:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:05:25,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:25,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:25,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash 432749520, now seen corresponding path program 1 times [2019-11-07 04:05:25,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:25,365 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955668082] [2019-11-07 04:05:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:25,437 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955668082] [2019-11-07 04:05:25,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:25,438 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:25,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757254489] [2019-11-07 04:05:25,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:25,439 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,439 INFO L87 Difference]: Start difference. First operand 568 states and 785 transitions. Second operand 3 states. [2019-11-07 04:05:25,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:25,499 INFO L93 Difference]: Finished difference Result 773 states and 1059 transitions. [2019-11-07 04:05:25,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:25,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-07 04:05:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:25,504 INFO L225 Difference]: With dead ends: 773 [2019-11-07 04:05:25,504 INFO L226 Difference]: Without dead ends: 599 [2019-11-07 04:05:25,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-07 04:05:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 568. [2019-11-07 04:05:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-07 04:05:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 783 transitions. [2019-11-07 04:05:25,538 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 783 transitions. Word has length 42 [2019-11-07 04:05:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:25,538 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 783 transitions. [2019-11-07 04:05:25,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 783 transitions. [2019-11-07 04:05:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:05:25,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:25,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:25,541 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1161412528, now seen corresponding path program 1 times [2019-11-07 04:05:25,542 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:25,542 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799651157] [2019-11-07 04:05:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:25,579 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799651157] [2019-11-07 04:05:25,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:25,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:25,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837667508] [2019-11-07 04:05:25,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:25,580 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:25,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,581 INFO L87 Difference]: Start difference. First operand 568 states and 783 transitions. Second operand 3 states. [2019-11-07 04:05:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:25,700 INFO L93 Difference]: Finished difference Result 726 states and 994 transitions. [2019-11-07 04:05:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:25,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-07 04:05:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:25,706 INFO L225 Difference]: With dead ends: 726 [2019-11-07 04:05:25,706 INFO L226 Difference]: Without dead ends: 716 [2019-11-07 04:05:25,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-07 04:05:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 635. [2019-11-07 04:05:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-11-07 04:05:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 864 transitions. [2019-11-07 04:05:25,743 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 864 transitions. Word has length 40 [2019-11-07 04:05:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:25,744 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 864 transitions. [2019-11-07 04:05:25,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 864 transitions. [2019-11-07 04:05:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:05:25,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:25,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:25,747 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1003994184, now seen corresponding path program 1 times [2019-11-07 04:05:25,747 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:25,748 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480473080] [2019-11-07 04:05:25,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:25,790 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480473080] [2019-11-07 04:05:25,790 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:25,790 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:25,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103610622] [2019-11-07 04:05:25,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:25,791 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:25,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:25,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,791 INFO L87 Difference]: Start difference. First operand 635 states and 864 transitions. Second operand 3 states. [2019-11-07 04:05:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:25,840 INFO L93 Difference]: Finished difference Result 744 states and 989 transitions. [2019-11-07 04:05:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:25,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 04:05:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:25,845 INFO L225 Difference]: With dead ends: 744 [2019-11-07 04:05:25,845 INFO L226 Difference]: Without dead ends: 658 [2019-11-07 04:05:25,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-07 04:05:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2019-11-07 04:05:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-07 04:05:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2019-11-07 04:05:25,881 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 43 [2019-11-07 04:05:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:25,881 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2019-11-07 04:05:25,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2019-11-07 04:05:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:05:25,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:25,884 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:25,884 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1200179264, now seen corresponding path program 1 times [2019-11-07 04:05:25,885 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:25,885 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733098679] [2019-11-07 04:05:25,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:25,998 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733098679] [2019-11-07 04:05:25,998 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:25,999 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:05:25,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411284969] [2019-11-07 04:05:25,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:05:25,999 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:05:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:05:26,000 INFO L87 Difference]: Start difference. First operand 632 states and 856 transitions. Second operand 10 states. [2019-11-07 04:05:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:28,166 INFO L93 Difference]: Finished difference Result 808 states and 1130 transitions. [2019-11-07 04:05:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:05:28,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-07 04:05:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:28,172 INFO L225 Difference]: With dead ends: 808 [2019-11-07 04:05:28,172 INFO L226 Difference]: Without dead ends: 800 [2019-11-07 04:05:28,173 INFO L630 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-11-07 04:05:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-11-07 04:05:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 639. [2019-11-07 04:05:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-11-07 04:05:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 858 transitions. [2019-11-07 04:05:28,218 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 858 transitions. Word has length 41 [2019-11-07 04:05:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:28,218 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 858 transitions. [2019-11-07 04:05:28,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:05:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 858 transitions. [2019-11-07 04:05:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:05:28,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:28,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:28,221 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1361312649, now seen corresponding path program 1 times [2019-11-07 04:05:28,221 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:28,221 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480673137] [2019-11-07 04:05:28,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:28,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480673137] [2019-11-07 04:05:28,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:28,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:05:28,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605963237] [2019-11-07 04:05:28,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:05:28,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:05:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:05:28,286 INFO L87 Difference]: Start difference. First operand 639 states and 858 transitions. Second operand 7 states. [2019-11-07 04:05:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:29,418 INFO L93 Difference]: Finished difference Result 768 states and 1067 transitions. [2019-11-07 04:05:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:05:29,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-07 04:05:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:29,422 INFO L225 Difference]: With dead ends: 768 [2019-11-07 04:05:29,422 INFO L226 Difference]: Without dead ends: 713 [2019-11-07 04:05:29,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-07 04:05:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 639. [2019-11-07 04:05:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-11-07 04:05:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 856 transitions. [2019-11-07 04:05:29,464 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 856 transitions. Word has length 41 [2019-11-07 04:05:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:29,464 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 856 transitions. [2019-11-07 04:05:29,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:05:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 856 transitions. [2019-11-07 04:05:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:05:29,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:29,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:29,467 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:29,468 INFO L82 PathProgramCache]: Analyzing trace with hash 808827987, now seen corresponding path program 1 times [2019-11-07 04:05:29,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:29,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951033833] [2019-11-07 04:05:29,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:29,553 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951033833] [2019-11-07 04:05:29,553 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:29,553 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:05:29,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892472368] [2019-11-07 04:05:29,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:05:29,554 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:05:29,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:05:29,555 INFO L87 Difference]: Start difference. First operand 639 states and 856 transitions. Second operand 9 states. [2019-11-07 04:05:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:31,459 INFO L93 Difference]: Finished difference Result 762 states and 1049 transitions. [2019-11-07 04:05:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:05:31,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-11-07 04:05:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:31,464 INFO L225 Difference]: With dead ends: 762 [2019-11-07 04:05:31,464 INFO L226 Difference]: Without dead ends: 709 [2019-11-07 04:05:31,465 INFO L630 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-11-07 04:05:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-11-07 04:05:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 574. [2019-11-07 04:05:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-07 04:05:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 772 transitions. [2019-11-07 04:05:31,503 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 772 transitions. Word has length 42 [2019-11-07 04:05:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:31,504 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 772 transitions. [2019-11-07 04:05:31,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:05:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 772 transitions. [2019-11-07 04:05:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:05:31,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:31,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:31,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -971270421, now seen corresponding path program 1 times [2019-11-07 04:05:31,507 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:31,507 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207235510] [2019-11-07 04:05:31,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:31,543 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207235510] [2019-11-07 04:05:31,543 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:31,543 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:31,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285512978] [2019-11-07 04:05:31,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:31,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:31,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:31,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:31,544 INFO L87 Difference]: Start difference. First operand 574 states and 772 transitions. Second operand 3 states. [2019-11-07 04:05:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:31,654 INFO L93 Difference]: Finished difference Result 715 states and 955 transitions. [2019-11-07 04:05:31,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:31,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-07 04:05:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:31,659 INFO L225 Difference]: With dead ends: 715 [2019-11-07 04:05:31,659 INFO L226 Difference]: Without dead ends: 704 [2019-11-07 04:05:31,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-07 04:05:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 621. [2019-11-07 04:05:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-11-07 04:05:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 823 transitions. [2019-11-07 04:05:31,701 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 823 transitions. Word has length 42 [2019-11-07 04:05:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:31,702 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 823 transitions. [2019-11-07 04:05:31,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 823 transitions. [2019-11-07 04:05:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:05:31,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:31,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:31,707 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 399258757, now seen corresponding path program 1 times [2019-11-07 04:05:31,708 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:31,708 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541626104] [2019-11-07 04:05:31,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:31,829 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541626104] [2019-11-07 04:05:31,829 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:31,829 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:31,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595683129] [2019-11-07 04:05:31,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:31,830 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:31,831 INFO L87 Difference]: Start difference. First operand 621 states and 823 transitions. Second operand 8 states. [2019-11-07 04:05:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:31,969 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2019-11-07 04:05:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:05:31,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-11-07 04:05:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:31,974 INFO L225 Difference]: With dead ends: 636 [2019-11-07 04:05:31,974 INFO L226 Difference]: Without dead ends: 632 [2019-11-07 04:05:31,975 INFO L630 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-11-07 04:05:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-07 04:05:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2019-11-07 04:05:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-07 04:05:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 834 transitions. [2019-11-07 04:05:32,022 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 834 transitions. Word has length 43 [2019-11-07 04:05:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:32,023 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 834 transitions. [2019-11-07 04:05:32,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 834 transitions. [2019-11-07 04:05:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:05:32,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:32,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:32,026 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash 398981927, now seen corresponding path program 1 times [2019-11-07 04:05:32,026 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:32,027 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818620815] [2019-11-07 04:05:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:32,077 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818620815] [2019-11-07 04:05:32,077 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:32,078 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:32,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409934921] [2019-11-07 04:05:32,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:32,078 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:32,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:32,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:32,079 INFO L87 Difference]: Start difference. First operand 630 states and 834 transitions. Second operand 5 states. [2019-11-07 04:05:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:32,692 INFO L93 Difference]: Finished difference Result 715 states and 953 transitions. [2019-11-07 04:05:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:32,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-07 04:05:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:32,697 INFO L225 Difference]: With dead ends: 715 [2019-11-07 04:05:32,698 INFO L226 Difference]: Without dead ends: 685 [2019-11-07 04:05:32,700 INFO L630 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-11-07 04:05:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-11-07 04:05:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 606. [2019-11-07 04:05:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-11-07 04:05:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2019-11-07 04:05:32,745 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 43 [2019-11-07 04:05:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2019-11-07 04:05:32,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2019-11-07 04:05:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:05:32,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:32,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:32,748 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -456522929, now seen corresponding path program 1 times [2019-11-07 04:05:32,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:32,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231481552] [2019-11-07 04:05:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:32,809 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231481552] [2019-11-07 04:05:32,809 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:32,809 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:32,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29533349] [2019-11-07 04:05:32,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:32,810 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:32,811 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand 3 states. [2019-11-07 04:05:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:32,887 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2019-11-07 04:05:32,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:32,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 04:05:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:32,891 INFO L225 Difference]: With dead ends: 631 [2019-11-07 04:05:32,891 INFO L226 Difference]: Without dead ends: 624 [2019-11-07 04:05:32,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-07 04:05:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2019-11-07 04:05:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-07 04:05:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 825 transitions. [2019-11-07 04:05:32,937 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 825 transitions. Word has length 45 [2019-11-07 04:05:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:32,937 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 825 transitions. [2019-11-07 04:05:32,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 825 transitions. [2019-11-07 04:05:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:05:32,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:32,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:32,940 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash -185372726, now seen corresponding path program 1 times [2019-11-07 04:05:32,941 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:32,941 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612347393] [2019-11-07 04:05:32,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:33,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612347393] [2019-11-07 04:05:33,011 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:33,012 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:33,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980274681] [2019-11-07 04:05:33,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:33,013 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:33,013 INFO L87 Difference]: Start difference. First operand 622 states and 825 transitions. Second operand 3 states. [2019-11-07 04:05:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:33,083 INFO L93 Difference]: Finished difference Result 791 states and 1043 transitions. [2019-11-07 04:05:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:33,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-07 04:05:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:33,087 INFO L225 Difference]: With dead ends: 791 [2019-11-07 04:05:33,087 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 04:05:33,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 04:05:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 04:05:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 04:05:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 792 transitions. [2019-11-07 04:05:33,127 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 792 transitions. Word has length 50 [2019-11-07 04:05:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:33,127 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 792 transitions. [2019-11-07 04:05:33,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 792 transitions. [2019-11-07 04:05:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:05:33,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:33,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:33,130 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash -397376972, now seen corresponding path program 1 times [2019-11-07 04:05:33,130 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:33,130 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294290218] [2019-11-07 04:05:33,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:33,271 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294290218] [2019-11-07 04:05:33,272 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:33,272 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 04:05:33,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98162340] [2019-11-07 04:05:33,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 04:05:33,273 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:33,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 04:05:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:05:33,278 INFO L87 Difference]: Start difference. First operand 598 states and 792 transitions. Second operand 13 states. [2019-11-07 04:05:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:35,186 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2019-11-07 04:05:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:05:35,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-11-07 04:05:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:35,192 INFO L225 Difference]: With dead ends: 628 [2019-11-07 04:05:35,192 INFO L226 Difference]: Without dead ends: 622 [2019-11-07 04:05:35,193 INFO L630 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-11-07 04:05:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-11-07 04:05:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 598. [2019-11-07 04:05:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 04:05:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 791 transitions. [2019-11-07 04:05:35,254 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 791 transitions. Word has length 47 [2019-11-07 04:05:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:35,254 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 791 transitions. [2019-11-07 04:05:35,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 04:05:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 791 transitions. [2019-11-07 04:05:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:05:35,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:35,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:35,258 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 878367500, now seen corresponding path program 1 times [2019-11-07 04:05:35,259 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:35,259 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11078051] [2019-11-07 04:05:35,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:35,395 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11078051] [2019-11-07 04:05:35,395 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:35,395 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:05:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496394543] [2019-11-07 04:05:35,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:05:35,397 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:05:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:05:35,397 INFO L87 Difference]: Start difference. First operand 598 states and 791 transitions. Second operand 9 states. [2019-11-07 04:05:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:35,633 INFO L93 Difference]: Finished difference Result 622 states and 817 transitions. [2019-11-07 04:05:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:05:35,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-11-07 04:05:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:35,640 INFO L225 Difference]: With dead ends: 622 [2019-11-07 04:05:35,640 INFO L226 Difference]: Without dead ends: 593 [2019-11-07 04:05:35,641 INFO L630 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-11-07 04:05:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-07 04:05:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-11-07 04:05:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-07 04:05:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 774 transitions. [2019-11-07 04:05:35,690 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 774 transitions. Word has length 48 [2019-11-07 04:05:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:35,690 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 774 transitions. [2019-11-07 04:05:35,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:05:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 774 transitions. [2019-11-07 04:05:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:05:35,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:35,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:35,693 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1711324058, now seen corresponding path program 1 times [2019-11-07 04:05:35,694 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:35,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138951424] [2019-11-07 04:05:35,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:35,780 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138951424] [2019-11-07 04:05:35,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:35,781 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:05:35,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392268062] [2019-11-07 04:05:35,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:05:35,781 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:05:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:05:35,782 INFO L87 Difference]: Start difference. First operand 593 states and 774 transitions. Second operand 10 states. [2019-11-07 04:05:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:36,006 INFO L93 Difference]: Finished difference Result 609 states and 791 transitions. [2019-11-07 04:05:36,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 04:05:36,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-07 04:05:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:36,011 INFO L225 Difference]: With dead ends: 609 [2019-11-07 04:05:36,011 INFO L226 Difference]: Without dead ends: 591 [2019-11-07 04:05:36,012 INFO L630 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-11-07 04:05:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-11-07 04:05:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-11-07 04:05:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-11-07 04:05:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-11-07 04:05:36,095 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 50 [2019-11-07 04:05:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:36,095 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-11-07 04:05:36,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:05:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-11-07 04:05:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:05:36,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:36,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:36,098 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash 211323632, now seen corresponding path program 1 times [2019-11-07 04:05:36,098 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:36,099 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365516587] [2019-11-07 04:05:36,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:36,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365516587] [2019-11-07 04:05:36,187 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:36,187 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:36,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103610189] [2019-11-07 04:05:36,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:36,188 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:36,189 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 11 states. [2019-11-07 04:05:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:36,420 INFO L93 Difference]: Finished difference Result 607 states and 787 transitions. [2019-11-07 04:05:36,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:36,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-11-07 04:05:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:36,423 INFO L225 Difference]: With dead ends: 607 [2019-11-07 04:05:36,423 INFO L226 Difference]: Without dead ends: 589 [2019-11-07 04:05:36,424 INFO L630 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-11-07 04:05:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-07 04:05:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-11-07 04:05:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-07 04:05:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 766 transitions. [2019-11-07 04:05:36,461 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 766 transitions. Word has length 50 [2019-11-07 04:05:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:36,461 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 766 transitions. [2019-11-07 04:05:36,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 766 transitions. [2019-11-07 04:05:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:05:36,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:36,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:36,464 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1636630726, now seen corresponding path program 1 times [2019-11-07 04:05:36,464 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:36,465 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836919369] [2019-11-07 04:05:36,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:36,538 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836919369] [2019-11-07 04:05:36,539 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:36,539 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:05:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690318953] [2019-11-07 04:05:36,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:05:36,540 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:05:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:05:36,540 INFO L87 Difference]: Start difference. First operand 589 states and 766 transitions. Second operand 10 states. [2019-11-07 04:05:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:36,718 INFO L93 Difference]: Finished difference Result 602 states and 780 transitions. [2019-11-07 04:05:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 04:05:36,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-11-07 04:05:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:36,721 INFO L225 Difference]: With dead ends: 602 [2019-11-07 04:05:36,721 INFO L226 Difference]: Without dead ends: 584 [2019-11-07 04:05:36,722 INFO L630 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-11-07 04:05:36,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-07 04:05:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-11-07 04:05:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-07 04:05:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 759 transitions. [2019-11-07 04:05:36,758 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 759 transitions. Word has length 49 [2019-11-07 04:05:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:36,760 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 759 transitions. [2019-11-07 04:05:36,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:05:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 759 transitions. [2019-11-07 04:05:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:05:36,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:36,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:36,762 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -572398302, now seen corresponding path program 1 times [2019-11-07 04:05:36,763 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:36,763 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737916748] [2019-11-07 04:05:36,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:36,883 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737916748] [2019-11-07 04:05:36,883 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:36,883 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:05:36,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018921654] [2019-11-07 04:05:36,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:05:36,884 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:05:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:36,884 INFO L87 Difference]: Start difference. First operand 584 states and 759 transitions. Second operand 12 states. [2019-11-07 04:05:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:37,131 INFO L93 Difference]: Finished difference Result 609 states and 786 transitions. [2019-11-07 04:05:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:05:37,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-07 04:05:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:37,134 INFO L225 Difference]: With dead ends: 609 [2019-11-07 04:05:37,134 INFO L226 Difference]: Without dead ends: 586 [2019-11-07 04:05:37,135 INFO L630 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-11-07 04:05:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-07 04:05:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-11-07 04:05:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-11-07 04:05:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 755 transitions. [2019-11-07 04:05:37,171 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 755 transitions. Word has length 54 [2019-11-07 04:05:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:37,171 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 755 transitions. [2019-11-07 04:05:37,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:05:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 755 transitions. [2019-11-07 04:05:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:05:37,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:37,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:37,174 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 916624012, now seen corresponding path program 1 times [2019-11-07 04:05:37,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:37,174 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327393496] [2019-11-07 04:05:37,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:37,274 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327393496] [2019-11-07 04:05:37,274 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:37,275 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:05:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024983079] [2019-11-07 04:05:37,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:05:37,275 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:05:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:37,276 INFO L87 Difference]: Start difference. First operand 582 states and 755 transitions. Second operand 12 states. [2019-11-07 04:05:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:37,620 INFO L93 Difference]: Finished difference Result 607 states and 782 transitions. [2019-11-07 04:05:37,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:05:37,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-07 04:05:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:37,624 INFO L225 Difference]: With dead ends: 607 [2019-11-07 04:05:37,624 INFO L226 Difference]: Without dead ends: 584 [2019-11-07 04:05:37,625 INFO L630 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-11-07 04:05:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-07 04:05:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-11-07 04:05:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-07 04:05:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 751 transitions. [2019-11-07 04:05:37,665 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 751 transitions. Word has length 53 [2019-11-07 04:05:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:37,665 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 751 transitions. [2019-11-07 04:05:37,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:05:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 751 transitions. [2019-11-07 04:05:37,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:05:37,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:37,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:37,670 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:37,670 INFO L82 PathProgramCache]: Analyzing trace with hash 911278729, now seen corresponding path program 1 times [2019-11-07 04:05:37,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:37,671 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484884691] [2019-11-07 04:05:37,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:37,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484884691] [2019-11-07 04:05:37,807 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:37,807 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:05:37,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140775765] [2019-11-07 04:05:37,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:05:37,808 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:05:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:37,809 INFO L87 Difference]: Start difference. First operand 580 states and 751 transitions. Second operand 12 states. [2019-11-07 04:05:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:38,023 INFO L93 Difference]: Finished difference Result 603 states and 776 transitions. [2019-11-07 04:05:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:05:38,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-07 04:05:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:38,031 INFO L225 Difference]: With dead ends: 603 [2019-11-07 04:05:38,032 INFO L226 Difference]: Without dead ends: 579 [2019-11-07 04:05:38,033 INFO L630 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-11-07 04:05:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-07 04:05:38,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-11-07 04:05:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-11-07 04:05:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 740 transitions. [2019-11-07 04:05:38,074 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 740 transitions. Word has length 51 [2019-11-07 04:05:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:38,074 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 740 transitions. [2019-11-07 04:05:38,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:05:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 740 transitions. [2019-11-07 04:05:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:05:38,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:38,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:38,077 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash -126879601, now seen corresponding path program 1 times [2019-11-07 04:05:38,078 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:38,078 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948190932] [2019-11-07 04:05:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:38,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948190932] [2019-11-07 04:05:38,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:38,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:38,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898478546] [2019-11-07 04:05:38,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:38,136 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:38,137 INFO L87 Difference]: Start difference. First operand 579 states and 740 transitions. Second operand 5 states. [2019-11-07 04:05:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:39,037 INFO L93 Difference]: Finished difference Result 962 states and 1289 transitions. [2019-11-07 04:05:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:05:39,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:05:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:39,050 INFO L225 Difference]: With dead ends: 962 [2019-11-07 04:05:39,050 INFO L226 Difference]: Without dead ends: 837 [2019-11-07 04:05:39,053 INFO L630 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-11-07 04:05:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-11-07 04:05:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 610. [2019-11-07 04:05:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-07 04:05:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 785 transitions. [2019-11-07 04:05:39,101 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 785 transitions. Word has length 54 [2019-11-07 04:05:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:39,101 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 785 transitions. [2019-11-07 04:05:39,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 785 transitions. [2019-11-07 04:05:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:05:39,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:39,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:39,104 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -264370587, now seen corresponding path program 1 times [2019-11-07 04:05:39,105 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:39,105 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792433808] [2019-11-07 04:05:39,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:39,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792433808] [2019-11-07 04:05:39,188 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:39,188 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:05:39,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150865633] [2019-11-07 04:05:39,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:05:39,189 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:05:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:05:39,190 INFO L87 Difference]: Start difference. First operand 610 states and 785 transitions. Second operand 9 states. [2019-11-07 04:05:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:39,385 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2019-11-07 04:05:39,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:05:39,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-07 04:05:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:39,388 INFO L225 Difference]: With dead ends: 634 [2019-11-07 04:05:39,388 INFO L226 Difference]: Without dead ends: 583 [2019-11-07 04:05:39,389 INFO L630 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-11-07 04:05:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-11-07 04:05:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-11-07 04:05:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-07 04:05:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2019-11-07 04:05:39,436 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 51 [2019-11-07 04:05:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:39,437 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2019-11-07 04:05:39,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:05:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2019-11-07 04:05:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:05:39,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:39,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:39,440 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -678859389, now seen corresponding path program 1 times [2019-11-07 04:05:39,440 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:39,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813572502] [2019-11-07 04:05:39,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:39,583 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813572502] [2019-11-07 04:05:39,584 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:39,584 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:39,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927458347] [2019-11-07 04:05:39,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:39,585 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:39,589 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand 11 states. [2019-11-07 04:05:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:39,709 INFO L93 Difference]: Finished difference Result 644 states and 816 transitions. [2019-11-07 04:05:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:39,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-11-07 04:05:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:39,713 INFO L225 Difference]: With dead ends: 644 [2019-11-07 04:05:39,713 INFO L226 Difference]: Without dead ends: 593 [2019-11-07 04:05:39,714 INFO L630 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-11-07 04:05:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-07 04:05:39,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2019-11-07 04:05:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-07 04:05:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 754 transitions. [2019-11-07 04:05:39,756 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 754 transitions. Word has length 54 [2019-11-07 04:05:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:39,757 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 754 transitions. [2019-11-07 04:05:39,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 754 transitions. [2019-11-07 04:05:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-07 04:05:39,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:39,759 INFO L410 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-11-07 04:05:39,760 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash -289383489, now seen corresponding path program 1 times [2019-11-07 04:05:39,760 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:39,760 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554000522] [2019-11-07 04:05:39,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:05:39,816 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554000522] [2019-11-07 04:05:39,816 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:39,816 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:39,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322037479] [2019-11-07 04:05:39,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:39,818 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:39,819 INFO L87 Difference]: Start difference. First operand 587 states and 754 transitions. Second operand 5 states. [2019-11-07 04:05:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:40,350 INFO L93 Difference]: Finished difference Result 877 states and 1124 transitions. [2019-11-07 04:05:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:40,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-07 04:05:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:40,355 INFO L225 Difference]: With dead ends: 877 [2019-11-07 04:05:40,355 INFO L226 Difference]: Without dead ends: 587 [2019-11-07 04:05:40,357 INFO L630 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-11-07 04:05:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-11-07 04:05:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-11-07 04:05:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-07 04:05:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 742 transitions. [2019-11-07 04:05:40,401 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 742 transitions. Word has length 67 [2019-11-07 04:05:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:40,402 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 742 transitions. [2019-11-07 04:05:40,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 742 transitions. [2019-11-07 04:05:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-07 04:05:40,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:40,406 INFO L410 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-11-07 04:05:40,406 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash 750568491, now seen corresponding path program 1 times [2019-11-07 04:05:40,407 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:40,407 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965811632] [2019-11-07 04:05:40,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:05:40,450 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965811632] [2019-11-07 04:05:40,450 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:40,450 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:40,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311719204] [2019-11-07 04:05:40,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:40,451 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:40,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:40,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:40,451 INFO L87 Difference]: Start difference. First operand 587 states and 742 transitions. Second operand 3 states. [2019-11-07 04:05:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:40,489 INFO L93 Difference]: Finished difference Result 717 states and 897 transitions. [2019-11-07 04:05:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:40,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-07 04:05:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:40,492 INFO L225 Difference]: With dead ends: 717 [2019-11-07 04:05:40,493 INFO L226 Difference]: Without dead ends: 565 [2019-11-07 04:05:40,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-07 04:05:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2019-11-07 04:05:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-07 04:05:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 705 transitions. [2019-11-07 04:05:40,539 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 705 transitions. Word has length 68 [2019-11-07 04:05:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:40,539 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 705 transitions. [2019-11-07 04:05:40,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 705 transitions. [2019-11-07 04:05:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:05:40,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:40,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:40,543 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:40,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash 876079827, now seen corresponding path program 1 times [2019-11-07 04:05:40,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:40,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390985839] [2019-11-07 04:05:40,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:40,689 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390985839] [2019-11-07 04:05:40,689 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:40,689 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:05:40,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442679103] [2019-11-07 04:05:40,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:05:40,690 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:40,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:05:40,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:05:40,690 INFO L87 Difference]: Start difference. First operand 563 states and 705 transitions. Second operand 14 states. [2019-11-07 04:05:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:41,167 INFO L93 Difference]: Finished difference Result 605 states and 755 transitions. [2019-11-07 04:05:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:05:41,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-07 04:05:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:41,172 INFO L225 Difference]: With dead ends: 605 [2019-11-07 04:05:41,172 INFO L226 Difference]: Without dead ends: 582 [2019-11-07 04:05:41,173 INFO L630 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-11-07 04:05:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-07 04:05:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 567. [2019-11-07 04:05:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-11-07 04:05:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 711 transitions. [2019-11-07 04:05:41,254 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 711 transitions. Word has length 55 [2019-11-07 04:05:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:41,254 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 711 transitions. [2019-11-07 04:05:41,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:05:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 711 transitions. [2019-11-07 04:05:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:05:41,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:41,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:41,257 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1672905161, now seen corresponding path program 1 times [2019-11-07 04:05:41,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:41,258 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821452530] [2019-11-07 04:05:41,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:41,441 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821452530] [2019-11-07 04:05:41,441 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:41,442 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 04:05:41,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341547037] [2019-11-07 04:05:41,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 04:05:41,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 04:05:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:05:41,444 INFO L87 Difference]: Start difference. First operand 567 states and 711 transitions. Second operand 13 states. [2019-11-07 04:05:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:41,732 INFO L93 Difference]: Finished difference Result 583 states and 728 transitions. [2019-11-07 04:05:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:05:41,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-11-07 04:05:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:41,738 INFO L225 Difference]: With dead ends: 583 [2019-11-07 04:05:41,738 INFO L226 Difference]: Without dead ends: 562 [2019-11-07 04:05:41,739 INFO L630 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-11-07 04:05:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-07 04:05:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-11-07 04:05:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-07 04:05:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 704 transitions. [2019-11-07 04:05:41,794 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 704 transitions. Word has length 55 [2019-11-07 04:05:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:41,794 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 704 transitions. [2019-11-07 04:05:41,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 04:05:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 704 transitions. [2019-11-07 04:05:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:05:41,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:41,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:41,797 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2129275013, now seen corresponding path program 1 times [2019-11-07 04:05:41,797 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:41,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699274534] [2019-11-07 04:05:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:41,909 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699274534] [2019-11-07 04:05:41,909 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:41,909 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:41,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29981750] [2019-11-07 04:05:41,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:41,910 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:41,910 INFO L87 Difference]: Start difference. First operand 562 states and 704 transitions. Second operand 5 states. [2019-11-07 04:05:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:42,386 INFO L93 Difference]: Finished difference Result 657 states and 811 transitions. [2019-11-07 04:05:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:05:42,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 04:05:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:42,389 INFO L225 Difference]: With dead ends: 657 [2019-11-07 04:05:42,389 INFO L226 Difference]: Without dead ends: 584 [2019-11-07 04:05:42,390 INFO L630 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-11-07 04:05:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-11-07 04:05:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 563. [2019-11-07 04:05:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-07 04:05:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-11-07 04:05:42,440 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 59 [2019-11-07 04:05:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:42,441 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-11-07 04:05:42,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-11-07 04:05:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:05:42,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:42,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:42,444 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2136791779, now seen corresponding path program 1 times [2019-11-07 04:05:42,444 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:42,445 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900801617] [2019-11-07 04:05:42,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:42,551 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900801617] [2019-11-07 04:05:42,551 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:42,552 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:42,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340526833] [2019-11-07 04:05:42,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:42,553 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:42,556 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 11 states. [2019-11-07 04:05:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:42,702 INFO L93 Difference]: Finished difference Result 599 states and 743 transitions. [2019-11-07 04:05:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:42,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-07 04:05:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:42,705 INFO L225 Difference]: With dead ends: 599 [2019-11-07 04:05:42,705 INFO L226 Difference]: Without dead ends: 576 [2019-11-07 04:05:42,707 INFO L630 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-11-07 04:05:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-11-07 04:05:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 563. [2019-11-07 04:05:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-07 04:05:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-11-07 04:05:42,754 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 56 [2019-11-07 04:05:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:42,754 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-11-07 04:05:42,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-11-07 04:05:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:05:42,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:42,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:42,756 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -59246208, now seen corresponding path program 1 times [2019-11-07 04:05:42,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:42,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379448366] [2019-11-07 04:05:42,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:42,786 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379448366] [2019-11-07 04:05:42,786 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:42,786 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:42,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224245891] [2019-11-07 04:05:42,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:42,787 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:42,788 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 3 states. [2019-11-07 04:05:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:42,823 INFO L93 Difference]: Finished difference Result 714 states and 878 transitions. [2019-11-07 04:05:42,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:42,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 04:05:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:42,826 INFO L225 Difference]: With dead ends: 714 [2019-11-07 04:05:42,826 INFO L226 Difference]: Without dead ends: 520 [2019-11-07 04:05:42,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-07 04:05:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 502. [2019-11-07 04:05:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-11-07 04:05:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 602 transitions. [2019-11-07 04:05:42,874 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 602 transitions. Word has length 56 [2019-11-07 04:05:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:42,875 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 602 transitions. [2019-11-07 04:05:42,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 602 transitions. [2019-11-07 04:05:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:05:42,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:42,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:42,880 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash -775523185, now seen corresponding path program 1 times [2019-11-07 04:05:42,881 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:42,881 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115455614] [2019-11-07 04:05:42,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:43,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115455614] [2019-11-07 04:05:43,012 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:43,012 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 04:05:43,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294184425] [2019-11-07 04:05:43,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 04:05:43,013 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:43,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 04:05:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:05:43,013 INFO L87 Difference]: Start difference. First operand 502 states and 602 transitions. Second operand 13 states. [2019-11-07 04:05:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:43,433 INFO L93 Difference]: Finished difference Result 518 states and 619 transitions. [2019-11-07 04:05:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:05:43,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-07 04:05:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:43,437 INFO L225 Difference]: With dead ends: 518 [2019-11-07 04:05:43,437 INFO L226 Difference]: Without dead ends: 497 [2019-11-07 04:05:43,438 INFO L630 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-11-07 04:05:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-11-07 04:05:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-11-07 04:05:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-11-07 04:05:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 595 transitions. [2019-11-07 04:05:43,497 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 595 transitions. Word has length 56 [2019-11-07 04:05:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:43,498 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 595 transitions. [2019-11-07 04:05:43,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 04:05:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 595 transitions. [2019-11-07 04:05:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:05:43,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:43,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:43,500 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599993, now seen corresponding path program 1 times [2019-11-07 04:05:43,501 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:43,501 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626418825] [2019-11-07 04:05:43,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:43,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626418825] [2019-11-07 04:05:43,674 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:43,674 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:43,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140958050] [2019-11-07 04:05:43,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:43,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:43,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:43,678 INFO L87 Difference]: Start difference. First operand 497 states and 595 transitions. Second operand 11 states. [2019-11-07 04:05:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:43,826 INFO L93 Difference]: Finished difference Result 521 states and 621 transitions. [2019-11-07 04:05:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:43,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-11-07 04:05:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:43,830 INFO L225 Difference]: With dead ends: 521 [2019-11-07 04:05:43,831 INFO L226 Difference]: Without dead ends: 494 [2019-11-07 04:05:43,831 INFO L630 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-11-07 04:05:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-07 04:05:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-11-07 04:05:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-07 04:05:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 590 transitions. [2019-11-07 04:05:43,872 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 590 transitions. Word has length 57 [2019-11-07 04:05:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:43,872 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 590 transitions. [2019-11-07 04:05:43,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 590 transitions. [2019-11-07 04:05:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:05:43,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:43,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:43,875 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash -504628611, now seen corresponding path program 1 times [2019-11-07 04:05:43,876 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:43,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343005822] [2019-11-07 04:05:43,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:44,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343005822] [2019-11-07 04:05:44,028 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:44,028 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:05:44,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44594163] [2019-11-07 04:05:44,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:05:44,029 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:05:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:44,029 INFO L87 Difference]: Start difference. First operand 494 states and 590 transitions. Second operand 12 states. [2019-11-07 04:05:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:44,239 INFO L93 Difference]: Finished difference Result 517 states and 614 transitions. [2019-11-07 04:05:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:05:44,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-11-07 04:05:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:44,243 INFO L225 Difference]: With dead ends: 517 [2019-11-07 04:05:44,243 INFO L226 Difference]: Without dead ends: 494 [2019-11-07 04:05:44,244 INFO L630 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-11-07 04:05:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-07 04:05:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2019-11-07 04:05:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-11-07 04:05:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 586 transitions. [2019-11-07 04:05:44,282 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 586 transitions. Word has length 59 [2019-11-07 04:05:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:44,282 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 586 transitions. [2019-11-07 04:05:44,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:05:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 586 transitions. [2019-11-07 04:05:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:05:44,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:44,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:44,285 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1947857079, now seen corresponding path program 1 times [2019-11-07 04:05:44,285 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:44,287 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630602088] [2019-11-07 04:05:44,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:44,471 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630602088] [2019-11-07 04:05:44,472 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:44,472 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:05:44,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381942257] [2019-11-07 04:05:44,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:05:44,473 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:05:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:05:44,474 INFO L87 Difference]: Start difference. First operand 492 states and 586 transitions. Second operand 14 states. [2019-11-07 04:05:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:44,763 INFO L93 Difference]: Finished difference Result 517 states and 613 transitions. [2019-11-07 04:05:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:05:44,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-11-07 04:05:44,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:44,766 INFO L225 Difference]: With dead ends: 517 [2019-11-07 04:05:44,766 INFO L226 Difference]: Without dead ends: 491 [2019-11-07 04:05:44,772 INFO L630 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-11-07 04:05:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-07 04:05:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2019-11-07 04:05:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-07 04:05:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 581 transitions. [2019-11-07 04:05:44,812 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 581 transitions. Word has length 59 [2019-11-07 04:05:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:44,812 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 581 transitions. [2019-11-07 04:05:44,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:05:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 581 transitions. [2019-11-07 04:05:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 04:05:44,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:44,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:44,815 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1680440093, now seen corresponding path program 1 times [2019-11-07 04:05:44,816 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:44,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37396685] [2019-11-07 04:05:44,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:44,989 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37396685] [2019-11-07 04:05:44,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:44,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:05:44,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706976991] [2019-11-07 04:05:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:05:44,992 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:05:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:05:44,993 INFO L87 Difference]: Start difference. First operand 489 states and 581 transitions. Second operand 14 states. [2019-11-07 04:05:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:45,227 INFO L93 Difference]: Finished difference Result 514 states and 608 transitions. [2019-11-07 04:05:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:05:45,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-11-07 04:05:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:45,231 INFO L225 Difference]: With dead ends: 514 [2019-11-07 04:05:45,231 INFO L226 Difference]: Without dead ends: 486 [2019-11-07 04:05:45,231 INFO L630 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-11-07 04:05:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-07 04:05:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2019-11-07 04:05:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-07 04:05:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 574 transitions. [2019-11-07 04:05:45,270 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 574 transitions. Word has length 60 [2019-11-07 04:05:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:45,271 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 574 transitions. [2019-11-07 04:05:45,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:05:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 574 transitions. [2019-11-07 04:05:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 04:05:45,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:45,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:45,273 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1741479821, now seen corresponding path program 1 times [2019-11-07 04:05:45,274 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:45,274 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673196371] [2019-11-07 04:05:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:45,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673196371] [2019-11-07 04:05:45,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:45,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:05:45,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948127802] [2019-11-07 04:05:45,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:05:45,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:05:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:05:45,470 INFO L87 Difference]: Start difference. First operand 484 states and 574 transitions. Second operand 14 states. [2019-11-07 04:05:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:45,819 INFO L93 Difference]: Finished difference Result 509 states and 601 transitions. [2019-11-07 04:05:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:05:45,819 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-11-07 04:05:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:45,822 INFO L225 Difference]: With dead ends: 509 [2019-11-07 04:05:45,822 INFO L226 Difference]: Without dead ends: 483 [2019-11-07 04:05:45,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:05:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-07 04:05:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-11-07 04:05:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-11-07 04:05:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 569 transitions. [2019-11-07 04:05:45,863 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 569 transitions. Word has length 60 [2019-11-07 04:05:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:45,864 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 569 transitions. [2019-11-07 04:05:45,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:05:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 569 transitions. [2019-11-07 04:05:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:05:45,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:45,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:45,866 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1499433800, now seen corresponding path program 1 times [2019-11-07 04:05:45,867 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:45,867 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287842448] [2019-11-07 04:05:45,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:45,993 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287842448] [2019-11-07 04:05:45,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:45,994 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:05:45,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155099915] [2019-11-07 04:05:45,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:05:45,995 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:05:45,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:45,996 INFO L87 Difference]: Start difference. First operand 481 states and 569 transitions. Second operand 12 states. [2019-11-07 04:05:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:46,219 INFO L93 Difference]: Finished difference Result 502 states and 591 transitions. [2019-11-07 04:05:46,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:05:46,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-11-07 04:05:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:46,222 INFO L225 Difference]: With dead ends: 502 [2019-11-07 04:05:46,222 INFO L226 Difference]: Without dead ends: 479 [2019-11-07 04:05:46,223 INFO L630 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-11-07 04:05:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-07 04:05:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-07 04:05:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-07 04:05:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 565 transitions. [2019-11-07 04:05:46,260 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 565 transitions. Word has length 58 [2019-11-07 04:05:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:46,260 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 565 transitions. [2019-11-07 04:05:46,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:05:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 565 transitions. [2019-11-07 04:05:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:05:46,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:46,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:46,262 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:46,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash -913481009, now seen corresponding path program 1 times [2019-11-07 04:05:46,263 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:46,263 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989191931] [2019-11-07 04:05:46,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:46,375 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989191931] [2019-11-07 04:05:46,375 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:46,375 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:46,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946570382] [2019-11-07 04:05:46,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:46,376 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:46,376 INFO L87 Difference]: Start difference. First operand 479 states and 565 transitions. Second operand 11 states. [2019-11-07 04:05:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:46,516 INFO L93 Difference]: Finished difference Result 503 states and 591 transitions. [2019-11-07 04:05:46,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:46,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-11-07 04:05:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:46,518 INFO L225 Difference]: With dead ends: 503 [2019-11-07 04:05:46,518 INFO L226 Difference]: Without dead ends: 476 [2019-11-07 04:05:46,519 INFO L630 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-11-07 04:05:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-11-07 04:05:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-11-07 04:05:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-07 04:05:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 560 transitions. [2019-11-07 04:05:46,555 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 560 transitions. Word has length 59 [2019-11-07 04:05:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:46,555 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 560 transitions. [2019-11-07 04:05:46,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 560 transitions. [2019-11-07 04:05:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 04:05:46,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:46,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:46,558 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1493575287, now seen corresponding path program 1 times [2019-11-07 04:05:46,558 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:46,558 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119386386] [2019-11-07 04:05:46,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:46,731 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119386386] [2019-11-07 04:05:46,731 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:46,732 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:05:46,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758189959] [2019-11-07 04:05:46,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:05:46,735 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:05:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:05:46,737 INFO L87 Difference]: Start difference. First operand 476 states and 560 transitions. Second operand 14 states. [2019-11-07 04:05:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:46,975 INFO L93 Difference]: Finished difference Result 499 states and 585 transitions. [2019-11-07 04:05:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:05:46,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-11-07 04:05:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:46,978 INFO L225 Difference]: With dead ends: 499 [2019-11-07 04:05:46,978 INFO L226 Difference]: Without dead ends: 474 [2019-11-07 04:05:46,979 INFO L630 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-11-07 04:05:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-07 04:05:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-11-07 04:05:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-07 04:05:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 556 transitions. [2019-11-07 04:05:47,016 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 556 transitions. Word has length 60 [2019-11-07 04:05:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:47,017 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 556 transitions. [2019-11-07 04:05:47,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:05:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 556 transitions. [2019-11-07 04:05:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 04:05:47,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:47,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:47,019 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 604665947, now seen corresponding path program 1 times [2019-11-07 04:05:47,020 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:47,020 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897319837] [2019-11-07 04:05:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:47,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897319837] [2019-11-07 04:05:47,132 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:47,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:47,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406911908] [2019-11-07 04:05:47,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:47,132 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:47,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:47,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:47,133 INFO L87 Difference]: Start difference. First operand 474 states and 556 transitions. Second operand 11 states. [2019-11-07 04:05:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:47,266 INFO L93 Difference]: Finished difference Result 498 states and 582 transitions. [2019-11-07 04:05:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:47,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-11-07 04:05:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:47,269 INFO L225 Difference]: With dead ends: 498 [2019-11-07 04:05:47,269 INFO L226 Difference]: Without dead ends: 472 [2019-11-07 04:05:47,271 INFO L630 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-11-07 04:05:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-07 04:05:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-11-07 04:05:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-11-07 04:05:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 552 transitions. [2019-11-07 04:05:47,309 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 552 transitions. Word has length 60 [2019-11-07 04:05:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:47,309 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 552 transitions. [2019-11-07 04:05:47,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 552 transitions. [2019-11-07 04:05:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-07 04:05:47,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:47,311 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:47,311 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash -640615229, now seen corresponding path program 1 times [2019-11-07 04:05:47,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:47,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077887784] [2019-11-07 04:05:47,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:47,398 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077887784] [2019-11-07 04:05:47,399 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:47,399 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:47,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023236531] [2019-11-07 04:05:47,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:47,400 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:47,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:47,401 INFO L87 Difference]: Start difference. First operand 472 states and 552 transitions. Second operand 11 states. [2019-11-07 04:05:47,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:47,610 INFO L93 Difference]: Finished difference Result 482 states and 561 transitions. [2019-11-07 04:05:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:47,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-11-07 04:05:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:47,615 INFO L225 Difference]: With dead ends: 482 [2019-11-07 04:05:47,615 INFO L226 Difference]: Without dead ends: 476 [2019-11-07 04:05:47,616 INFO L630 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-11-07 04:05:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-11-07 04:05:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-11-07 04:05:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-07 04:05:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 547 transitions. [2019-11-07 04:05:47,655 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 547 transitions. Word has length 61 [2019-11-07 04:05:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:47,655 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 547 transitions. [2019-11-07 04:05:47,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 547 transitions. [2019-11-07 04:05:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-07 04:05:47,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:47,658 INFO L410 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-11-07 04:05:47,658 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 934869385, now seen corresponding path program 1 times [2019-11-07 04:05:47,659 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:47,659 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729876579] [2019-11-07 04:05:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 04:05:47,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729876579] [2019-11-07 04:05:47,787 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:47,788 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:05:47,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98668116] [2019-11-07 04:05:47,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:05:47,788 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:05:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:05:47,789 INFO L87 Difference]: Start difference. First operand 470 states and 547 transitions. Second operand 6 states. [2019-11-07 04:05:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:47,895 INFO L93 Difference]: Finished difference Result 541 states and 628 transitions. [2019-11-07 04:05:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:05:47,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-11-07 04:05:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:47,897 INFO L225 Difference]: With dead ends: 541 [2019-11-07 04:05:47,897 INFO L226 Difference]: Without dead ends: 468 [2019-11-07 04:05:47,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:05:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-07 04:05:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2019-11-07 04:05:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-11-07 04:05:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 544 transitions. [2019-11-07 04:05:47,952 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 544 transitions. Word has length 76 [2019-11-07 04:05:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 544 transitions. [2019-11-07 04:05:47,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:05:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 544 transitions. [2019-11-07 04:05:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 04:05:47,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:47,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:47,956 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash 838416403, now seen corresponding path program 1 times [2019-11-07 04:05:47,956 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:47,956 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107700540] [2019-11-07 04:05:47,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:05:48,067 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107700540] [2019-11-07 04:05:48,067 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:48,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:05:48,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910674663] [2019-11-07 04:05:48,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:05:48,068 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:05:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:48,068 INFO L87 Difference]: Start difference. First operand 468 states and 544 transitions. Second operand 11 states. [2019-11-07 04:05:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:48,222 INFO L93 Difference]: Finished difference Result 492 states and 570 transitions. [2019-11-07 04:05:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:05:48,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-07 04:05:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:48,224 INFO L225 Difference]: With dead ends: 492 [2019-11-07 04:05:48,225 INFO L226 Difference]: Without dead ends: 461 [2019-11-07 04:05:48,225 INFO L630 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-11-07 04:05:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-07 04:05:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-11-07 04:05:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-11-07 04:05:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 533 transitions. [2019-11-07 04:05:48,277 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 533 transitions. Word has length 63 [2019-11-07 04:05:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:48,277 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 533 transitions. [2019-11-07 04:05:48,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:05:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 533 transitions. [2019-11-07 04:05:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 04:05:48,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:48,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:48,280 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash 910840807, now seen corresponding path program 1 times [2019-11-07 04:05:48,281 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:48,281 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207073654] [2019-11-07 04:05:48,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat