/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:05:50,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:05:50,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:05:50,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:05:50,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:05:50,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:05:50,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:05:50,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:05:50,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:05:50,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:05:50,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:05:50,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:05:50,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:05:50,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:05:50,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:05:50,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:05:50,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:05:50,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:05:50,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:05:50,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:05:50,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:05:50,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:05:50,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:05:50,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:05:50,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:05:50,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:05:50,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:05:50,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:05:50,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:05:50,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:05:50,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:05:50,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:05:50,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:05:50,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:05:50,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:05:50,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:05:50,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:05:50,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:05:50,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:05:50,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:05:50,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:05:50,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:05:50,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:05:50,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:05:50,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:05:50,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:05:50,841 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:05:50,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:05:50,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:05:50,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:05:50,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:05:50,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:05:50,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:05:50,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:05:50,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:05:50,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:05:50,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:05:50,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:05:50,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:05:50,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:05:50,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:05:50,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:05:50,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:05:50,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:05:50,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:05:50,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:05:50,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:05:50,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:05:50,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:05:50,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:05:50,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:05:51,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:05:51,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:05:51,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:05:51,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:05:51,147 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:05:51,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-07 04:05:51,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb91c1844/6e46780b42bb4cd9a93cf7df3d615ae5/FLAGbf7c912e5 [2019-11-07 04:05:51,795 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:05:51,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-07 04:05:51,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb91c1844/6e46780b42bb4cd9a93cf7df3d615ae5/FLAGbf7c912e5 [2019-11-07 04:05:52,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb91c1844/6e46780b42bb4cd9a93cf7df3d615ae5 [2019-11-07 04:05:52,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:05:52,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:05:52,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:52,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:05:52,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:05:52,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f1ad2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52, skipping insertion in model container [2019-11-07 04:05:52,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:05:52,189 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:05:52,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:52,652 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:05:52,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:05:52,815 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:05:52,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52 WrapperNode [2019-11-07 04:05:52,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:05:52,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:05:52,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:05:52,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:05:52,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... [2019-11-07 04:05:52,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:05:52,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:05:52,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:05:52,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:05:52,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:05:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:05:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:05:53,004 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-07 04:05:53,004 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-11-07 04:05:53,004 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-11-07 04:05:53,005 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-11-07 04:05:53,005 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-11-07 04:05:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-11-07 04:05:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-11-07 04:05:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-11-07 04:05:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-07 04:05:53,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:05:53,007 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-11-07 04:05:53,007 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-11-07 04:05:53,008 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-11-07 04:05:53,008 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-11-07 04:05:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-11-07 04:05:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-07 04:05:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-07 04:05:53,011 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-07 04:05:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-07 04:05:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-07 04:05:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-11-07 04:05:53,012 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-11-07 04:05:53,013 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-07 04:05:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:05:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-11-07 04:05:53,015 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-11-07 04:05:53,016 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-11-07 04:05:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-07 04:05:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-07 04:05:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-07 04:05:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-11-07 04:05:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-07 04:05:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:05:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-07 04:05:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:05:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:05:53,405 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,468 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,468 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,500 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,510 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:53,510 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:53,517 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,794 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-07 04:05:53,794 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-07 04:05:53,800 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-07 04:05:53,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-07 04:05:53,942 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:53,973 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-07 04:05:53,973 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-07 04:05:54,130 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,138 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,139 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,139 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,147 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,147 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,148 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,156 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,157 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,202 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,243 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-07 04:05:54,243 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-07 04:05:54,246 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,384 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-11-07 04:05:54,384 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-11-07 04:05:54,434 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,443 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,443 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,444 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,464 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,465 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,465 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-07 04:05:54,476 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-07 04:05:54,476 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-07 04:05:54,966 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:05:54,967 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 04:05:54,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:54 BoogieIcfgContainer [2019-11-07 04:05:54,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:05:54,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:05:54,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:05:54,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:05:54,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:05:52" (1/3) ... [2019-11-07 04:05:54,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35289261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:54, skipping insertion in model container [2019-11-07 04:05:54,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:52" (2/3) ... [2019-11-07 04:05:54,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35289261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:54, skipping insertion in model container [2019-11-07 04:05:54,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:54" (3/3) ... [2019-11-07 04:05:54,979 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-11-07 04:05:54,990 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:05:55,001 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:05:55,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:05:55,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:05:55,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:05:55,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:05:55,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:05:55,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:05:55,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:05:55,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:05:55,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:05:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-11-07 04:05:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:05:55,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:55,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1462923013, now seen corresponding path program 1 times [2019-11-07 04:05:55,110 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,111 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681675564] [2019-11-07 04:05:55,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:55,478 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681675564] [2019-11-07 04:05:55,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:55,479 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:55,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120134721] [2019-11-07 04:05:55,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:55,495 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,512 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-11-07 04:05:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:55,808 INFO L93 Difference]: Finished difference Result 591 states and 867 transitions. [2019-11-07 04:05:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:55,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 04:05:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:55,828 INFO L225 Difference]: With dead ends: 591 [2019-11-07 04:05:55,828 INFO L226 Difference]: Without dead ends: 383 [2019-11-07 04:05:55,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-07 04:05:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2019-11-07 04:05:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-07 04:05:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 486 transitions. [2019-11-07 04:05:55,929 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 486 transitions. Word has length 21 [2019-11-07 04:05:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:55,930 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 486 transitions. [2019-11-07 04:05:55,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 486 transitions. [2019-11-07 04:05:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:05:55,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:55,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:55,933 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 738687115, now seen corresponding path program 1 times [2019-11-07 04:05:55,934 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:55,934 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256622835] [2019-11-07 04:05:55,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,000 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256622835] [2019-11-07 04:05:56,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,001 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92386236] [2019-11-07 04:05:56,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,005 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,006 INFO L87 Difference]: Start difference. First operand 366 states and 486 transitions. Second operand 3 states. [2019-11-07 04:05:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,049 INFO L93 Difference]: Finished difference Result 384 states and 509 transitions. [2019-11-07 04:05:56,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 04:05:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,054 INFO L225 Difference]: With dead ends: 384 [2019-11-07 04:05:56,054 INFO L226 Difference]: Without dead ends: 366 [2019-11-07 04:05:56,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-07 04:05:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-11-07 04:05:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-07 04:05:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2019-11-07 04:05:56,089 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 18 [2019-11-07 04:05:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,090 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2019-11-07 04:05:56,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2019-11-07 04:05:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 04:05:56,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,094 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1792373602, now seen corresponding path program 1 times [2019-11-07 04:05:56,095 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,095 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429103540] [2019-11-07 04:05:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,242 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429103540] [2019-11-07 04:05:56,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844835819] [2019-11-07 04:05:56,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,244 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand 3 states. [2019-11-07 04:05:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,296 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2019-11-07 04:05:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 04:05:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,300 INFO L225 Difference]: With dead ends: 462 [2019-11-07 04:05:56,301 INFO L226 Difference]: Without dead ends: 443 [2019-11-07 04:05:56,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-07 04:05:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2019-11-07 04:05:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-07 04:05:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2019-11-07 04:05:56,329 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 26 [2019-11-07 04:05:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,329 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2019-11-07 04:05:56,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2019-11-07 04:05:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 04:05:56,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1021087200, now seen corresponding path program 1 times [2019-11-07 04:05:56,332 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,333 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990296020] [2019-11-07 04:05:56,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,404 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990296020] [2019-11-07 04:05:56,404 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,404 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497877359] [2019-11-07 04:05:56,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,405 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,406 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2019-11-07 04:05:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,464 INFO L93 Difference]: Finished difference Result 753 states and 984 transitions. [2019-11-07 04:05:56,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-07 04:05:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,475 INFO L225 Difference]: With dead ends: 753 [2019-11-07 04:05:56,475 INFO L226 Difference]: Without dead ends: 560 [2019-11-07 04:05:56,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-07 04:05:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 534. [2019-11-07 04:05:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-07 04:05:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 705 transitions. [2019-11-07 04:05:56,532 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 705 transitions. Word has length 27 [2019-11-07 04:05:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,533 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 705 transitions. [2019-11-07 04:05:56,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 705 transitions. [2019-11-07 04:05:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 04:05:56,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,542 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 576858905, now seen corresponding path program 1 times [2019-11-07 04:05:56,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823394075] [2019-11-07 04:05:56,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,695 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823394075] [2019-11-07 04:05:56,695 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,695 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823202841] [2019-11-07 04:05:56,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,696 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,696 INFO L87 Difference]: Start difference. First operand 534 states and 705 transitions. Second operand 3 states. [2019-11-07 04:05:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,787 INFO L93 Difference]: Finished difference Result 543 states and 716 transitions. [2019-11-07 04:05:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 04:05:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,792 INFO L225 Difference]: With dead ends: 543 [2019-11-07 04:05:56,792 INFO L226 Difference]: Without dead ends: 540 [2019-11-07 04:05:56,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-07 04:05:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-07 04:05:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-07 04:05:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 712 transitions. [2019-11-07 04:05:56,822 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 712 transitions. Word has length 32 [2019-11-07 04:05:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,822 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 712 transitions. [2019-11-07 04:05:56,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 712 transitions. [2019-11-07 04:05:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 04:05:56,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,825 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash 693216730, now seen corresponding path program 1 times [2019-11-07 04:05:56,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,826 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18239497] [2019-11-07 04:05:56,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:56,861 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18239497] [2019-11-07 04:05:56,861 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:56,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:56,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569908138] [2019-11-07 04:05:56,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:56,862 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,863 INFO L87 Difference]: Start difference. First operand 540 states and 712 transitions. Second operand 3 states. [2019-11-07 04:05:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:56,952 INFO L93 Difference]: Finished difference Result 572 states and 748 transitions. [2019-11-07 04:05:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:56,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-07 04:05:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:56,956 INFO L225 Difference]: With dead ends: 572 [2019-11-07 04:05:56,957 INFO L226 Difference]: Without dead ends: 567 [2019-11-07 04:05:56,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-11-07 04:05:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2019-11-07 04:05:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-07 04:05:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 741 transitions. [2019-11-07 04:05:56,988 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 741 transitions. Word has length 33 [2019-11-07 04:05:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:56,988 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 741 transitions. [2019-11-07 04:05:56,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 741 transitions. [2019-11-07 04:05:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 04:05:56,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:56,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:56,991 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 466530989, now seen corresponding path program 1 times [2019-11-07 04:05:56,992 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:56,992 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573261804] [2019-11-07 04:05:56,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:57,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573261804] [2019-11-07 04:05:57,038 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:57,039 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:57,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493580633] [2019-11-07 04:05:57,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:57,039 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:57,040 INFO L87 Difference]: Start difference. First operand 565 states and 741 transitions. Second operand 5 states. [2019-11-07 04:05:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:57,110 INFO L93 Difference]: Finished difference Result 578 states and 755 transitions. [2019-11-07 04:05:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:57,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-07 04:05:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:57,117 INFO L225 Difference]: With dead ends: 578 [2019-11-07 04:05:57,117 INFO L226 Difference]: Without dead ends: 563 [2019-11-07 04:05:57,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:05:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-07 04:05:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-11-07 04:05:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-07 04:05:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 737 transitions. [2019-11-07 04:05:57,149 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 737 transitions. Word has length 34 [2019-11-07 04:05:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:57,150 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 737 transitions. [2019-11-07 04:05:57,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 737 transitions. [2019-11-07 04:05:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 04:05:57,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:57,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:57,155 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2017596672, now seen corresponding path program 1 times [2019-11-07 04:05:57,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:57,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160239530] [2019-11-07 04:05:57,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:57,229 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160239530] [2019-11-07 04:05:57,229 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:57,229 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:05:57,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515350080] [2019-11-07 04:05:57,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:05:57,231 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:57,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:05:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:57,232 INFO L87 Difference]: Start difference. First operand 563 states and 737 transitions. Second operand 5 states. [2019-11-07 04:05:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:57,288 INFO L93 Difference]: Finished difference Result 576 states and 751 transitions. [2019-11-07 04:05:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:05:57,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-07 04:05:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:57,293 INFO L225 Difference]: With dead ends: 576 [2019-11-07 04:05:57,293 INFO L226 Difference]: Without dead ends: 557 [2019-11-07 04:05:57,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:05:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-07 04:05:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-11-07 04:05:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-11-07 04:05:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 729 transitions. [2019-11-07 04:05:57,329 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 729 transitions. Word has length 35 [2019-11-07 04:05:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:57,329 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 729 transitions. [2019-11-07 04:05:57,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:05:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 729 transitions. [2019-11-07 04:05:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 04:05:57,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:57,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:57,333 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1856256589, now seen corresponding path program 1 times [2019-11-07 04:05:57,334 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:57,334 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559369135] [2019-11-07 04:05:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:57,432 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559369135] [2019-11-07 04:05:57,432 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:57,432 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:05:57,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561907038] [2019-11-07 04:05:57,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:05:57,433 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:05:57,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:57,435 INFO L87 Difference]: Start difference. First operand 557 states and 729 transitions. Second operand 3 states. [2019-11-07 04:05:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:57,545 INFO L93 Difference]: Finished difference Result 713 states and 945 transitions. [2019-11-07 04:05:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:05:57,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-07 04:05:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:57,551 INFO L225 Difference]: With dead ends: 713 [2019-11-07 04:05:57,551 INFO L226 Difference]: Without dead ends: 710 [2019-11-07 04:05:57,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:05:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-07 04:05:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 603. [2019-11-07 04:05:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-11-07 04:05:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 793 transitions. [2019-11-07 04:05:57,606 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 793 transitions. Word has length 38 [2019-11-07 04:05:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:57,608 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 793 transitions. [2019-11-07 04:05:57,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:05:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 793 transitions. [2019-11-07 04:05:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 04:05:57,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:57,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:57,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1471321743, now seen corresponding path program 1 times [2019-11-07 04:05:57,622 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:57,622 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144939130] [2019-11-07 04:05:57,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:57,766 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144939130] [2019-11-07 04:05:57,766 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:57,766 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:57,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319406626] [2019-11-07 04:05:57,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:57,768 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:57,768 INFO L87 Difference]: Start difference. First operand 603 states and 793 transitions. Second operand 8 states. [2019-11-07 04:05:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:58,644 INFO L93 Difference]: Finished difference Result 792 states and 1035 transitions. [2019-11-07 04:05:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:05:58,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-07 04:05:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:58,649 INFO L225 Difference]: With dead ends: 792 [2019-11-07 04:05:58,649 INFO L226 Difference]: Without dead ends: 723 [2019-11-07 04:05:58,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:05:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-07 04:05:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 597. [2019-11-07 04:05:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-07 04:05:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 779 transitions. [2019-11-07 04:05:58,682 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 779 transitions. Word has length 39 [2019-11-07 04:05:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:58,682 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 779 transitions. [2019-11-07 04:05:58,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 779 transitions. [2019-11-07 04:05:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 04:05:58,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:58,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:58,684 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -58105418, now seen corresponding path program 1 times [2019-11-07 04:05:58,685 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:58,685 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421253207] [2019-11-07 04:05:58,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:58,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421253207] [2019-11-07 04:05:58,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:58,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:05:58,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762548514] [2019-11-07 04:05:58,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:05:58,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:05:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:05:58,745 INFO L87 Difference]: Start difference. First operand 597 states and 779 transitions. Second operand 4 states. [2019-11-07 04:05:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:58,806 INFO L93 Difference]: Finished difference Result 625 states and 812 transitions. [2019-11-07 04:05:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:05:58,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-07 04:05:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:58,810 INFO L225 Difference]: With dead ends: 625 [2019-11-07 04:05:58,810 INFO L226 Difference]: Without dead ends: 603 [2019-11-07 04:05:58,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:05:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-07 04:05:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2019-11-07 04:05:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-11-07 04:05:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 781 transitions. [2019-11-07 04:05:58,840 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 781 transitions. Word has length 37 [2019-11-07 04:05:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:58,840 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 781 transitions. [2019-11-07 04:05:58,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:05:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 781 transitions. [2019-11-07 04:05:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 04:05:58,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:58,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:58,842 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 898299433, now seen corresponding path program 1 times [2019-11-07 04:05:58,843 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:58,843 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086582394] [2019-11-07 04:05:58,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:58,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086582394] [2019-11-07 04:05:58,919 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:58,919 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:58,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756772449] [2019-11-07 04:05:58,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:58,920 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:58,921 INFO L87 Difference]: Start difference. First operand 599 states and 781 transitions. Second operand 8 states. [2019-11-07 04:05:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:05:59,680 INFO L93 Difference]: Finished difference Result 621 states and 803 transitions. [2019-11-07 04:05:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:05:59,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-11-07 04:05:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:05:59,684 INFO L225 Difference]: With dead ends: 621 [2019-11-07 04:05:59,684 INFO L226 Difference]: Without dead ends: 615 [2019-11-07 04:05:59,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:05:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-07 04:05:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-11-07 04:05:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-11-07 04:05:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 780 transitions. [2019-11-07 04:05:59,716 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 780 transitions. Word has length 39 [2019-11-07 04:05:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:05:59,716 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 780 transitions. [2019-11-07 04:05:59,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:05:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 780 transitions. [2019-11-07 04:05:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:05:59,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:05:59,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:05:59,719 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:05:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:05:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1216858283, now seen corresponding path program 1 times [2019-11-07 04:05:59,719 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:05:59,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839115018] [2019-11-07 04:05:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:05:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:05:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:05:59,800 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839115018] [2019-11-07 04:05:59,800 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:05:59,800 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:05:59,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723639409] [2019-11-07 04:05:59,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:05:59,801 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:05:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:05:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:05:59,802 INFO L87 Difference]: Start difference. First operand 599 states and 780 transitions. Second operand 8 states. [2019-11-07 04:06:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:00,501 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2019-11-07 04:06:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:00,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-07 04:06:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:00,505 INFO L225 Difference]: With dead ends: 621 [2019-11-07 04:06:00,506 INFO L226 Difference]: Without dead ends: 615 [2019-11-07 04:06:00,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:06:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-07 04:06:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-11-07 04:06:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-11-07 04:06:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 779 transitions. [2019-11-07 04:06:00,540 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 779 transitions. Word has length 40 [2019-11-07 04:06:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:00,540 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 779 transitions. [2019-11-07 04:06:00,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 779 transitions. [2019-11-07 04:06:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:06:00,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:00,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:00,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1560994504, now seen corresponding path program 1 times [2019-11-07 04:06:00,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:00,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587011046] [2019-11-07 04:06:00,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:00,580 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587011046] [2019-11-07 04:06:00,581 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:00,581 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:06:00,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082649343] [2019-11-07 04:06:00,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:06:00,582 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:06:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:00,582 INFO L87 Difference]: Start difference. First operand 599 states and 779 transitions. Second operand 3 states. [2019-11-07 04:06:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:00,625 INFO L93 Difference]: Finished difference Result 639 states and 826 transitions. [2019-11-07 04:06:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:06:00,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-07 04:06:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:00,629 INFO L225 Difference]: With dead ends: 639 [2019-11-07 04:06:00,630 INFO L226 Difference]: Without dead ends: 576 [2019-11-07 04:06:00,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-11-07 04:06:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2019-11-07 04:06:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-11-07 04:06:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 744 transitions. [2019-11-07 04:06:00,664 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 744 transitions. Word has length 40 [2019-11-07 04:06:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:00,665 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 744 transitions. [2019-11-07 04:06:00,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:06:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2019-11-07 04:06:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:06:00,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:00,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:00,667 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -848551918, now seen corresponding path program 1 times [2019-11-07 04:06:00,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:00,667 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25501225] [2019-11-07 04:06:00,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:00,722 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25501225] [2019-11-07 04:06:00,722 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:00,722 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:00,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102733179] [2019-11-07 04:06:00,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:00,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:00,726 INFO L87 Difference]: Start difference. First operand 573 states and 744 transitions. Second operand 5 states. [2019-11-07 04:06:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:00,822 INFO L93 Difference]: Finished difference Result 589 states and 759 transitions. [2019-11-07 04:06:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:00,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 04:06:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:00,826 INFO L225 Difference]: With dead ends: 589 [2019-11-07 04:06:00,826 INFO L226 Difference]: Without dead ends: 571 [2019-11-07 04:06:00,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-07 04:06:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-07 04:06:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 04:06:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 740 transitions. [2019-11-07 04:06:00,873 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 740 transitions. Word has length 41 [2019-11-07 04:06:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:00,873 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 740 transitions. [2019-11-07 04:06:00,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 740 transitions. [2019-11-07 04:06:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:06:00,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:00,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:00,876 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1321910963, now seen corresponding path program 1 times [2019-11-07 04:06:00,876 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:00,876 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851286058] [2019-11-07 04:06:00,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:00,966 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851286058] [2019-11-07 04:06:00,966 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:00,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:06:00,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445811881] [2019-11-07 04:06:00,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:06:00,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:06:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:06:00,970 INFO L87 Difference]: Start difference. First operand 571 states and 740 transitions. Second operand 4 states. [2019-11-07 04:06:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,241 INFO L93 Difference]: Finished difference Result 621 states and 784 transitions. [2019-11-07 04:06:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:06:01,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-07 04:06:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,245 INFO L225 Difference]: With dead ends: 621 [2019-11-07 04:06:01,245 INFO L226 Difference]: Without dead ends: 432 [2019-11-07 04:06:01,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:06:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-07 04:06:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2019-11-07 04:06:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-07 04:06:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 516 transitions. [2019-11-07 04:06:01,281 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 516 transitions. Word has length 43 [2019-11-07 04:06:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,282 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 516 transitions. [2019-11-07 04:06:01,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:06:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 516 transitions. [2019-11-07 04:06:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:06:01,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:01,284 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -360854459, now seen corresponding path program 1 times [2019-11-07 04:06:01,285 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,285 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369310861] [2019-11-07 04:06:01,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369310861] [2019-11-07 04:06:01,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:01,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440337466] [2019-11-07 04:06:01,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:01,372 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:01,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:01,372 INFO L87 Difference]: Start difference. First operand 413 states and 516 transitions. Second operand 5 states. [2019-11-07 04:06:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,416 INFO L93 Difference]: Finished difference Result 429 states and 531 transitions. [2019-11-07 04:06:01,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:01,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 04:06:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,421 INFO L225 Difference]: With dead ends: 429 [2019-11-07 04:06:01,421 INFO L226 Difference]: Without dead ends: 411 [2019-11-07 04:06:01,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-07 04:06:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-11-07 04:06:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-07 04:06:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 512 transitions. [2019-11-07 04:06:01,446 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 512 transitions. Word has length 41 [2019-11-07 04:06:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,446 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 512 transitions. [2019-11-07 04:06:01,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 512 transitions. [2019-11-07 04:06:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 04:06:01,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:01,448 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1939669222, now seen corresponding path program 1 times [2019-11-07 04:06:01,449 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,449 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591291449] [2019-11-07 04:06:01,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591291449] [2019-11-07 04:06:01,495 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,495 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:06:01,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838941962] [2019-11-07 04:06:01,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:06:01,496 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:06:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:01,497 INFO L87 Difference]: Start difference. First operand 411 states and 512 transitions. Second operand 3 states. [2019-11-07 04:06:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,608 INFO L93 Difference]: Finished difference Result 566 states and 717 transitions. [2019-11-07 04:06:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:06:01,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 04:06:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,612 INFO L225 Difference]: With dead ends: 566 [2019-11-07 04:06:01,612 INFO L226 Difference]: Without dead ends: 542 [2019-11-07 04:06:01,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-07 04:06:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2019-11-07 04:06:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-07 04:06:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 555 transitions. [2019-11-07 04:06:01,645 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 555 transitions. Word has length 43 [2019-11-07 04:06:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,645 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 555 transitions. [2019-11-07 04:06:01,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:06:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 555 transitions. [2019-11-07 04:06:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:06:01,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:01,647 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1952247639, now seen corresponding path program 1 times [2019-11-07 04:06:01,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919631991] [2019-11-07 04:06:01,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919631991] [2019-11-07 04:06:01,693 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,693 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:06:01,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97349044] [2019-11-07 04:06:01,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:06:01,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:06:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:01,694 INFO L87 Difference]: Start difference. First operand 445 states and 555 transitions. Second operand 3 states. [2019-11-07 04:06:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:01,760 INFO L93 Difference]: Finished difference Result 626 states and 787 transitions. [2019-11-07 04:06:01,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:06:01,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-07 04:06:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:01,763 INFO L225 Difference]: With dead ends: 626 [2019-11-07 04:06:01,763 INFO L226 Difference]: Without dead ends: 448 [2019-11-07 04:06:01,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-11-07 04:06:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-11-07 04:06:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-07 04:06:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 559 transitions. [2019-11-07 04:06:01,822 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 559 transitions. Word has length 51 [2019-11-07 04:06:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:01,822 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 559 transitions. [2019-11-07 04:06:01,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:06:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 559 transitions. [2019-11-07 04:06:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:06:01,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:01,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:01,824 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 452129407, now seen corresponding path program 1 times [2019-11-07 04:06:01,825 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:01,825 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698470009] [2019-11-07 04:06:01,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:01,897 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698470009] [2019-11-07 04:06:01,897 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:01,897 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:01,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261994514] [2019-11-07 04:06:01,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:01,902 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:01,902 INFO L87 Difference]: Start difference. First operand 448 states and 559 transitions. Second operand 8 states. [2019-11-07 04:06:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:02,088 INFO L93 Difference]: Finished difference Result 478 states and 593 transitions. [2019-11-07 04:06:02,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:02,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-07 04:06:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:02,092 INFO L225 Difference]: With dead ends: 478 [2019-11-07 04:06:02,092 INFO L226 Difference]: Without dead ends: 474 [2019-11-07 04:06:02,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-07 04:06:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2019-11-07 04:06:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-07 04:06:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 580 transitions. [2019-11-07 04:06:02,118 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 580 transitions. Word has length 44 [2019-11-07 04:06:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:02,118 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 580 transitions. [2019-11-07 04:06:02,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 580 transitions. [2019-11-07 04:06:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:06:02,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:02,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:02,120 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 451852577, now seen corresponding path program 1 times [2019-11-07 04:06:02,121 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:02,121 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803506521] [2019-11-07 04:06:02,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:02,239 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803506521] [2019-11-07 04:06:02,240 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:02,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:06:02,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983542575] [2019-11-07 04:06:02,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:06:02,242 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:06:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:02,250 INFO L87 Difference]: Start difference. First operand 466 states and 580 transitions. Second operand 10 states. [2019-11-07 04:06:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:03,881 INFO L93 Difference]: Finished difference Result 568 states and 718 transitions. [2019-11-07 04:06:03,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:06:03,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-07 04:06:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:03,889 INFO L225 Difference]: With dead ends: 568 [2019-11-07 04:06:03,890 INFO L226 Difference]: Without dead ends: 552 [2019-11-07 04:06:03,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:06:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-11-07 04:06:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 479. [2019-11-07 04:06:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-07 04:06:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 594 transitions. [2019-11-07 04:06:03,929 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 594 transitions. Word has length 44 [2019-11-07 04:06:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:03,929 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 594 transitions. [2019-11-07 04:06:03,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 594 transitions. [2019-11-07 04:06:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 04:06:03,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:03,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:03,932 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1045295946, now seen corresponding path program 1 times [2019-11-07 04:06:03,932 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:03,932 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895609363] [2019-11-07 04:06:03,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:04,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-11-07 04:06:04,051 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895609363] [2019-11-07 04:06:04,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:04,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:04,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122273624] [2019-11-07 04:06:04,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:04,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:04,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:04,053 INFO L87 Difference]: Start difference. First operand 479 states and 594 transitions. Second operand 7 states. [2019-11-07 04:06:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:04,750 INFO L93 Difference]: Finished difference Result 569 states and 702 transitions. [2019-11-07 04:06:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 04:06:04,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-11-07 04:06:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:04,756 INFO L225 Difference]: With dead ends: 569 [2019-11-07 04:06:04,757 INFO L226 Difference]: Without dead ends: 498 [2019-11-07 04:06:04,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:06:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-07 04:06:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2019-11-07 04:06:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-11-07 04:06:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 606 transitions. [2019-11-07 04:06:04,790 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 606 transitions. Word has length 44 [2019-11-07 04:06:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:04,790 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 606 transitions. [2019-11-07 04:06:04,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 606 transitions. [2019-11-07 04:06:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:06:04,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:04,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:04,792 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1960933712, now seen corresponding path program 1 times [2019-11-07 04:06:04,793 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:04,793 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844153390] [2019-11-07 04:06:04,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:04,902 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844153390] [2019-11-07 04:06:04,902 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:04,902 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:04,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155615392] [2019-11-07 04:06:04,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:04,903 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:04,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:04,904 INFO L87 Difference]: Start difference. First operand 490 states and 606 transitions. Second operand 7 states. [2019-11-07 04:06:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:05,135 INFO L93 Difference]: Finished difference Result 508 states and 623 transitions. [2019-11-07 04:06:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:05,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-07 04:06:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:05,139 INFO L225 Difference]: With dead ends: 508 [2019-11-07 04:06:05,139 INFO L226 Difference]: Without dead ends: 487 [2019-11-07 04:06:05,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-07 04:06:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-11-07 04:06:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-07 04:06:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 589 transitions. [2019-11-07 04:06:05,178 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 589 transitions. Word has length 45 [2019-11-07 04:06:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:05,178 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 589 transitions. [2019-11-07 04:06:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 589 transitions. [2019-11-07 04:06:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:06:05,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:05,183 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:05,183 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -519110175, now seen corresponding path program 1 times [2019-11-07 04:06:05,184 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:05,184 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987120567] [2019-11-07 04:06:05,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:05,226 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987120567] [2019-11-07 04:06:05,226 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:05,226 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:06:05,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741266463] [2019-11-07 04:06:05,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:06:05,227 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:06:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:05,228 INFO L87 Difference]: Start difference. First operand 485 states and 589 transitions. Second operand 3 states. [2019-11-07 04:06:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:05,324 INFO L93 Difference]: Finished difference Result 569 states and 692 transitions. [2019-11-07 04:06:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:06:05,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 04:06:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:05,328 INFO L225 Difference]: With dead ends: 569 [2019-11-07 04:06:05,328 INFO L226 Difference]: Without dead ends: 516 [2019-11-07 04:06:05,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:06:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-07 04:06:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2019-11-07 04:06:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-11-07 04:06:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 573 transitions. [2019-11-07 04:06:05,370 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 573 transitions. Word has length 45 [2019-11-07 04:06:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:05,371 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 573 transitions. [2019-11-07 04:06:05,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:06:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 573 transitions. [2019-11-07 04:06:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:06:05,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:05,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:05,373 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash -706098147, now seen corresponding path program 1 times [2019-11-07 04:06:05,373 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:05,374 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873738186] [2019-11-07 04:06:05,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:05,511 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873738186] [2019-11-07 04:06:05,511 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:05,511 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:05,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938286043] [2019-11-07 04:06:05,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:05,512 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:05,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:05,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:05,513 INFO L87 Difference]: Start difference. First operand 467 states and 573 transitions. Second operand 5 states. [2019-11-07 04:06:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:05,559 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2019-11-07 04:06:05,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:05,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-07 04:06:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:05,563 INFO L225 Difference]: With dead ends: 645 [2019-11-07 04:06:05,563 INFO L226 Difference]: Without dead ends: 435 [2019-11-07 04:06:05,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-11-07 04:06:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-11-07 04:06:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-07 04:06:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 526 transitions. [2019-11-07 04:06:05,605 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 526 transitions. Word has length 53 [2019-11-07 04:06:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:05,605 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 526 transitions. [2019-11-07 04:06:05,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 526 transitions. [2019-11-07 04:06:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 04:06:05,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:05,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:05,607 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1539102598, now seen corresponding path program 1 times [2019-11-07 04:06:05,608 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:05,608 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450427903] [2019-11-07 04:06:05,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:05,661 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450427903] [2019-11-07 04:06:05,661 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:05,661 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:05,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385082871] [2019-11-07 04:06:05,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:05,662 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:05,662 INFO L87 Difference]: Start difference. First operand 435 states and 526 transitions. Second operand 5 states. [2019-11-07 04:06:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:06,032 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2019-11-07 04:06:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:06,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-07 04:06:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:06,037 INFO L225 Difference]: With dead ends: 449 [2019-11-07 04:06:06,037 INFO L226 Difference]: Without dead ends: 431 [2019-11-07 04:06:06,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-07 04:06:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-11-07 04:06:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-07 04:06:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2019-11-07 04:06:06,078 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 46 [2019-11-07 04:06:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:06,079 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2019-11-07 04:06:06,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2019-11-07 04:06:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:06:06,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:06,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:06,083 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:06,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1827396325, now seen corresponding path program 1 times [2019-11-07 04:06:06,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:06,084 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526250789] [2019-11-07 04:06:06,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526250789] [2019-11-07 04:06:06,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,179 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:06,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516804501] [2019-11-07 04:06:06,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:06,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:06,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:06,180 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand 8 states. [2019-11-07 04:06:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:06,257 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-11-07 04:06:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:06,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-07 04:06:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:06,263 INFO L225 Difference]: With dead ends: 436 [2019-11-07 04:06:06,263 INFO L226 Difference]: Without dead ends: 412 [2019-11-07 04:06:06,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-07 04:06:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-11-07 04:06:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-07 04:06:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 499 transitions. [2019-11-07 04:06:06,303 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 499 transitions. Word has length 47 [2019-11-07 04:06:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:06,304 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 499 transitions. [2019-11-07 04:06:06,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 499 transitions. [2019-11-07 04:06:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:06:06,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:06,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:06,306 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 358397846, now seen corresponding path program 1 times [2019-11-07 04:06:06,307 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:06,307 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122906025] [2019-11-07 04:06:06,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,377 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122906025] [2019-11-07 04:06:06,378 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,378 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:06,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089367395] [2019-11-07 04:06:06,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:06,380 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:06,380 INFO L87 Difference]: Start difference. First operand 412 states and 499 transitions. Second operand 8 states. [2019-11-07 04:06:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:06,551 INFO L93 Difference]: Finished difference Result 435 states and 522 transitions. [2019-11-07 04:06:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:06,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-07 04:06:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:06,555 INFO L225 Difference]: With dead ends: 435 [2019-11-07 04:06:06,555 INFO L226 Difference]: Without dead ends: 407 [2019-11-07 04:06:06,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-07 04:06:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-11-07 04:06:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-07 04:06:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 491 transitions. [2019-11-07 04:06:06,610 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 491 transitions. Word has length 47 [2019-11-07 04:06:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:06,610 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 491 transitions. [2019-11-07 04:06:06,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 491 transitions. [2019-11-07 04:06:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:06:06,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:06,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:06,614 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash -933816145, now seen corresponding path program 1 times [2019-11-07 04:06:06,614 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:06,615 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041393435] [2019-11-07 04:06:06,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,730 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041393435] [2019-11-07 04:06:06,730 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,730 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:06:06,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621049021] [2019-11-07 04:06:06,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:06:06,731 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:06:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:06,732 INFO L87 Difference]: Start difference. First operand 407 states and 491 transitions. Second operand 6 states. [2019-11-07 04:06:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:06,803 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-11-07 04:06:06,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:06,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-07 04:06:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:06,807 INFO L225 Difference]: With dead ends: 436 [2019-11-07 04:06:06,807 INFO L226 Difference]: Without dead ends: 409 [2019-11-07 04:06:06,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-07 04:06:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-11-07 04:06:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-07 04:06:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 493 transitions. [2019-11-07 04:06:06,843 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 493 transitions. Word has length 47 [2019-11-07 04:06:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:06,844 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 493 transitions. [2019-11-07 04:06:06,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:06:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 493 transitions. [2019-11-07 04:06:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:06:06,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:06,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:06,847 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash 971008662, now seen corresponding path program 1 times [2019-11-07 04:06:06,848 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:06,848 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764409415] [2019-11-07 04:06:06,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:06,943 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764409415] [2019-11-07 04:06:06,945 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:06,945 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:06,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203480283] [2019-11-07 04:06:06,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:06,947 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:06,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:06,947 INFO L87 Difference]: Start difference. First operand 409 states and 493 transitions. Second operand 5 states. [2019-11-07 04:06:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:07,251 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-11-07 04:06:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:07,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-07 04:06:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:07,255 INFO L225 Difference]: With dead ends: 587 [2019-11-07 04:06:07,255 INFO L226 Difference]: Without dead ends: 409 [2019-11-07 04:06:07,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-07 04:06:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-11-07 04:06:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-07 04:06:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-11-07 04:06:07,294 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 57 [2019-11-07 04:06:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:07,295 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-11-07 04:06:07,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-11-07 04:06:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:06:07,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:07,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:07,298 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash -550061814, now seen corresponding path program 1 times [2019-11-07 04:06:07,299 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:07,299 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604654116] [2019-11-07 04:06:07,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:07,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604654116] [2019-11-07 04:06:07,461 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:07,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:07,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50414788] [2019-11-07 04:06:07,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:07,464 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:07,470 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 7 states. [2019-11-07 04:06:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:07,825 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2019-11-07 04:06:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:06:07,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-11-07 04:06:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:07,828 INFO L225 Difference]: With dead ends: 428 [2019-11-07 04:06:07,828 INFO L226 Difference]: Without dead ends: 425 [2019-11-07 04:06:07,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-07 04:06:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2019-11-07 04:06:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-07 04:06:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-11-07 04:06:07,859 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 58 [2019-11-07 04:06:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:07,860 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-11-07 04:06:07,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-11-07 04:06:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:06:07,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:07,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:07,862 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash 815295926, now seen corresponding path program 1 times [2019-11-07 04:06:07,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:07,862 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046315388] [2019-11-07 04:06:07,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:07,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046315388] [2019-11-07 04:06:07,933 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:07,933 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:07,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585429239] [2019-11-07 04:06:07,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:07,934 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:07,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:07,934 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 9 states. [2019-11-07 04:06:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,183 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2019-11-07 04:06:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:08,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-07 04:06:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,186 INFO L225 Difference]: With dead ends: 434 [2019-11-07 04:06:08,187 INFO L226 Difference]: Without dead ends: 404 [2019-11-07 04:06:08,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-07 04:06:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-11-07 04:06:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-11-07 04:06:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 484 transitions. [2019-11-07 04:06:08,233 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 484 transitions. Word has length 50 [2019-11-07 04:06:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,234 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 484 transitions. [2019-11-07 04:06:08,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 484 transitions. [2019-11-07 04:06:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:06:08,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:08,237 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash 298589759, now seen corresponding path program 1 times [2019-11-07 04:06:08,237 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,237 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508698885] [2019-11-07 04:06:08,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,332 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508698885] [2019-11-07 04:06:08,332 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,332 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282886264] [2019-11-07 04:06:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:08,333 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:08,333 INFO L87 Difference]: Start difference. First operand 404 states and 484 transitions. Second operand 9 states. [2019-11-07 04:06:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,584 INFO L93 Difference]: Finished difference Result 429 states and 509 transitions. [2019-11-07 04:06:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:08,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-11-07 04:06:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,587 INFO L225 Difference]: With dead ends: 429 [2019-11-07 04:06:08,587 INFO L226 Difference]: Without dead ends: 399 [2019-11-07 04:06:08,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-07 04:06:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-11-07 04:06:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-07 04:06:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 476 transitions. [2019-11-07 04:06:08,618 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 476 transitions. Word has length 50 [2019-11-07 04:06:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,619 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 476 transitions. [2019-11-07 04:06:08,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 476 transitions. [2019-11-07 04:06:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:06:08,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:08,621 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 211621434, now seen corresponding path program 1 times [2019-11-07 04:06:08,621 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,621 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982961593] [2019-11-07 04:06:08,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,672 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982961593] [2019-11-07 04:06:08,672 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,672 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:06:08,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143519703] [2019-11-07 04:06:08,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:06:08,673 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:06:08,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:08,674 INFO L87 Difference]: Start difference. First operand 399 states and 476 transitions. Second operand 6 states. [2019-11-07 04:06:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:08,737 INFO L93 Difference]: Finished difference Result 416 states and 492 transitions. [2019-11-07 04:06:08,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:08,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-07 04:06:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:08,740 INFO L225 Difference]: With dead ends: 416 [2019-11-07 04:06:08,740 INFO L226 Difference]: Without dead ends: 394 [2019-11-07 04:06:08,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-11-07 04:06:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-11-07 04:06:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-11-07 04:06:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 470 transitions. [2019-11-07 04:06:08,768 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 470 transitions. Word has length 52 [2019-11-07 04:06:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:08,768 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 470 transitions. [2019-11-07 04:06:08,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:06:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 470 transitions. [2019-11-07 04:06:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:06:08,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:08,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:08,770 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -407065973, now seen corresponding path program 1 times [2019-11-07 04:06:08,771 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:08,771 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105033263] [2019-11-07 04:06:08,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:08,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105033263] [2019-11-07 04:06:08,848 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:08,848 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:08,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621350987] [2019-11-07 04:06:08,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:08,848 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:08,849 INFO L87 Difference]: Start difference. First operand 394 states and 470 transitions. Second operand 9 states. [2019-11-07 04:06:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:09,036 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2019-11-07 04:06:09,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:09,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-11-07 04:06:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:09,039 INFO L225 Difference]: With dead ends: 419 [2019-11-07 04:06:09,039 INFO L226 Difference]: Without dead ends: 389 [2019-11-07 04:06:09,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-07 04:06:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2019-11-07 04:06:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-07 04:06:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 462 transitions. [2019-11-07 04:06:09,078 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 462 transitions. Word has length 51 [2019-11-07 04:06:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:09,078 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 462 transitions. [2019-11-07 04:06:09,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 462 transitions. [2019-11-07 04:06:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:06:09,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:09,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:09,080 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:09,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2007347647, now seen corresponding path program 1 times [2019-11-07 04:06:09,081 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:09,081 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167135888] [2019-11-07 04:06:09,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:09,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167135888] [2019-11-07 04:06:09,156 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:06:09,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327356729] [2019-11-07 04:06:09,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:06:09,157 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:06:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:09,158 INFO L87 Difference]: Start difference. First operand 389 states and 462 transitions. Second operand 6 states. [2019-11-07 04:06:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:09,217 INFO L93 Difference]: Finished difference Result 401 states and 474 transitions. [2019-11-07 04:06:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:09,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-07 04:06:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:09,221 INFO L225 Difference]: With dead ends: 401 [2019-11-07 04:06:09,221 INFO L226 Difference]: Without dead ends: 362 [2019-11-07 04:06:09,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-07 04:06:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-07 04:06:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-07 04:06:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 422 transitions. [2019-11-07 04:06:09,251 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 422 transitions. Word has length 53 [2019-11-07 04:06:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:09,252 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 422 transitions. [2019-11-07 04:06:09,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:06:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 422 transitions. [2019-11-07 04:06:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:06:09,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:09,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:09,254 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash -759076076, now seen corresponding path program 1 times [2019-11-07 04:06:09,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:09,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038754714] [2019-11-07 04:06:09,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:09,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038754714] [2019-11-07 04:06:09,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:09,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258509589] [2019-11-07 04:06:09,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:09,382 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:09,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:09,383 INFO L87 Difference]: Start difference. First operand 360 states and 422 transitions. Second operand 5 states. [2019-11-07 04:06:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:09,732 INFO L93 Difference]: Finished difference Result 613 states and 733 transitions. [2019-11-07 04:06:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:09,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-07 04:06:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:09,735 INFO L225 Difference]: With dead ends: 613 [2019-11-07 04:06:09,735 INFO L226 Difference]: Without dead ends: 441 [2019-11-07 04:06:09,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-07 04:06:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2019-11-07 04:06:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-07 04:06:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2019-11-07 04:06:09,765 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 57 [2019-11-07 04:06:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:09,766 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2019-11-07 04:06:09,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2019-11-07 04:06:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:06:09,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:09,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:09,769 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:09,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1791603402, now seen corresponding path program 1 times [2019-11-07 04:06:09,770 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:09,770 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536883771] [2019-11-07 04:06:09,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:09,842 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536883771] [2019-11-07 04:06:09,842 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:09,842 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71256569] [2019-11-07 04:06:09,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:09,843 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:09,843 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand 9 states. [2019-11-07 04:06:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:10,090 INFO L93 Difference]: Finished difference Result 435 states and 509 transitions. [2019-11-07 04:06:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:10,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 04:06:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:10,094 INFO L225 Difference]: With dead ends: 435 [2019-11-07 04:06:10,095 INFO L226 Difference]: Without dead ends: 381 [2019-11-07 04:06:10,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-07 04:06:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-11-07 04:06:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-07 04:06:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 448 transitions. [2019-11-07 04:06:10,143 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 448 transitions. Word has length 54 [2019-11-07 04:06:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:10,143 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 448 transitions. [2019-11-07 04:06:10,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 448 transitions. [2019-11-07 04:06:10,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:06:10,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:10,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:10,146 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:10,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1794667652, now seen corresponding path program 1 times [2019-11-07 04:06:10,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:10,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997299593] [2019-11-07 04:06:10,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:10,277 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997299593] [2019-11-07 04:06:10,277 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:10,277 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:10,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850694558] [2019-11-07 04:06:10,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:10,278 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:10,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:10,278 INFO L87 Difference]: Start difference. First operand 381 states and 448 transitions. Second operand 8 states. [2019-11-07 04:06:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:10,401 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2019-11-07 04:06:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:10,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-07 04:06:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:10,404 INFO L225 Difference]: With dead ends: 398 [2019-11-07 04:06:10,404 INFO L226 Difference]: Without dead ends: 354 [2019-11-07 04:06:10,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-07 04:06:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-11-07 04:06:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-07 04:06:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 417 transitions. [2019-11-07 04:06:10,432 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 417 transitions. Word has length 54 [2019-11-07 04:06:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:10,432 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 417 transitions. [2019-11-07 04:06:10,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 417 transitions. [2019-11-07 04:06:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 04:06:10,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:10,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:10,434 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash -309591851, now seen corresponding path program 1 times [2019-11-07 04:06:10,435 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:10,435 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323249436] [2019-11-07 04:06:10,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:10,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-11-07 04:06:10,544 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323249436] [2019-11-07 04:06:10,545 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:10,545 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:06:10,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188758834] [2019-11-07 04:06:10,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:06:10,546 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:06:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:10,546 INFO L87 Difference]: Start difference. First operand 354 states and 417 transitions. Second operand 10 states. [2019-11-07 04:06:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:11,080 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2019-11-07 04:06:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:11,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-11-07 04:06:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:11,088 INFO L225 Difference]: With dead ends: 388 [2019-11-07 04:06:11,088 INFO L226 Difference]: Without dead ends: 352 [2019-11-07 04:06:11,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:06:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-07 04:06:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-11-07 04:06:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-07 04:06:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-11-07 04:06:11,114 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 66 [2019-11-07 04:06:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:11,114 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-11-07 04:06:11,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-11-07 04:06:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-07 04:06:11,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:11,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:11,116 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -83778572, now seen corresponding path program 1 times [2019-11-07 04:06:11,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:11,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44779301] [2019-11-07 04:06:11,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:11,337 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44779301] [2019-11-07 04:06:11,337 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:11,337 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:06:11,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002900301] [2019-11-07 04:06:11,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:06:11,338 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:06:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:11,338 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 8 states. [2019-11-07 04:06:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:11,881 INFO L93 Difference]: Finished difference Result 434 states and 521 transitions. [2019-11-07 04:06:11,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:11,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-07 04:06:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:11,885 INFO L225 Difference]: With dead ends: 434 [2019-11-07 04:06:11,885 INFO L226 Difference]: Without dead ends: 430 [2019-11-07 04:06:11,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-07 04:06:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 352. [2019-11-07 04:06:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-07 04:06:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-11-07 04:06:11,913 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 67 [2019-11-07 04:06:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:11,914 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-11-07 04:06:11,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:06:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-11-07 04:06:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 04:06:11,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:11,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:11,916 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 451436269, now seen corresponding path program 1 times [2019-11-07 04:06:11,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:11,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986805011] [2019-11-07 04:06:11,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:11,966 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986805011] [2019-11-07 04:06:11,966 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:11,967 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:11,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140747995] [2019-11-07 04:06:11,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:11,967 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:11,968 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 5 states. [2019-11-07 04:06:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:12,366 INFO L93 Difference]: Finished difference Result 637 states and 726 transitions. [2019-11-07 04:06:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:06:12,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-07 04:06:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:12,369 INFO L225 Difference]: With dead ends: 637 [2019-11-07 04:06:12,371 INFO L226 Difference]: Without dead ends: 418 [2019-11-07 04:06:12,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-07 04:06:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2019-11-07 04:06:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-07 04:06:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 456 transitions. [2019-11-07 04:06:12,412 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 456 transitions. Word has length 62 [2019-11-07 04:06:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:12,412 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 456 transitions. [2019-11-07 04:06:12,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 456 transitions. [2019-11-07 04:06:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-07 04:06:12,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:12,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:12,414 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1445775960, now seen corresponding path program 1 times [2019-11-07 04:06:12,415 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:12,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675262315] [2019-11-07 04:06:12,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:12,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675262315] [2019-11-07 04:06:12,495 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:12,495 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:06:12,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816408273] [2019-11-07 04:06:12,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:06:12,495 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:06:12,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:06:12,497 INFO L87 Difference]: Start difference. First operand 398 states and 456 transitions. Second operand 9 states. [2019-11-07 04:06:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:12,636 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2019-11-07 04:06:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:06:12,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-07 04:06:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:12,638 INFO L225 Difference]: With dead ends: 400 [2019-11-07 04:06:12,639 INFO L226 Difference]: Without dead ends: 328 [2019-11-07 04:06:12,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-07 04:06:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-11-07 04:06:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-07 04:06:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 380 transitions. [2019-11-07 04:06:12,667 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 380 transitions. Word has length 63 [2019-11-07 04:06:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:12,667 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 380 transitions. [2019-11-07 04:06:12,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:06:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 380 transitions. [2019-11-07 04:06:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-07 04:06:12,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:12,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:12,669 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2143981119, now seen corresponding path program 1 times [2019-11-07 04:06:12,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:12,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758262037] [2019-11-07 04:06:12,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:12,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758262037] [2019-11-07 04:06:12,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:12,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:12,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547865347] [2019-11-07 04:06:12,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:12,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:12,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:12,730 INFO L87 Difference]: Start difference. First operand 328 states and 380 transitions. Second operand 7 states. [2019-11-07 04:06:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:12,820 INFO L93 Difference]: Finished difference Result 345 states and 396 transitions. [2019-11-07 04:06:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:06:12,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-07 04:06:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:12,823 INFO L225 Difference]: With dead ends: 345 [2019-11-07 04:06:12,823 INFO L226 Difference]: Without dead ends: 326 [2019-11-07 04:06:12,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-07 04:06:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-11-07 04:06:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-07 04:06:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2019-11-07 04:06:12,850 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 74 [2019-11-07 04:06:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:12,850 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2019-11-07 04:06:12,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2019-11-07 04:06:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 04:06:12,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:12,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:12,852 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:12,852 INFO L82 PathProgramCache]: Analyzing trace with hash -123615300, now seen corresponding path program 1 times [2019-11-07 04:06:12,853 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:12,853 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878019021] [2019-11-07 04:06:12,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:12,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878019021] [2019-11-07 04:06:12,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:12,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:06:12,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852397980] [2019-11-07 04:06:12,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:06:12,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:06:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:12,969 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand 10 states. [2019-11-07 04:06:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:13,424 INFO L93 Difference]: Finished difference Result 403 states and 457 transitions. [2019-11-07 04:06:13,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:13,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-11-07 04:06:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:13,426 INFO L225 Difference]: With dead ends: 403 [2019-11-07 04:06:13,426 INFO L226 Difference]: Without dead ends: 259 [2019-11-07 04:06:13,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:06:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-07 04:06:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-11-07 04:06:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-07 04:06:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 289 transitions. [2019-11-07 04:06:13,450 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 289 transitions. Word has length 75 [2019-11-07 04:06:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:13,450 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 289 transitions. [2019-11-07 04:06:13,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 289 transitions. [2019-11-07 04:06:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-07 04:06:13,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:13,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:13,452 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1138474364, now seen corresponding path program 1 times [2019-11-07 04:06:13,453 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:13,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144951637] [2019-11-07 04:06:13,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:13,552 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144951637] [2019-11-07 04:06:13,552 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:13,552 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:06:13,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068798610] [2019-11-07 04:06:13,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:06:13,553 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:13,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:06:13,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:06:13,553 INFO L87 Difference]: Start difference. First operand 255 states and 289 transitions. Second operand 10 states. [2019-11-07 04:06:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:13,799 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2019-11-07 04:06:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:06:13,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-11-07 04:06:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:13,800 INFO L225 Difference]: With dead ends: 297 [2019-11-07 04:06:13,800 INFO L226 Difference]: Without dead ends: 235 [2019-11-07 04:06:13,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-07 04:06:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-07 04:06:13,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-11-07 04:06:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-07 04:06:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2019-11-07 04:06:13,823 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 81 [2019-11-07 04:06:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:13,823 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2019-11-07 04:06:13,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:06:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2019-11-07 04:06:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 04:06:13,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:13,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:13,827 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 775720589, now seen corresponding path program 1 times [2019-11-07 04:06:13,828 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:13,828 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661006399] [2019-11-07 04:06:13,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:06:13,950 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661006399] [2019-11-07 04:06:13,950 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:13,950 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:06:13,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606016442] [2019-11-07 04:06:13,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:06:13,954 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:06:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:13,955 INFO L87 Difference]: Start difference. First operand 235 states and 265 transitions. Second operand 11 states. [2019-11-07 04:06:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:14,090 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2019-11-07 04:06:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:14,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-11-07 04:06:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:14,093 INFO L225 Difference]: With dead ends: 313 [2019-11-07 04:06:14,093 INFO L226 Difference]: Without dead ends: 200 [2019-11-07 04:06:14,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:06:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-07 04:06:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2019-11-07 04:06:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-07 04:06:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2019-11-07 04:06:14,118 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 86 [2019-11-07 04:06:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:14,119 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2019-11-07 04:06:14,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:06:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2019-11-07 04:06:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 04:06:14,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:14,120 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:14,121 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1293847127, now seen corresponding path program 1 times [2019-11-07 04:06:14,121 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:14,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688203570] [2019-11-07 04:06:14,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 04:06:14,294 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688203570] [2019-11-07 04:06:14,294 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:14,294 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:06:14,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932634186] [2019-11-07 04:06:14,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:06:14,295 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:06:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:06:14,296 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 7 states. [2019-11-07 04:06:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:14,469 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2019-11-07 04:06:14,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:06:14,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-07 04:06:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:14,471 INFO L225 Difference]: With dead ends: 251 [2019-11-07 04:06:14,471 INFO L226 Difference]: Without dead ends: 248 [2019-11-07 04:06:14,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:06:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-07 04:06:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2019-11-07 04:06:14,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-07 04:06:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2019-11-07 04:06:14,494 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 91 [2019-11-07 04:06:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:14,494 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2019-11-07 04:06:14,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:06:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2019-11-07 04:06:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 04:06:14,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:14,496 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:14,496 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2073576186, now seen corresponding path program 1 times [2019-11-07 04:06:14,497 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:14,497 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381341291] [2019-11-07 04:06:14,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:14,574 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381341291] [2019-11-07 04:06:14,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:14,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:14,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749585487] [2019-11-07 04:06:14,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:14,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:14,576 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand 5 states. [2019-11-07 04:06:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:14,774 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2019-11-07 04:06:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:06:14,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-07 04:06:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:14,777 INFO L225 Difference]: With dead ends: 307 [2019-11-07 04:06:14,777 INFO L226 Difference]: Without dead ends: 246 [2019-11-07 04:06:14,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-07 04:06:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 151. [2019-11-07 04:06:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-07 04:06:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-11-07 04:06:14,795 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 99 [2019-11-07 04:06:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:14,795 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-11-07 04:06:14,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-11-07 04:06:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 04:06:14,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:14,797 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:14,797 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1183994184, now seen corresponding path program 1 times [2019-11-07 04:06:14,798 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:14,798 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803196875] [2019-11-07 04:06:14,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:14,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803196875] [2019-11-07 04:06:14,930 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:14,930 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-07 04:06:14,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333258044] [2019-11-07 04:06:14,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 04:06:14,931 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 04:06:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-07 04:06:14,931 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 13 states. [2019-11-07 04:06:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:15,147 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2019-11-07 04:06:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:06:15,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-11-07 04:06:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:15,149 INFO L225 Difference]: With dead ends: 194 [2019-11-07 04:06:15,149 INFO L226 Difference]: Without dead ends: 165 [2019-11-07 04:06:15,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:06:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-07 04:06:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-11-07 04:06:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-07 04:06:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2019-11-07 04:06:15,163 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 110 [2019-11-07 04:06:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:15,163 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2019-11-07 04:06:15,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 04:06:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2019-11-07 04:06:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-07 04:06:15,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:15,165 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:15,165 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1713752837, now seen corresponding path program 1 times [2019-11-07 04:06:15,166 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:15,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007244674] [2019-11-07 04:06:15,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:15,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:15,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007244674] [2019-11-07 04:06:15,285 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:15,285 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-07 04:06:15,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111313085] [2019-11-07 04:06:15,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:06:15,286 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:06:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:06:15,287 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 11 states. [2019-11-07 04:06:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:15,421 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-11-07 04:06:15,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:06:15,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-11-07 04:06:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:15,422 INFO L225 Difference]: With dead ends: 190 [2019-11-07 04:06:15,423 INFO L226 Difference]: Without dead ends: 157 [2019-11-07 04:06:15,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:06:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-07 04:06:15,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-07 04:06:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-07 04:06:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2019-11-07 04:06:15,440 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 123 [2019-11-07 04:06:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:15,441 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2019-11-07 04:06:15,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-07 04:06:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2019-11-07 04:06:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-07 04:06:15,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:15,443 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:15,444 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:15,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1253619711, now seen corresponding path program 1 times [2019-11-07 04:06:15,444 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:15,444 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002782075] [2019-11-07 04:06:15,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:15,536 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002782075] [2019-11-07 04:06:15,536 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:15,537 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:06:15,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303028768] [2019-11-07 04:06:15,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:06:15,537 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:06:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:06:15,540 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 5 states. [2019-11-07 04:06:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:15,617 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2019-11-07 04:06:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:06:15,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-11-07 04:06:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:15,618 INFO L225 Difference]: With dead ends: 196 [2019-11-07 04:06:15,618 INFO L226 Difference]: Without dead ends: 142 [2019-11-07 04:06:15,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:06:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-07 04:06:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-07 04:06:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-07 04:06:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-11-07 04:06:15,635 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 126 [2019-11-07 04:06:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:15,636 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-11-07 04:06:15,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:06:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-11-07 04:06:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 04:06:15,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:06:15,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:06:15,638 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:06:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:06:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 120929572, now seen corresponding path program 1 times [2019-11-07 04:06:15,638 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:06:15,638 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385000172] [2019-11-07 04:06:15,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:06:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:06:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-07 04:06:15,921 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385000172] [2019-11-07 04:06:15,921 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:06:15,921 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-07 04:06:15,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952491147] [2019-11-07 04:06:15,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-07 04:06:15,922 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:06:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-07 04:06:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:06:15,922 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 14 states. [2019-11-07 04:06:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:06:16,867 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2019-11-07 04:06:16,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:06:16,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 128 [2019-11-07 04:06:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:06:16,869 INFO L225 Difference]: With dead ends: 145 [2019-11-07 04:06:16,869 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:06:16,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:06:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:06:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:06:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:06:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:06:16,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2019-11-07 04:06:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:06:16,872 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:06:16,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-07 04:06:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:06:16,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:06:16,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:06:18,406 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-07 04:06:18,687 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-11-07 04:06:18,931 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2019-11-07 04:06:19,187 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-11-07 04:06:19,373 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-07 04:06:20,021 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 91 [2019-11-07 04:06:20,175 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-11-07 04:06:20,445 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-11-07 04:06:20,803 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-11-07 04:06:21,434 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 56 [2019-11-07 04:06:21,950 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 90 [2019-11-07 04:06:22,155 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2019-11-07 04:06:22,824 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-11-07 04:06:23,099 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 1 [2019-11-07 04:06:23,210 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-07 04:06:23,478 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-11-07 04:06:23,590 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-11-07 04:06:24,255 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 93 [2019-11-07 04:06:24,513 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-11-07 04:06:24,623 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65