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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:02,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:02,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:02,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:02,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:02,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:02,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:02,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:02,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:02,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:02,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:02,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:02,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:02,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:02,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:02,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:02,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:02,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:02,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:02,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:02,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:02,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:02,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:02,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:02,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:02,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:02,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:02,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:02,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:02,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:02,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:02,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:02,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:02,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:02,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:02,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:02,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:02,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:02,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:02,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:02,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:02,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:05:02,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:02,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:02,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:02,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:02,796 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:02,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:02,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:02,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:02,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:02,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:02,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:02,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:02,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:02,799 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:02,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:02,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:02,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:02,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:02,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:02,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:02,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:02,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:02,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:02,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:02,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:02,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:02,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:02,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:02,803 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:05:03,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:03,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:03,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:03,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:03,144 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:03,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-15 03:05:03,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc14f0e61/5e698bdd05e44c9f8d5a6a202e22ea03/FLAG087e21970 [2019-10-15 03:05:03,782 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:03,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-15 03:05:03,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc14f0e61/5e698bdd05e44c9f8d5a6a202e22ea03/FLAG087e21970 [2019-10-15 03:05:04,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc14f0e61/5e698bdd05e44c9f8d5a6a202e22ea03 [2019-10-15 03:05:04,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:04,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:04,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:04,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:04,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:04,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:04,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27510171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04, skipping insertion in model container [2019-10-15 03:05:04,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:04,043 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:04,097 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:04,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:04,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:04,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:04,947 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:04,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04 WrapperNode [2019-10-15 03:05:04,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:04,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:04,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:04,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:04,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:04,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:04,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:04,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:05,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:05,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:05,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... [2019-10-15 03:05:05,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:05,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:05,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:05,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:05,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:05,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:05,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:05,182 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:05,182 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:05,183 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-15 03:05:05,183 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-15 03:05:05,183 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-15 03:05:05,183 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-15 03:05:05,183 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-15 03:05:05,184 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-15 03:05:05,184 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-15 03:05:05,184 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-15 03:05:05,184 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-15 03:05:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-15 03:05:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-15 03:05:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-15 03:05:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-15 03:05:05,185 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-15 03:05:05,186 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-15 03:05:05,186 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-15 03:05:05,186 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-15 03:05:05,186 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:05,187 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 03:05:05,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 03:05:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-15 03:05:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-15 03:05:05,190 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-15 03:05:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-15 03:05:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:05,898 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,059 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 03:05:06,060 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 03:05:06,074 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,151 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 03:05:06,151 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 03:05:06,203 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,222 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:06,222 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:06,352 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,419 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-15 03:05:06,419 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 03:05:06,419 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 03:05:06,426 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,652 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-15 03:05:06,652 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-15 03:05:06,653 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,689 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 03:05:06,689 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 03:05:06,722 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:06,744 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 03:05:06,744 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 03:05:06,749 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-15 03:05:07,100 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-15 03:05:07,151 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:07,176 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:07,177 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:07,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:07,954 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:05:07,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:07 BoogieIcfgContainer [2019-10-15 03:05:07,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:07,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:07,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:07,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:07,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:04" (1/3) ... [2019-10-15 03:05:07,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fce534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:07, skipping insertion in model container [2019-10-15 03:05:07,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:04" (2/3) ... [2019-10-15 03:05:07,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fce534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:07, skipping insertion in model container [2019-10-15 03:05:07,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:07" (3/3) ... [2019-10-15 03:05:07,967 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-10-15 03:05:07,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:07,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:07,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:08,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:08,048 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:08,048 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:08,048 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:08,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:08,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:08,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:08,049 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2019-10-15 03:05:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:08,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:08,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:08,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1896705104, now seen corresponding path program 1 times [2019-10-15 03:05:08,097 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:08,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811682754] [2019-10-15 03:05:08,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:08,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:08,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:08,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811682754] [2019-10-15 03:05:08,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:08,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:08,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544294492] [2019-10-15 03:05:08,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:08,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:08,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:08,426 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2019-10-15 03:05:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:08,658 INFO L93 Difference]: Finished difference Result 706 states and 1095 transitions. [2019-10-15 03:05:08,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:08,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:08,686 INFO L225 Difference]: With dead ends: 706 [2019-10-15 03:05:08,686 INFO L226 Difference]: Without dead ends: 404 [2019-10-15 03:05:08,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-15 03:05:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-15 03:05:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-15 03:05:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 582 transitions. [2019-10-15 03:05:08,786 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 582 transitions. Word has length 18 [2019-10-15 03:05:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:08,787 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 582 transitions. [2019-10-15 03:05:08,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 582 transitions. [2019-10-15 03:05:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:05:08,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:08,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:08,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash -120255175, now seen corresponding path program 1 times [2019-10-15 03:05:08,790 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:08,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20173539] [2019-10-15 03:05:08,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:08,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:08,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:08,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20173539] [2019-10-15 03:05:08,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:08,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:08,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240189519] [2019-10-15 03:05:08,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:08,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:08,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:08,914 INFO L87 Difference]: Start difference. First operand 404 states and 582 transitions. Second operand 3 states. [2019-10-15 03:05:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:09,186 INFO L93 Difference]: Finished difference Result 576 states and 812 transitions. [2019-10-15 03:05:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:09,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:05:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:09,199 INFO L225 Difference]: With dead ends: 576 [2019-10-15 03:05:09,200 INFO L226 Difference]: Without dead ends: 477 [2019-10-15 03:05:09,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-15 03:05:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2019-10-15 03:05:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-10-15 03:05:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 675 transitions. [2019-10-15 03:05:09,285 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 675 transitions. Word has length 21 [2019-10-15 03:05:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:09,285 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 675 transitions. [2019-10-15 03:05:09,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 675 transitions. [2019-10-15 03:05:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 03:05:09,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:09,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:09,295 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash -845502214, now seen corresponding path program 1 times [2019-10-15 03:05:09,295 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:09,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772591146] [2019-10-15 03:05:09,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:09,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772591146] [2019-10-15 03:05:09,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:09,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:09,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011255599] [2019-10-15 03:05:09,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:09,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,495 INFO L87 Difference]: Start difference. First operand 473 states and 675 transitions. Second operand 3 states. [2019-10-15 03:05:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:09,575 INFO L93 Difference]: Finished difference Result 691 states and 959 transitions. [2019-10-15 03:05:09,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:09,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 03:05:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:09,587 INFO L225 Difference]: With dead ends: 691 [2019-10-15 03:05:09,587 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 03:05:09,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 03:05:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2019-10-15 03:05:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-15 03:05:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 767 transitions. [2019-10-15 03:05:09,635 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 767 transitions. Word has length 26 [2019-10-15 03:05:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 767 transitions. [2019-10-15 03:05:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 767 transitions. [2019-10-15 03:05:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 03:05:09,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:09,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:09,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash 502235177, now seen corresponding path program 1 times [2019-10-15 03:05:09,639 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:09,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496924309] [2019-10-15 03:05:09,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:09,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:09,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496924309] [2019-10-15 03:05:09,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:09,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:09,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160671537] [2019-10-15 03:05:09,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:09,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,706 INFO L87 Difference]: Start difference. First operand 543 states and 767 transitions. Second operand 3 states. [2019-10-15 03:05:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:09,958 INFO L93 Difference]: Finished difference Result 1030 states and 1499 transitions. [2019-10-15 03:05:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:09,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 03:05:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:09,965 INFO L225 Difference]: With dead ends: 1030 [2019-10-15 03:05:09,965 INFO L226 Difference]: Without dead ends: 822 [2019-10-15 03:05:09,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-10-15 03:05:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 670. [2019-10-15 03:05:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-15 03:05:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 993 transitions. [2019-10-15 03:05:10,008 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 993 transitions. Word has length 27 [2019-10-15 03:05:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:10,008 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 993 transitions. [2019-10-15 03:05:10,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 993 transitions. [2019-10-15 03:05:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:05:10,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:10,010 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:10,010 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:10,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1848972292, now seen corresponding path program 1 times [2019-10-15 03:05:10,011 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:10,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964230719] [2019-10-15 03:05:10,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:10,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:10,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964230719] [2019-10-15 03:05:10,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:10,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:10,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049466863] [2019-10-15 03:05:10,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:10,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:10,084 INFO L87 Difference]: Start difference. First operand 670 states and 993 transitions. Second operand 5 states. [2019-10-15 03:05:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:11,198 INFO L93 Difference]: Finished difference Result 1138 states and 1680 transitions. [2019-10-15 03:05:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:11,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-15 03:05:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:11,209 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 03:05:11,209 INFO L226 Difference]: Without dead ends: 721 [2019-10-15 03:05:11,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-15 03:05:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 658. [2019-10-15 03:05:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-15 03:05:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 969 transitions. [2019-10-15 03:05:11,271 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 969 transitions. Word has length 28 [2019-10-15 03:05:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:11,272 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 969 transitions. [2019-10-15 03:05:11,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 969 transitions. [2019-10-15 03:05:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:05:11,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:11,274 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:11,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash 599155873, now seen corresponding path program 1 times [2019-10-15 03:05:11,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:11,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975381112] [2019-10-15 03:05:11,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:11,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975381112] [2019-10-15 03:05:11,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:11,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:11,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625134578] [2019-10-15 03:05:11,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:11,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,350 INFO L87 Difference]: Start difference. First operand 658 states and 969 transitions. Second operand 3 states. [2019-10-15 03:05:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:11,442 INFO L93 Difference]: Finished difference Result 661 states and 971 transitions. [2019-10-15 03:05:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:11,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-15 03:05:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:11,448 INFO L225 Difference]: With dead ends: 661 [2019-10-15 03:05:11,448 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 03:05:11,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 03:05:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 03:05:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 03:05:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 966 transitions. [2019-10-15 03:05:11,487 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 966 transitions. Word has length 29 [2019-10-15 03:05:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:11,487 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 966 transitions. [2019-10-15 03:05:11,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 966 transitions. [2019-10-15 03:05:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:11,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:11,490 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:11,490 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1989182425, now seen corresponding path program 1 times [2019-10-15 03:05:11,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:11,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688273522] [2019-10-15 03:05:11,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:11,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688273522] [2019-10-15 03:05:11,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:11,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:11,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262875040] [2019-10-15 03:05:11,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:11,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,547 INFO L87 Difference]: Start difference. First operand 657 states and 966 transitions. Second operand 3 states. [2019-10-15 03:05:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:11,597 INFO L93 Difference]: Finished difference Result 931 states and 1326 transitions. [2019-10-15 03:05:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:11,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 03:05:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:11,604 INFO L225 Difference]: With dead ends: 931 [2019-10-15 03:05:11,604 INFO L226 Difference]: Without dead ends: 741 [2019-10-15 03:05:11,606 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-15 03:05:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 639. [2019-10-15 03:05:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-15 03:05:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 905 transitions. [2019-10-15 03:05:11,682 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 905 transitions. Word has length 35 [2019-10-15 03:05:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:11,682 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 905 transitions. [2019-10-15 03:05:11,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 905 transitions. [2019-10-15 03:05:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:05:11,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:11,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:11,688 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1855799109, now seen corresponding path program 1 times [2019-10-15 03:05:11,688 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:11,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559850958] [2019-10-15 03:05:11,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:11,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559850958] [2019-10-15 03:05:11,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:11,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:11,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663394666] [2019-10-15 03:05:11,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:11,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:11,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,740 INFO L87 Difference]: Start difference. First operand 639 states and 905 transitions. Second operand 3 states. [2019-10-15 03:05:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:11,791 INFO L93 Difference]: Finished difference Result 707 states and 990 transitions. [2019-10-15 03:05:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:11,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 03:05:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:11,796 INFO L225 Difference]: With dead ends: 707 [2019-10-15 03:05:11,796 INFO L226 Difference]: Without dead ends: 687 [2019-10-15 03:05:11,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-15 03:05:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 678. [2019-10-15 03:05:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-15 03:05:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 952 transitions. [2019-10-15 03:05:11,837 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 952 transitions. Word has length 36 [2019-10-15 03:05:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:11,838 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 952 transitions. [2019-10-15 03:05:11,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 952 transitions. [2019-10-15 03:05:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:11,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:11,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:11,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash 935929741, now seen corresponding path program 1 times [2019-10-15 03:05:11,842 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:11,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431989089] [2019-10-15 03:05:11,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:11,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:11,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431989089] [2019-10-15 03:05:11,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:11,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:11,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447933746] [2019-10-15 03:05:11,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:11,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,898 INFO L87 Difference]: Start difference. First operand 678 states and 952 transitions. Second operand 3 states. [2019-10-15 03:05:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:11,968 INFO L93 Difference]: Finished difference Result 883 states and 1226 transitions. [2019-10-15 03:05:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:11,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:05:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:11,972 INFO L225 Difference]: With dead ends: 883 [2019-10-15 03:05:11,973 INFO L226 Difference]: Without dead ends: 709 [2019-10-15 03:05:11,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-15 03:05:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 678. [2019-10-15 03:05:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-15 03:05:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 950 transitions. [2019-10-15 03:05:12,016 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 950 transitions. Word has length 42 [2019-10-15 03:05:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,017 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 950 transitions. [2019-10-15 03:05:12,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 950 transitions. [2019-10-15 03:05:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:12,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:12,023 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1568310813, now seen corresponding path program 1 times [2019-10-15 03:05:12,024 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526817135] [2019-10-15 03:05:12,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:12,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526817135] [2019-10-15 03:05:12,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:12,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73901856] [2019-10-15 03:05:12,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:12,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:12,135 INFO L87 Difference]: Start difference. First operand 678 states and 950 transitions. Second operand 4 states. [2019-10-15 03:05:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,516 INFO L93 Difference]: Finished difference Result 779 states and 1066 transitions. [2019-10-15 03:05:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:12,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-15 03:05:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,523 INFO L225 Difference]: With dead ends: 779 [2019-10-15 03:05:12,523 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 03:05:12,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 03:05:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 576. [2019-10-15 03:05:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 03:05:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 795 transitions. [2019-10-15 03:05:12,605 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 795 transitions. Word has length 42 [2019-10-15 03:05:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,610 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 795 transitions. [2019-10-15 03:05:12,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 795 transitions. [2019-10-15 03:05:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:12,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:12,615 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash 78626218, now seen corresponding path program 1 times [2019-10-15 03:05:12,616 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364699577] [2019-10-15 03:05:12,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:12,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364699577] [2019-10-15 03:05:12,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:12,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97063413] [2019-10-15 03:05:12,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:12,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,685 INFO L87 Difference]: Start difference. First operand 576 states and 795 transitions. Second operand 3 states. [2019-10-15 03:05:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,785 INFO L93 Difference]: Finished difference Result 745 states and 1022 transitions. [2019-10-15 03:05:12,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:12,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 03:05:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,790 INFO L225 Difference]: With dead ends: 745 [2019-10-15 03:05:12,790 INFO L226 Difference]: Without dead ends: 731 [2019-10-15 03:05:12,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-15 03:05:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 647. [2019-10-15 03:05:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-15 03:05:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 881 transitions. [2019-10-15 03:05:12,827 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 881 transitions. Word has length 40 [2019-10-15 03:05:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,827 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 881 transitions. [2019-10-15 03:05:12,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 881 transitions. [2019-10-15 03:05:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:12,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:12,830 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1459422559, now seen corresponding path program 1 times [2019-10-15 03:05:12,831 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240098857] [2019-10-15 03:05:12,831 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:12,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240098857] [2019-10-15 03:05:12,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:12,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:12,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484103262] [2019-10-15 03:05:12,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:12,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,867 INFO L87 Difference]: Start difference. First operand 647 states and 881 transitions. Second operand 3 states. [2019-10-15 03:05:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:12,910 INFO L93 Difference]: Finished difference Result 756 states and 1006 transitions. [2019-10-15 03:05:12,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:12,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:05:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:12,915 INFO L225 Difference]: With dead ends: 756 [2019-10-15 03:05:12,916 INFO L226 Difference]: Without dead ends: 670 [2019-10-15 03:05:12,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-15 03:05:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 644. [2019-10-15 03:05:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-15 03:05:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 873 transitions. [2019-10-15 03:05:12,958 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 873 transitions. Word has length 43 [2019-10-15 03:05:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:12,958 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 873 transitions. [2019-10-15 03:05:12,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2019-10-15 03:05:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:12,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:12,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:12,961 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1413689562, now seen corresponding path program 1 times [2019-10-15 03:05:12,962 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:12,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200742972] [2019-10-15 03:05:12,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:12,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:13,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200742972] [2019-10-15 03:05:13,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:13,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:13,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138783353] [2019-10-15 03:05:13,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:13,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:13,130 INFO L87 Difference]: Start difference. First operand 644 states and 873 transitions. Second operand 10 states. [2019-10-15 03:05:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,347 INFO L93 Difference]: Finished difference Result 820 states and 1147 transitions. [2019-10-15 03:05:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:16,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-15 03:05:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,353 INFO L225 Difference]: With dead ends: 820 [2019-10-15 03:05:16,353 INFO L226 Difference]: Without dead ends: 812 [2019-10-15 03:05:16,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-15 03:05:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 651. [2019-10-15 03:05:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 03:05:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 875 transitions. [2019-10-15 03:05:16,401 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 875 transitions. Word has length 41 [2019-10-15 03:05:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,401 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 875 transitions. [2019-10-15 03:05:16,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 875 transitions. [2019-10-15 03:05:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:16,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:16,405 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1528304234, now seen corresponding path program 1 times [2019-10-15 03:05:16,406 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820013888] [2019-10-15 03:05:16,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820013888] [2019-10-15 03:05:16,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:16,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009538632] [2019-10-15 03:05:16,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:16,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:16,539 INFO L87 Difference]: Start difference. First operand 651 states and 875 transitions. Second operand 7 states. [2019-10-15 03:05:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:18,209 INFO L93 Difference]: Finished difference Result 780 states and 1084 transitions. [2019-10-15 03:05:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:18,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-15 03:05:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:18,217 INFO L225 Difference]: With dead ends: 780 [2019-10-15 03:05:18,217 INFO L226 Difference]: Without dead ends: 725 [2019-10-15 03:05:18,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-15 03:05:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 651. [2019-10-15 03:05:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 03:05:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 873 transitions. [2019-10-15 03:05:18,273 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 873 transitions. Word has length 41 [2019-10-15 03:05:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:18,273 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 873 transitions. [2019-10-15 03:05:18,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 873 transitions. [2019-10-15 03:05:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:18,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:18,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:18,277 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1515029715, now seen corresponding path program 1 times [2019-10-15 03:05:18,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:18,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032032132] [2019-10-15 03:05:18,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:18,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:18,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:18,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032032132] [2019-10-15 03:05:18,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:18,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:18,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100628513] [2019-10-15 03:05:18,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:18,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:18,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:18,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:18,444 INFO L87 Difference]: Start difference. First operand 651 states and 873 transitions. Second operand 9 states. [2019-10-15 03:05:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,443 INFO L93 Difference]: Finished difference Result 774 states and 1066 transitions. [2019-10-15 03:05:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:05:21,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-15 03:05:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,450 INFO L225 Difference]: With dead ends: 774 [2019-10-15 03:05:21,451 INFO L226 Difference]: Without dead ends: 721 [2019-10-15 03:05:21,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-15 03:05:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 586. [2019-10-15 03:05:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-15 03:05:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 789 transitions. [2019-10-15 03:05:21,518 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 789 transitions. Word has length 42 [2019-10-15 03:05:21,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,520 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 789 transitions. [2019-10-15 03:05:21,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 789 transitions. [2019-10-15 03:05:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:21,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:21,524 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash 23868549, now seen corresponding path program 1 times [2019-10-15 03:05:21,524 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846108518] [2019-10-15 03:05:21,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846108518] [2019-10-15 03:05:21,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:21,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017272471] [2019-10-15 03:05:21,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:21,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,600 INFO L87 Difference]: Start difference. First operand 586 states and 789 transitions. Second operand 3 states. [2019-10-15 03:05:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,748 INFO L93 Difference]: Finished difference Result 738 states and 988 transitions. [2019-10-15 03:05:21,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:21,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:05:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,755 INFO L225 Difference]: With dead ends: 738 [2019-10-15 03:05:21,755 INFO L226 Difference]: Without dead ends: 722 [2019-10-15 03:05:21,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-15 03:05:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 636. [2019-10-15 03:05:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-15 03:05:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 843 transitions. [2019-10-15 03:05:21,821 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 843 transitions. Word has length 42 [2019-10-15 03:05:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,822 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 843 transitions. [2019-10-15 03:05:21,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 843 transitions. [2019-10-15 03:05:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:21,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:21,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1183789995, now seen corresponding path program 1 times [2019-10-15 03:05:21,831 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684745298] [2019-10-15 03:05:21,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684745298] [2019-10-15 03:05:21,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:21,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29159906] [2019-10-15 03:05:21,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:22,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:22,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:22,001 INFO L87 Difference]: Start difference. First operand 636 states and 843 transitions. Second operand 8 states. [2019-10-15 03:05:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,410 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2019-10-15 03:05:22,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:22,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-15 03:05:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,415 INFO L225 Difference]: With dead ends: 651 [2019-10-15 03:05:22,415 INFO L226 Difference]: Without dead ends: 647 [2019-10-15 03:05:22,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-15 03:05:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-15 03:05:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-15 03:05:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 854 transitions. [2019-10-15 03:05:22,475 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 854 transitions. Word has length 43 [2019-10-15 03:05:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,476 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 854 transitions. [2019-10-15 03:05:22,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 854 transitions. [2019-10-15 03:05:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:22,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:22,479 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1183513165, now seen corresponding path program 1 times [2019-10-15 03:05:22,480 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526788928] [2019-10-15 03:05:22,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:22,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526788928] [2019-10-15 03:05:22,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:22,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611783207] [2019-10-15 03:05:22,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:22,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:22,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:22,580 INFO L87 Difference]: Start difference. First operand 645 states and 854 transitions. Second operand 5 states. [2019-10-15 03:05:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,807 INFO L93 Difference]: Finished difference Result 733 states and 977 transitions. [2019-10-15 03:05:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:23,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-15 03:05:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,815 INFO L225 Difference]: With dead ends: 733 [2019-10-15 03:05:23,815 INFO L226 Difference]: Without dead ends: 703 [2019-10-15 03:05:23,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-15 03:05:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 622. [2019-10-15 03:05:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-15 03:05:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 829 transitions. [2019-10-15 03:05:23,890 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 829 transitions. Word has length 43 [2019-10-15 03:05:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,890 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 829 transitions. [2019-10-15 03:05:23,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 829 transitions. [2019-10-15 03:05:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:05:23,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:23,895 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 442275922, now seen corresponding path program 1 times [2019-10-15 03:05:23,896 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074337372] [2019-10-15 03:05:23,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:23,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074337372] [2019-10-15 03:05:23,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:23,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812309617] [2019-10-15 03:05:23,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:23,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:24,000 INFO L87 Difference]: Start difference. First operand 622 states and 829 transitions. Second operand 3 states. [2019-10-15 03:05:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,197 INFO L93 Difference]: Finished difference Result 650 states and 861 transitions. [2019-10-15 03:05:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:24,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:05:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,204 INFO L225 Difference]: With dead ends: 650 [2019-10-15 03:05:24,205 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 03:05:24,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 03:05:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 639. [2019-10-15 03:05:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-15 03:05:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 849 transitions. [2019-10-15 03:05:24,290 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 849 transitions. Word has length 45 [2019-10-15 03:05:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,290 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 849 transitions. [2019-10-15 03:05:24,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 849 transitions. [2019-10-15 03:05:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:24,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:24,295 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 818895296, now seen corresponding path program 1 times [2019-10-15 03:05:24,296 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946414344] [2019-10-15 03:05:24,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946414344] [2019-10-15 03:05:24,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:24,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033215803] [2019-10-15 03:05:24,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:24,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:24,373 INFO L87 Difference]: Start difference. First operand 639 states and 849 transitions. Second operand 3 states. [2019-10-15 03:05:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,467 INFO L93 Difference]: Finished difference Result 811 states and 1071 transitions. [2019-10-15 03:05:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:24,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 03:05:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,472 INFO L225 Difference]: With dead ends: 811 [2019-10-15 03:05:24,472 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 03:05:24,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 03:05:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-15 03:05:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 03:05:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 813 transitions. [2019-10-15 03:05:24,589 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 813 transitions. Word has length 50 [2019-10-15 03:05:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,593 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 813 transitions. [2019-10-15 03:05:24,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 813 transitions. [2019-10-15 03:05:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:24,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:24,612 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash 59708023, now seen corresponding path program 1 times [2019-10-15 03:05:24,613 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896270906] [2019-10-15 03:05:24,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896270906] [2019-10-15 03:05:24,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:24,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919577483] [2019-10-15 03:05:24,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:24,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:24,955 INFO L87 Difference]: Start difference. First operand 612 states and 813 transitions. Second operand 13 states. [2019-10-15 03:05:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,135 INFO L93 Difference]: Finished difference Result 644 states and 847 transitions. [2019-10-15 03:05:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:27,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-15 03:05:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,141 INFO L225 Difference]: With dead ends: 644 [2019-10-15 03:05:27,141 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 03:05:27,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:05:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 03:05:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 612. [2019-10-15 03:05:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 03:05:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 812 transitions. [2019-10-15 03:05:27,188 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 812 transitions. Word has length 47 [2019-10-15 03:05:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,188 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 812 transitions. [2019-10-15 03:05:27,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 812 transitions. [2019-10-15 03:05:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:05:27,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,191 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,191 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2131872599, now seen corresponding path program 1 times [2019-10-15 03:05:27,192 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194620473] [2019-10-15 03:05:27,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194620473] [2019-10-15 03:05:27,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:27,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110339271] [2019-10-15 03:05:27,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:27,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:27,312 INFO L87 Difference]: Start difference. First operand 612 states and 812 transitions. Second operand 9 states. [2019-10-15 03:05:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,542 INFO L93 Difference]: Finished difference Result 636 states and 838 transitions. [2019-10-15 03:05:27,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:27,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-15 03:05:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,546 INFO L225 Difference]: With dead ends: 636 [2019-10-15 03:05:27,546 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 03:05:27,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:27,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 03:05:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-15 03:05:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 03:05:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 795 transitions. [2019-10-15 03:05:27,594 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 795 transitions. Word has length 48 [2019-10-15 03:05:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,594 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 795 transitions. [2019-10-15 03:05:27,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 795 transitions. [2019-10-15 03:05:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:27,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,597 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 693077134, now seen corresponding path program 1 times [2019-10-15 03:05:27,598 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673002267] [2019-10-15 03:05:27,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673002267] [2019-10-15 03:05:27,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:27,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787946819] [2019-10-15 03:05:27,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:27,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:27,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:27,748 INFO L87 Difference]: Start difference. First operand 607 states and 795 transitions. Second operand 11 states. [2019-10-15 03:05:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,164 INFO L93 Difference]: Finished difference Result 623 states and 812 transitions. [2019-10-15 03:05:28,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:28,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-15 03:05:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,171 INFO L225 Difference]: With dead ends: 623 [2019-10-15 03:05:28,171 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 03:05:28,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 03:05:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-15 03:05:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 03:05:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 791 transitions. [2019-10-15 03:05:28,219 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 791 transitions. Word has length 50 [2019-10-15 03:05:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 791 transitions. [2019-10-15 03:05:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 791 transitions. [2019-10-15 03:05:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:05:28,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:28,222 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1617361323, now seen corresponding path program 1 times [2019-10-15 03:05:28,223 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101767205] [2019-10-15 03:05:28,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101767205] [2019-10-15 03:05:28,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:28,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254003563] [2019-10-15 03:05:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:28,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:28,455 INFO L87 Difference]: Start difference. First operand 605 states and 791 transitions. Second operand 10 states. [2019-10-15 03:05:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,722 INFO L93 Difference]: Finished difference Result 621 states and 808 transitions. [2019-10-15 03:05:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:28,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-15 03:05:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,727 INFO L225 Difference]: With dead ends: 621 [2019-10-15 03:05:28,727 INFO L226 Difference]: Without dead ends: 603 [2019-10-15 03:05:28,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-15 03:05:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-15 03:05:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-15 03:05:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 787 transitions. [2019-10-15 03:05:28,795 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 787 transitions. Word has length 49 [2019-10-15 03:05:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,795 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 787 transitions. [2019-10-15 03:05:28,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 787 transitions. [2019-10-15 03:05:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:28,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:28,806 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1878962800, now seen corresponding path program 1 times [2019-10-15 03:05:28,806 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995086421] [2019-10-15 03:05:28,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995086421] [2019-10-15 03:05:28,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:28,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567588635] [2019-10-15 03:05:28,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:28,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:28,971 INFO L87 Difference]: Start difference. First operand 603 states and 787 transitions. Second operand 12 states. [2019-10-15 03:05:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,492 INFO L93 Difference]: Finished difference Result 628 states and 814 transitions. [2019-10-15 03:05:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:29,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-15 03:05:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,497 INFO L225 Difference]: With dead ends: 628 [2019-10-15 03:05:29,497 INFO L226 Difference]: Without dead ends: 604 [2019-10-15 03:05:29,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-15 03:05:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2019-10-15 03:05:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-15 03:05:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 776 transitions. [2019-10-15 03:05:29,539 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 776 transitions. Word has length 51 [2019-10-15 03:05:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,540 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 776 transitions. [2019-10-15 03:05:29,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 776 transitions. [2019-10-15 03:05:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:29,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:29,543 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1157902169, now seen corresponding path program 1 times [2019-10-15 03:05:29,543 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248018669] [2019-10-15 03:05:29,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248018669] [2019-10-15 03:05:29,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:29,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704228927] [2019-10-15 03:05:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:29,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:29,981 INFO L87 Difference]: Start difference. First operand 602 states and 776 transitions. Second operand 10 states. [2019-10-15 03:05:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,313 INFO L93 Difference]: Finished difference Result 615 states and 790 transitions. [2019-10-15 03:05:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:30,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-15 03:05:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,317 INFO L225 Difference]: With dead ends: 615 [2019-10-15 03:05:30,317 INFO L226 Difference]: Without dead ends: 597 [2019-10-15 03:05:30,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-15 03:05:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-15 03:05:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 03:05:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 769 transitions. [2019-10-15 03:05:30,363 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 769 transitions. Word has length 50 [2019-10-15 03:05:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,363 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 769 transitions. [2019-10-15 03:05:30,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 769 transitions. [2019-10-15 03:05:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:30,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:30,366 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash 226522084, now seen corresponding path program 1 times [2019-10-15 03:05:30,367 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432437618] [2019-10-15 03:05:30,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,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-10-15 03:05:30,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432437618] [2019-10-15 03:05:30,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:30,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595438912] [2019-10-15 03:05:30,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:30,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:30,473 INFO L87 Difference]: Start difference. First operand 597 states and 769 transitions. Second operand 5 states. [2019-10-15 03:05:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,678 INFO L93 Difference]: Finished difference Result 985 states and 1326 transitions. [2019-10-15 03:05:31,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:31,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:05:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,684 INFO L225 Difference]: With dead ends: 985 [2019-10-15 03:05:31,684 INFO L226 Difference]: Without dead ends: 860 [2019-10-15 03:05:31,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-15 03:05:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 628. [2019-10-15 03:05:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-15 03:05:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 814 transitions. [2019-10-15 03:05:31,743 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 814 transitions. Word has length 54 [2019-10-15 03:05:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,743 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 814 transitions. [2019-10-15 03:05:31,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 814 transitions. [2019-10-15 03:05:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:31,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,746 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:31,746 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1349453429, now seen corresponding path program 1 times [2019-10-15 03:05:31,747 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617440424] [2019-10-15 03:05:31,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:31,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617440424] [2019-10-15 03:05:31,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:31,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665680744] [2019-10-15 03:05:31,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:31,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:32,009 INFO L87 Difference]: Start difference. First operand 628 states and 814 transitions. Second operand 9 states. [2019-10-15 03:05:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,428 INFO L93 Difference]: Finished difference Result 652 states and 840 transitions. [2019-10-15 03:05:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:32,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-15 03:05:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,432 INFO L225 Difference]: With dead ends: 652 [2019-10-15 03:05:32,433 INFO L226 Difference]: Without dead ends: 601 [2019-10-15 03:05:32,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-15 03:05:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-15 03:05:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-15 03:05:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 766 transitions. [2019-10-15 03:05:32,478 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 766 transitions. Word has length 51 [2019-10-15 03:05:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,479 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 766 transitions. [2019-10-15 03:05:32,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 766 transitions. [2019-10-15 03:05:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:05:32,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:32,482 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,482 INFO L82 PathProgramCache]: Analyzing trace with hash -710700847, now seen corresponding path program 1 times [2019-10-15 03:05:32,483 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271276216] [2019-10-15 03:05:32,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:32,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271276216] [2019-10-15 03:05:32,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:32,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068280766] [2019-10-15 03:05:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:32,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:32,776 INFO L87 Difference]: Start difference. First operand 601 states and 766 transitions. Second operand 12 states. [2019-10-15 03:05:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,107 INFO L93 Difference]: Finished difference Result 624 states and 790 transitions. [2019-10-15 03:05:33,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:33,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-15 03:05:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,114 INFO L225 Difference]: With dead ends: 624 [2019-10-15 03:05:33,114 INFO L226 Difference]: Without dead ends: 601 [2019-10-15 03:05:33,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-15 03:05:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2019-10-15 03:05:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-15 03:05:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 762 transitions. [2019-10-15 03:05:33,178 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 762 transitions. Word has length 53 [2019-10-15 03:05:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,179 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 762 transitions. [2019-10-15 03:05:33,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 762 transitions. [2019-10-15 03:05:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:05:33,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:33,182 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1729124439, now seen corresponding path program 1 times [2019-10-15 03:05:33,182 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724715183] [2019-10-15 03:05:33,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:33,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724715183] [2019-10-15 03:05:33,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:33,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146773428] [2019-10-15 03:05:33,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:33,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:33,487 INFO L87 Difference]: Start difference. First operand 599 states and 762 transitions. Second operand 12 states. [2019-10-15 03:05:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,962 INFO L93 Difference]: Finished difference Result 622 states and 786 transitions. [2019-10-15 03:05:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:33,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-15 03:05:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,966 INFO L225 Difference]: With dead ends: 622 [2019-10-15 03:05:33,966 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 03:05:33,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 03:05:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-10-15 03:05:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 03:05:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 758 transitions. [2019-10-15 03:05:34,076 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 758 transitions. Word has length 58 [2019-10-15 03:05:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,077 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 758 transitions. [2019-10-15 03:05:34,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 758 transitions. [2019-10-15 03:05:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:34,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:34,081 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1908601480, now seen corresponding path program 1 times [2019-10-15 03:05:34,082 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87945523] [2019-10-15 03:05:34,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,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-10-15 03:05:34,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87945523] [2019-10-15 03:05:34,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:34,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956371290] [2019-10-15 03:05:34,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:34,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:34,290 INFO L87 Difference]: Start difference. First operand 597 states and 758 transitions. Second operand 12 states. [2019-10-15 03:05:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,647 INFO L93 Difference]: Finished difference Result 620 states and 782 transitions. [2019-10-15 03:05:34,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:34,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-15 03:05:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,652 INFO L225 Difference]: With dead ends: 620 [2019-10-15 03:05:34,652 INFO L226 Difference]: Without dead ends: 597 [2019-10-15 03:05:34,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-15 03:05:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-10-15 03:05:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-15 03:05:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2019-10-15 03:05:34,727 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 59 [2019-10-15 03:05:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,728 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2019-10-15 03:05:34,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2019-10-15 03:05:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:34,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:34,734 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1644206521, now seen corresponding path program 1 times [2019-10-15 03:05:34,735 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349833517] [2019-10-15 03:05:34,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:34,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349833517] [2019-10-15 03:05:34,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 03:05:34,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487368332] [2019-10-15 03:05:34,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 03:05:34,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 03:05:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:34,955 INFO L87 Difference]: Start difference. First operand 595 states and 754 transitions. Second operand 12 states. [2019-10-15 03:05:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,286 INFO L93 Difference]: Finished difference Result 616 states and 776 transitions. [2019-10-15 03:05:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:35,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-15 03:05:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,291 INFO L225 Difference]: With dead ends: 616 [2019-10-15 03:05:35,291 INFO L226 Difference]: Without dead ends: 593 [2019-10-15 03:05:35,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-15 03:05:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-15 03:05:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-15 03:05:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 750 transitions. [2019-10-15 03:05:35,391 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 750 transitions. Word has length 54 [2019-10-15 03:05:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,391 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 750 transitions. [2019-10-15 03:05:35,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 03:05:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 750 transitions. [2019-10-15 03:05:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:35,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,394 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1479206302, now seen corresponding path program 1 times [2019-10-15 03:05:35,395 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248390734] [2019-10-15 03:05:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,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-10-15 03:05:35,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248390734] [2019-10-15 03:05:35,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:35,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617357590] [2019-10-15 03:05:35,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:35,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:35,555 INFO L87 Difference]: Start difference. First operand 593 states and 750 transitions. Second operand 11 states. [2019-10-15 03:05:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,739 INFO L93 Difference]: Finished difference Result 654 states and 829 transitions. [2019-10-15 03:05:35,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:35,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-15 03:05:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,746 INFO L225 Difference]: With dead ends: 654 [2019-10-15 03:05:35,746 INFO L226 Difference]: Without dead ends: 603 [2019-10-15 03:05:35,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-15 03:05:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2019-10-15 03:05:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 03:05:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 767 transitions. [2019-10-15 03:05:35,849 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 767 transitions. Word has length 54 [2019-10-15 03:05:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,850 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 767 transitions. [2019-10-15 03:05:35,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 767 transitions. [2019-10-15 03:05:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-15 03:05:35,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,855 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,856 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash 561992256, now seen corresponding path program 1 times [2019-10-15 03:05:35,857 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853398718] [2019-10-15 03:05:35,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:05:35,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853398718] [2019-10-15 03:05:35,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:35,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036005961] [2019-10-15 03:05:35,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:35,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:35,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:35,969 INFO L87 Difference]: Start difference. First operand 597 states and 767 transitions. Second operand 5 states. [2019-10-15 03:05:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,636 INFO L93 Difference]: Finished difference Result 883 states and 1129 transitions. [2019-10-15 03:05:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:36,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-15 03:05:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,639 INFO L225 Difference]: With dead ends: 883 [2019-10-15 03:05:36,639 INFO L226 Difference]: Without dead ends: 597 [2019-10-15 03:05:36,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-15 03:05:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-15 03:05:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-15 03:05:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 755 transitions. [2019-10-15 03:05:36,685 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 755 transitions. Word has length 67 [2019-10-15 03:05:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,685 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 755 transitions. [2019-10-15 03:05:36,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 755 transitions. [2019-10-15 03:05:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 03:05:36,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,688 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,688 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1960985204, now seen corresponding path program 1 times [2019-10-15 03:05:36,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798287939] [2019-10-15 03:05:36,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:05:36,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798287939] [2019-10-15 03:05:36,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:36,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011821564] [2019-10-15 03:05:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:36,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:36,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:36,730 INFO L87 Difference]: Start difference. First operand 597 states and 755 transitions. Second operand 3 states. [2019-10-15 03:05:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,771 INFO L93 Difference]: Finished difference Result 727 states and 910 transitions. [2019-10-15 03:05:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:36,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-15 03:05:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,775 INFO L225 Difference]: With dead ends: 727 [2019-10-15 03:05:36,775 INFO L226 Difference]: Without dead ends: 575 [2019-10-15 03:05:36,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-15 03:05:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2019-10-15 03:05:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-15 03:05:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 718 transitions. [2019-10-15 03:05:36,821 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 718 transitions. Word has length 68 [2019-10-15 03:05:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,821 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 718 transitions. [2019-10-15 03:05:36,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 718 transitions. [2019-10-15 03:05:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:36,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,825 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 225549446, now seen corresponding path program 1 times [2019-10-15 03:05:36,825 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109956831] [2019-10-15 03:05:36,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:37,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109956831] [2019-10-15 03:05:37,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:37,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385530838] [2019-10-15 03:05:37,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:37,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:37,055 INFO L87 Difference]: Start difference. First operand 573 states and 718 transitions. Second operand 14 states. [2019-10-15 03:05:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,660 INFO L93 Difference]: Finished difference Result 615 states and 768 transitions. [2019-10-15 03:05:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:05:37,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-15 03:05:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,663 INFO L225 Difference]: With dead ends: 615 [2019-10-15 03:05:37,663 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 03:05:37,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:05:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 03:05:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 577. [2019-10-15 03:05:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 03:05:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 724 transitions. [2019-10-15 03:05:37,714 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 724 transitions. Word has length 55 [2019-10-15 03:05:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,714 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 724 transitions. [2019-10-15 03:05:37,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 724 transitions. [2019-10-15 03:05:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:05:37,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,716 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:37,717 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1949389623, now seen corresponding path program 1 times [2019-10-15 03:05:37,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622907025] [2019-10-15 03:05:37,717 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:38,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622907025] [2019-10-15 03:05:38,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:38,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688151320] [2019-10-15 03:05:38,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:38,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:38,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:38,285 INFO L87 Difference]: Start difference. First operand 577 states and 724 transitions. Second operand 13 states. [2019-10-15 03:05:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,653 INFO L93 Difference]: Finished difference Result 593 states and 741 transitions. [2019-10-15 03:05:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:38,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-15 03:05:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,657 INFO L225 Difference]: With dead ends: 593 [2019-10-15 03:05:38,657 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 03:05:38,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 03:05:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 03:05:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 03:05:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 709 transitions. [2019-10-15 03:05:38,704 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 709 transitions. Word has length 62 [2019-10-15 03:05:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,705 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 709 transitions. [2019-10-15 03:05:38,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 709 transitions. [2019-10-15 03:05:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:38,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:38,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:38,708 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2018558973, now seen corresponding path program 1 times [2019-10-15 03:05:38,708 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:38,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450693079] [2019-10-15 03:05:38,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:38,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450693079] [2019-10-15 03:05:38,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:38,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:38,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608364144] [2019-10-15 03:05:38,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:38,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:38,918 INFO L87 Difference]: Start difference. First operand 566 states and 709 transitions. Second operand 13 states. [2019-10-15 03:05:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,258 INFO L93 Difference]: Finished difference Result 582 states and 726 transitions. [2019-10-15 03:05:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:39,258 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-15 03:05:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,261 INFO L225 Difference]: With dead ends: 582 [2019-10-15 03:05:39,261 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 03:05:39,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 03:05:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 03:05:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 03:05:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 702 transitions. [2019-10-15 03:05:39,304 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 702 transitions. Word has length 55 [2019-10-15 03:05:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,304 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 702 transitions. [2019-10-15 03:05:39,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 702 transitions. [2019-10-15 03:05:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 03:05:39,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,307 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:39,307 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1240275999, now seen corresponding path program 1 times [2019-10-15 03:05:39,308 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576762819] [2019-10-15 03:05:39,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:39,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576762819] [2019-10-15 03:05:39,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:39,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086532486] [2019-10-15 03:05:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:39,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:39,351 INFO L87 Difference]: Start difference. First operand 561 states and 702 transitions. Second operand 3 states. [2019-10-15 03:05:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,398 INFO L93 Difference]: Finished difference Result 656 states and 809 transitions. [2019-10-15 03:05:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:39,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-15 03:05:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,403 INFO L225 Difference]: With dead ends: 656 [2019-10-15 03:05:39,403 INFO L226 Difference]: Without dead ends: 583 [2019-10-15 03:05:39,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-15 03:05:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 562. [2019-10-15 03:05:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 03:05:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 700 transitions. [2019-10-15 03:05:39,447 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 700 transitions. Word has length 69 [2019-10-15 03:05:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,447 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 700 transitions. [2019-10-15 03:05:39,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 700 transitions. [2019-10-15 03:05:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:05:39,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,451 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:39,451 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash 510330724, now seen corresponding path program 1 times [2019-10-15 03:05:39,452 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382644983] [2019-10-15 03:05:39,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:39,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382644983] [2019-10-15 03:05:39,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:39,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034829375] [2019-10-15 03:05:39,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:39,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:39,711 INFO L87 Difference]: Start difference. First operand 562 states and 700 transitions. Second operand 11 states.