java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:01:00,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:00,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:00,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:00,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:00,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:00,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:00,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:00,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:00,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:00,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:00,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:00,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:00,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:00,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:00,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:00,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:00,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:00,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:00,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:00,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:00,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:00,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:00,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:00,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:00,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:00,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:00,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:00,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:00,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:00,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:00,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:00,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:00,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:00,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:00,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:00,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:00,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:00,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:00,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:00,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:00,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:01:00,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:00,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:00,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:00,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:00,555 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:00,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:00,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:00,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:00,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:00,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:00,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:00,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:00,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:00,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:00,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:00,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:00,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:00,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:00,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:00,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:00,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:00,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:00,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:00,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:00,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:00,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:00,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:00,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:00,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:01:00,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:00,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:00,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:00,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:00,850 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:00,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-13 23:01:00,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3f3e062/e7624b1a92824ea0955c469eb4545fb5/FLAGd0de4bf39 [2019-10-13 23:01:01,496 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:01,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-13 23:01:01,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3f3e062/e7624b1a92824ea0955c469eb4545fb5/FLAGd0de4bf39 [2019-10-13 23:01:01,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3f3e062/e7624b1a92824ea0955c469eb4545fb5 [2019-10-13 23:01:01,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:01,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:01,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:01,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:01,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:01,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:01" (1/1) ... [2019-10-13 23:01:01,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f038df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:01, skipping insertion in model container [2019-10-13 23:01:01,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:01" (1/1) ... [2019-10-13 23:01:01,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:01,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:02,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:02,422 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:02,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:02,579 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:02,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02 WrapperNode [2019-10-13 23:01:02,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:02,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:02,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:02,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:02,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... [2019-10-13 23:01:02,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:02,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:02,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:02,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:02,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:02,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:02,790 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-13 23:01:02,791 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-13 23:01:02,792 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-13 23:01:02,792 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-13 23:01:02,792 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-13 23:01:02,792 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-13 23:01:02,792 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-13 23:01:02,793 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-13 23:01:02,794 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-13 23:01:02,794 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-13 23:01:02,794 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-13 23:01:02,794 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-13 23:01:02,797 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:02,798 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-13 23:01:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-13 23:01:02,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:02,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:02,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-13 23:01:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-13 23:01:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-13 23:01:02,802 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:02,803 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-13 23:01:02,804 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-13 23:01:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:02,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:03,331 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:03,545 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-13 23:01:03,546 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-13 23:01:03,559 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:03,652 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-13 23:01:03,652 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-13 23:01:03,715 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:03,743 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:03,744 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:03,845 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:03,897 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-13 23:01:03,898 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-13 23:01:03,898 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-13 23:01:03,905 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:04,077 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-13 23:01:04,078 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-13 23:01:04,079 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:04,117 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-13 23:01:04,118 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-13 23:01:04,154 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:04,173 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-13 23:01:04,174 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-13 23:01:04,178 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:04,391 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-13 23:01:04,391 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-13 23:01:04,410 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:04,416 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:04,416 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:04,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:04,995 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:01:04,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:04 BoogieIcfgContainer [2019-10-13 23:01:04,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:04,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:04,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:05,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:05,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:01" (1/3) ... [2019-10-13 23:01:05,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3905abd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:05, skipping insertion in model container [2019-10-13 23:01:05,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:02" (2/3) ... [2019-10-13 23:01:05,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3905abd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:05, skipping insertion in model container [2019-10-13 23:01:05,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:04" (3/3) ... [2019-10-13 23:01:05,005 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-10-13 23:01:05,015 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:05,024 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:05,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:05,070 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:05,070 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:05,070 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:05,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:05,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:05,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:05,071 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:05,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2019-10-13 23:01:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:05,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:05,108 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:05,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1896705104, now seen corresponding path program 1 times [2019-10-13 23:01:05,125 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:05,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949653767] [2019-10-13 23:01:05,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:05,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:05,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:05,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-10-13 23:01:05,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949653767] [2019-10-13 23:01:05,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:05,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:05,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995944514] [2019-10-13 23:01:05,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:05,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:05,456 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2019-10-13 23:01:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:05,660 INFO L93 Difference]: Finished difference Result 706 states and 1095 transitions. [2019-10-13 23:01:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:05,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:05,693 INFO L225 Difference]: With dead ends: 706 [2019-10-13 23:01:05,693 INFO L226 Difference]: Without dead ends: 404 [2019-10-13 23:01:05,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-13 23:01:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-13 23:01:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-13 23:01:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 582 transitions. [2019-10-13 23:01:05,841 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 582 transitions. Word has length 18 [2019-10-13 23:01:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:05,842 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 582 transitions. [2019-10-13 23:01:05,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 582 transitions. [2019-10-13 23:01:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:01:05,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:05,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:05,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:05,846 INFO L82 PathProgramCache]: Analyzing trace with hash -120255175, now seen corresponding path program 1 times [2019-10-13 23:01:05,847 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:05,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778107629] [2019-10-13 23:01:05,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:05,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:05,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:06,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-10-13 23:01:06,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778107629] [2019-10-13 23:01:06,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:06,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:06,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274919519] [2019-10-13 23:01:06,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:06,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,047 INFO L87 Difference]: Start difference. First operand 404 states and 582 transitions. Second operand 3 states. [2019-10-13 23:01:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:06,270 INFO L93 Difference]: Finished difference Result 576 states and 812 transitions. [2019-10-13 23:01:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:06,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 23:01:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:06,277 INFO L225 Difference]: With dead ends: 576 [2019-10-13 23:01:06,278 INFO L226 Difference]: Without dead ends: 477 [2019-10-13 23:01:06,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-13 23:01:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2019-10-13 23:01:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-10-13 23:01:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 675 transitions. [2019-10-13 23:01:06,310 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 675 transitions. Word has length 21 [2019-10-13 23:01:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:06,310 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 675 transitions. [2019-10-13 23:01:06,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 675 transitions. [2019-10-13 23:01:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 23:01:06,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:06,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:06,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:06,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash -845502214, now seen corresponding path program 1 times [2019-10-13 23:01:06,314 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:06,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730492706] [2019-10-13 23:01:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:06,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730492706] [2019-10-13 23:01:06,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:06,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:06,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161033136] [2019-10-13 23:01:06,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:06,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:06,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,420 INFO L87 Difference]: Start difference. First operand 473 states and 675 transitions. Second operand 3 states. [2019-10-13 23:01:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:06,467 INFO L93 Difference]: Finished difference Result 691 states and 959 transitions. [2019-10-13 23:01:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:06,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 23:01:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:06,473 INFO L225 Difference]: With dead ends: 691 [2019-10-13 23:01:06,473 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 23:01:06,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 23:01:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2019-10-13 23:01:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-13 23:01:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 767 transitions. [2019-10-13 23:01:06,506 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 767 transitions. Word has length 26 [2019-10-13 23:01:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:06,506 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 767 transitions. [2019-10-13 23:01:06,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 767 transitions. [2019-10-13 23:01:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 23:01:06,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:06,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:06,509 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:06,510 INFO L82 PathProgramCache]: Analyzing trace with hash 502235177, now seen corresponding path program 1 times [2019-10-13 23:01:06,510 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:06,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177247324] [2019-10-13 23:01:06,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:06,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177247324] [2019-10-13 23:01:06,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:06,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:06,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381482924] [2019-10-13 23:01:06,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:06,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,557 INFO L87 Difference]: Start difference. First operand 543 states and 767 transitions. Second operand 3 states. [2019-10-13 23:01:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:06,711 INFO L93 Difference]: Finished difference Result 1030 states and 1499 transitions. [2019-10-13 23:01:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:06,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 23:01:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:06,718 INFO L225 Difference]: With dead ends: 1030 [2019-10-13 23:01:06,719 INFO L226 Difference]: Without dead ends: 822 [2019-10-13 23:01:06,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-10-13 23:01:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 670. [2019-10-13 23:01:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-13 23:01:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 993 transitions. [2019-10-13 23:01:06,761 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 993 transitions. Word has length 27 [2019-10-13 23:01:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:06,761 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 993 transitions. [2019-10-13 23:01:06,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 993 transitions. [2019-10-13 23:01:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:01:06,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:06,764 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:06,764 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1848972292, now seen corresponding path program 1 times [2019-10-13 23:01:06,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:06,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718654285] [2019-10-13 23:01:06,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:06,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:06,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718654285] [2019-10-13 23:01:06,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:06,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:06,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955221576] [2019-10-13 23:01:06,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:06,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:06,859 INFO L87 Difference]: Start difference. First operand 670 states and 993 transitions. Second operand 5 states. [2019-10-13 23:01:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:07,657 INFO L93 Difference]: Finished difference Result 1138 states and 1680 transitions. [2019-10-13 23:01:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:07,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-13 23:01:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:07,663 INFO L225 Difference]: With dead ends: 1138 [2019-10-13 23:01:07,664 INFO L226 Difference]: Without dead ends: 721 [2019-10-13 23:01:07,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-13 23:01:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 658. [2019-10-13 23:01:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-13 23:01:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 969 transitions. [2019-10-13 23:01:07,705 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 969 transitions. Word has length 28 [2019-10-13 23:01:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:07,705 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 969 transitions. [2019-10-13 23:01:07,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 969 transitions. [2019-10-13 23:01:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:01:07,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:07,707 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:07,708 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 599155873, now seen corresponding path program 1 times [2019-10-13 23:01:07,708 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:07,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562367159] [2019-10-13 23:01:07,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:07,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:07,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:07,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562367159] [2019-10-13 23:01:07,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:07,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:07,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496313350] [2019-10-13 23:01:07,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:07,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:07,763 INFO L87 Difference]: Start difference. First operand 658 states and 969 transitions. Second operand 3 states. [2019-10-13 23:01:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:07,846 INFO L93 Difference]: Finished difference Result 661 states and 971 transitions. [2019-10-13 23:01:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:07,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 23:01:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:07,851 INFO L225 Difference]: With dead ends: 661 [2019-10-13 23:01:07,851 INFO L226 Difference]: Without dead ends: 657 [2019-10-13 23:01:07,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-13 23:01:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-13 23:01:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-13 23:01:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 966 transitions. [2019-10-13 23:01:07,897 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 966 transitions. Word has length 29 [2019-10-13 23:01:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:07,900 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 966 transitions. [2019-10-13 23:01:07,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 966 transitions. [2019-10-13 23:01:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:07,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:07,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:07,905 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:07,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1989182425, now seen corresponding path program 1 times [2019-10-13 23:01:07,906 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:07,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476214986] [2019-10-13 23:01:07,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:07,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:07,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:07,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476214986] [2019-10-13 23:01:07,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:07,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:07,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451803271] [2019-10-13 23:01:07,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:07,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:07,982 INFO L87 Difference]: Start difference. First operand 657 states and 966 transitions. Second operand 3 states. [2019-10-13 23:01:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:08,039 INFO L93 Difference]: Finished difference Result 931 states and 1326 transitions. [2019-10-13 23:01:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:08,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 23:01:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:08,047 INFO L225 Difference]: With dead ends: 931 [2019-10-13 23:01:08,047 INFO L226 Difference]: Without dead ends: 741 [2019-10-13 23:01:08,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-13 23:01:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 639. [2019-10-13 23:01:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-13 23:01:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 905 transitions. [2019-10-13 23:01:08,098 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 905 transitions. Word has length 35 [2019-10-13 23:01:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:08,098 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 905 transitions. [2019-10-13 23:01:08,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 905 transitions. [2019-10-13 23:01:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:01:08,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:08,103 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:08,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:08,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1855799109, now seen corresponding path program 1 times [2019-10-13 23:01:08,104 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:08,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516795154] [2019-10-13 23:01:08,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:08,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516795154] [2019-10-13 23:01:08,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:08,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:08,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329136016] [2019-10-13 23:01:08,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:08,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:08,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:08,202 INFO L87 Difference]: Start difference. First operand 639 states and 905 transitions. Second operand 3 states. [2019-10-13 23:01:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:08,269 INFO L93 Difference]: Finished difference Result 707 states and 990 transitions. [2019-10-13 23:01:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:08,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-13 23:01:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:08,276 INFO L225 Difference]: With dead ends: 707 [2019-10-13 23:01:08,276 INFO L226 Difference]: Without dead ends: 687 [2019-10-13 23:01:08,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-13 23:01:08,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 678. [2019-10-13 23:01:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-13 23:01:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 952 transitions. [2019-10-13 23:01:08,328 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 952 transitions. Word has length 36 [2019-10-13 23:01:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:08,329 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 952 transitions. [2019-10-13 23:01:08,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 952 transitions. [2019-10-13 23:01:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:08,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:08,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:08,338 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:08,338 INFO L82 PathProgramCache]: Analyzing trace with hash 935929741, now seen corresponding path program 1 times [2019-10-13 23:01:08,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:08,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294098128] [2019-10-13 23:01:08,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:08,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294098128] [2019-10-13 23:01:08,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:08,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:08,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239706100] [2019-10-13 23:01:08,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:08,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:08,464 INFO L87 Difference]: Start difference. First operand 678 states and 952 transitions. Second operand 3 states. [2019-10-13 23:01:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:08,528 INFO L93 Difference]: Finished difference Result 883 states and 1226 transitions. [2019-10-13 23:01:08,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:08,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-13 23:01:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:08,533 INFO L225 Difference]: With dead ends: 883 [2019-10-13 23:01:08,533 INFO L226 Difference]: Without dead ends: 709 [2019-10-13 23:01:08,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-13 23:01:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 678. [2019-10-13 23:01:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-13 23:01:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 950 transitions. [2019-10-13 23:01:08,602 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 950 transitions. Word has length 42 [2019-10-13 23:01:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 950 transitions. [2019-10-13 23:01:08,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 950 transitions. [2019-10-13 23:01:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:08,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:08,607 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:08,608 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1568310813, now seen corresponding path program 1 times [2019-10-13 23:01:08,608 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:08,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117934301] [2019-10-13 23:01:08,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:08,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:08,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117934301] [2019-10-13 23:01:08,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:08,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:08,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676922852] [2019-10-13 23:01:08,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:08,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:08,690 INFO L87 Difference]: Start difference. First operand 678 states and 950 transitions. Second operand 4 states. [2019-10-13 23:01:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:09,037 INFO L93 Difference]: Finished difference Result 779 states and 1066 transitions. [2019-10-13 23:01:09,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:09,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-13 23:01:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:09,041 INFO L225 Difference]: With dead ends: 779 [2019-10-13 23:01:09,041 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 23:01:09,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 23:01:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 576. [2019-10-13 23:01:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 23:01:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 795 transitions. [2019-10-13 23:01:09,074 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 795 transitions. Word has length 42 [2019-10-13 23:01:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:09,075 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 795 transitions. [2019-10-13 23:01:09,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 795 transitions. [2019-10-13 23:01:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:09,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:09,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:09,077 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:09,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 78626218, now seen corresponding path program 1 times [2019-10-13 23:01:09,078 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:09,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649676171] [2019-10-13 23:01:09,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,078 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:09,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649676171] [2019-10-13 23:01:09,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:09,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:09,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290014283] [2019-10-13 23:01:09,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:09,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:09,171 INFO L87 Difference]: Start difference. First operand 576 states and 795 transitions. Second operand 3 states. [2019-10-13 23:01:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:09,270 INFO L93 Difference]: Finished difference Result 745 states and 1022 transitions. [2019-10-13 23:01:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:09,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-13 23:01:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:09,275 INFO L225 Difference]: With dead ends: 745 [2019-10-13 23:01:09,275 INFO L226 Difference]: Without dead ends: 731 [2019-10-13 23:01:09,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-13 23:01:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 647. [2019-10-13 23:01:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-13 23:01:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 881 transitions. [2019-10-13 23:01:09,312 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 881 transitions. Word has length 40 [2019-10-13 23:01:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:09,313 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 881 transitions. [2019-10-13 23:01:09,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 881 transitions. [2019-10-13 23:01:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:09,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:09,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:09,316 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1459422559, now seen corresponding path program 1 times [2019-10-13 23:01:09,316 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:09,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671971881] [2019-10-13 23:01:09,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:09,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671971881] [2019-10-13 23:01:09,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:09,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:09,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956340532] [2019-10-13 23:01:09,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:09,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:09,354 INFO L87 Difference]: Start difference. First operand 647 states and 881 transitions. Second operand 3 states. [2019-10-13 23:01:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:09,390 INFO L93 Difference]: Finished difference Result 756 states and 1006 transitions. [2019-10-13 23:01:09,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:09,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:01:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:09,395 INFO L225 Difference]: With dead ends: 756 [2019-10-13 23:01:09,395 INFO L226 Difference]: Without dead ends: 670 [2019-10-13 23:01:09,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-13 23:01:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 644. [2019-10-13 23:01:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-13 23:01:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 873 transitions. [2019-10-13 23:01:09,431 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 873 transitions. Word has length 43 [2019-10-13 23:01:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:09,431 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 873 transitions. [2019-10-13 23:01:09,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2019-10-13 23:01:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:09,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:09,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:09,434 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1413689562, now seen corresponding path program 1 times [2019-10-13 23:01:09,434 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:09,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751708171] [2019-10-13 23:01:09,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:09,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:09,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751708171] [2019-10-13 23:01:09,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:09,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:09,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020527658] [2019-10-13 23:01:09,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:09,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:09,547 INFO L87 Difference]: Start difference. First operand 644 states and 873 transitions. Second operand 10 states. [2019-10-13 23:01:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:11,798 INFO L93 Difference]: Finished difference Result 820 states and 1147 transitions. [2019-10-13 23:01:11,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:11,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-13 23:01:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:11,807 INFO L225 Difference]: With dead ends: 820 [2019-10-13 23:01:11,808 INFO L226 Difference]: Without dead ends: 812 [2019-10-13 23:01:11,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:11,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-13 23:01:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 651. [2019-10-13 23:01:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 23:01:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 875 transitions. [2019-10-13 23:01:11,870 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 875 transitions. Word has length 41 [2019-10-13 23:01:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:11,871 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 875 transitions. [2019-10-13 23:01:11,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 875 transitions. [2019-10-13 23:01:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:11,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:11,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:11,874 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1528304234, now seen corresponding path program 1 times [2019-10-13 23:01:11,874 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:11,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287384460] [2019-10-13 23:01:11,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:11,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287384460] [2019-10-13 23:01:11,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:11,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:11,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348010831] [2019-10-13 23:01:11,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:11,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:11,953 INFO L87 Difference]: Start difference. First operand 651 states and 875 transitions. Second operand 7 states. [2019-10-13 23:01:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,074 INFO L93 Difference]: Finished difference Result 780 states and 1084 transitions. [2019-10-13 23:01:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:13,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-13 23:01:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,079 INFO L225 Difference]: With dead ends: 780 [2019-10-13 23:01:13,080 INFO L226 Difference]: Without dead ends: 725 [2019-10-13 23:01:13,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-13 23:01:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 651. [2019-10-13 23:01:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 23:01:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 873 transitions. [2019-10-13 23:01:13,130 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 873 transitions. Word has length 41 [2019-10-13 23:01:13,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,131 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 873 transitions. [2019-10-13 23:01:13,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 873 transitions. [2019-10-13 23:01:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:13,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:13,133 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1515029715, now seen corresponding path program 1 times [2019-10-13 23:01:13,134 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320679179] [2019-10-13 23:01:13,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320679179] [2019-10-13 23:01:13,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:13,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74052502] [2019-10-13 23:01:13,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:13,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:13,235 INFO L87 Difference]: Start difference. First operand 651 states and 873 transitions. Second operand 9 states. [2019-10-13 23:01:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:14,997 INFO L93 Difference]: Finished difference Result 774 states and 1066 transitions. [2019-10-13 23:01:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:01:14,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-13 23:01:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,003 INFO L225 Difference]: With dead ends: 774 [2019-10-13 23:01:15,003 INFO L226 Difference]: Without dead ends: 721 [2019-10-13 23:01:15,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-13 23:01:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 586. [2019-10-13 23:01:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 23:01:15,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 789 transitions. [2019-10-13 23:01:15,086 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 789 transitions. Word has length 42 [2019-10-13 23:01:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,087 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 789 transitions. [2019-10-13 23:01:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 789 transitions. [2019-10-13 23:01:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:15,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:15,089 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash 23868549, now seen corresponding path program 1 times [2019-10-13 23:01:15,090 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127661581] [2019-10-13 23:01:15,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:15,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127661581] [2019-10-13 23:01:15,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:15,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199426191] [2019-10-13 23:01:15,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:15,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:15,138 INFO L87 Difference]: Start difference. First operand 586 states and 789 transitions. Second operand 3 states. [2019-10-13 23:01:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,232 INFO L93 Difference]: Finished difference Result 738 states and 988 transitions. [2019-10-13 23:01:15,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:15,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-13 23:01:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,236 INFO L225 Difference]: With dead ends: 738 [2019-10-13 23:01:15,237 INFO L226 Difference]: Without dead ends: 722 [2019-10-13 23:01:15,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-13 23:01:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 636. [2019-10-13 23:01:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-13 23:01:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 843 transitions. [2019-10-13 23:01:15,276 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 843 transitions. Word has length 42 [2019-10-13 23:01:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,277 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 843 transitions. [2019-10-13 23:01:15,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 843 transitions. [2019-10-13 23:01:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:15,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,281 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:15,281 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1183789995, now seen corresponding path program 1 times [2019-10-13 23:01:15,282 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126099212] [2019-10-13 23:01:15,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:15,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126099212] [2019-10-13 23:01:15,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:15,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586370258] [2019-10-13 23:01:15,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:15,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:15,388 INFO L87 Difference]: Start difference. First operand 636 states and 843 transitions. Second operand 8 states. [2019-10-13 23:01:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,550 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2019-10-13 23:01:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:15,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-13 23:01:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,555 INFO L225 Difference]: With dead ends: 651 [2019-10-13 23:01:15,555 INFO L226 Difference]: Without dead ends: 647 [2019-10-13 23:01:15,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-13 23:01:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-13 23:01:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-13 23:01:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 854 transitions. [2019-10-13 23:01:15,601 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 854 transitions. Word has length 43 [2019-10-13 23:01:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,601 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 854 transitions. [2019-10-13 23:01:15,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 854 transitions. [2019-10-13 23:01:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:15,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:15,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1183513165, now seen corresponding path program 1 times [2019-10-13 23:01:15,605 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529650338] [2019-10-13 23:01:15,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:15,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529650338] [2019-10-13 23:01:15,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:15,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34458522] [2019-10-13 23:01:15,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:15,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:15,666 INFO L87 Difference]: Start difference. First operand 645 states and 854 transitions. Second operand 5 states. [2019-10-13 23:01:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,259 INFO L93 Difference]: Finished difference Result 733 states and 977 transitions. [2019-10-13 23:01:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:16,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-13 23:01:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,267 INFO L225 Difference]: With dead ends: 733 [2019-10-13 23:01:16,268 INFO L226 Difference]: Without dead ends: 703 [2019-10-13 23:01:16,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-13 23:01:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 622. [2019-10-13 23:01:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-13 23:01:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 829 transitions. [2019-10-13 23:01:16,321 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 829 transitions. Word has length 43 [2019-10-13 23:01:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,321 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 829 transitions. [2019-10-13 23:01:16,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 829 transitions. [2019-10-13 23:01:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:01:16,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:16,324 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 442275922, now seen corresponding path program 1 times [2019-10-13 23:01:16,324 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982150728] [2019-10-13 23:01:16,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,325 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:16,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982150728] [2019-10-13 23:01:16,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:16,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108688538] [2019-10-13 23:01:16,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:16,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:16,371 INFO L87 Difference]: Start difference. First operand 622 states and 829 transitions. Second operand 3 states. [2019-10-13 23:01:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,470 INFO L93 Difference]: Finished difference Result 650 states and 861 transitions. [2019-10-13 23:01:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:16,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 23:01:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,477 INFO L225 Difference]: With dead ends: 650 [2019-10-13 23:01:16,477 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 23:01:16,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 23:01:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 639. [2019-10-13 23:01:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-13 23:01:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 849 transitions. [2019-10-13 23:01:16,593 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 849 transitions. Word has length 45 [2019-10-13 23:01:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,593 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 849 transitions. [2019-10-13 23:01:16,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 849 transitions. [2019-10-13 23:01:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:16,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:16,597 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash 818895296, now seen corresponding path program 1 times [2019-10-13 23:01:16,598 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768194717] [2019-10-13 23:01:16,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:16,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768194717] [2019-10-13 23:01:16,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:16,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815031054] [2019-10-13 23:01:16,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:16,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:16,653 INFO L87 Difference]: Start difference. First operand 639 states and 849 transitions. Second operand 3 states. [2019-10-13 23:01:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,731 INFO L93 Difference]: Finished difference Result 811 states and 1071 transitions. [2019-10-13 23:01:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:16,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-13 23:01:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,735 INFO L225 Difference]: With dead ends: 811 [2019-10-13 23:01:16,735 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 23:01:16,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 23:01:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 23:01:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 23:01:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 813 transitions. [2019-10-13 23:01:16,783 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 813 transitions. Word has length 50 [2019-10-13 23:01:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,783 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 813 transitions. [2019-10-13 23:01:16,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 813 transitions. [2019-10-13 23:01:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:16,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,786 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:16,787 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 59708023, now seen corresponding path program 1 times [2019-10-13 23:01:16,787 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871777267] [2019-10-13 23:01:16,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:16,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871777267] [2019-10-13 23:01:16,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:16,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784319717] [2019-10-13 23:01:16,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:16,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:16,936 INFO L87 Difference]: Start difference. First operand 612 states and 813 transitions. Second operand 13 states. [2019-10-13 23:01:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,701 INFO L93 Difference]: Finished difference Result 644 states and 847 transitions. [2019-10-13 23:01:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:18,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-13 23:01:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,706 INFO L225 Difference]: With dead ends: 644 [2019-10-13 23:01:18,706 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 23:01:18,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:01:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 23:01:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 612. [2019-10-13 23:01:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 23:01:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 812 transitions. [2019-10-13 23:01:18,748 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 812 transitions. Word has length 47 [2019-10-13 23:01:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,748 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 812 transitions. [2019-10-13 23:01:18,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 812 transitions. [2019-10-13 23:01:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:01:18,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,751 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:18,751 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2131872599, now seen corresponding path program 1 times [2019-10-13 23:01:18,752 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529060623] [2019-10-13 23:01:18,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:18,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529060623] [2019-10-13 23:01:18,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:18,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697245466] [2019-10-13 23:01:18,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:18,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:18,922 INFO L87 Difference]: Start difference. First operand 612 states and 812 transitions. Second operand 9 states. [2019-10-13 23:01:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,115 INFO L93 Difference]: Finished difference Result 636 states and 838 transitions. [2019-10-13 23:01:19,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:19,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-13 23:01:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,119 INFO L225 Difference]: With dead ends: 636 [2019-10-13 23:01:19,119 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 23:01:19,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 23:01:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 23:01:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 23:01:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 795 transitions. [2019-10-13 23:01:19,162 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 795 transitions. Word has length 48 [2019-10-13 23:01:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,162 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 795 transitions. [2019-10-13 23:01:19,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 795 transitions. [2019-10-13 23:01:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:19,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,164 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:19,165 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1157902169, now seen corresponding path program 1 times [2019-10-13 23:01:19,165 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310612279] [2019-10-13 23:01:19,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:19,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310612279] [2019-10-13 23:01:19,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:19,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506481499] [2019-10-13 23:01:19,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:19,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:19,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:19,313 INFO L87 Difference]: Start difference. First operand 607 states and 795 transitions. Second operand 10 states. [2019-10-13 23:01:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,560 INFO L93 Difference]: Finished difference Result 623 states and 812 transitions. [2019-10-13 23:01:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:19,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-13 23:01:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,565 INFO L225 Difference]: With dead ends: 623 [2019-10-13 23:01:19,565 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 23:01:19,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 23:01:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 23:01:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 23:01:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 791 transitions. [2019-10-13 23:01:19,612 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 791 transitions. Word has length 50 [2019-10-13 23:01:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,612 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 791 transitions. [2019-10-13 23:01:19,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 791 transitions. [2019-10-13 23:01:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:01:19,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,615 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:19,615 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1617361323, now seen corresponding path program 1 times [2019-10-13 23:01:19,615 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36324787] [2019-10-13 23:01:19,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,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-10-13 23:01:19,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36324787] [2019-10-13 23:01:19,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:19,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611006191] [2019-10-13 23:01:19,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:19,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:19,730 INFO L87 Difference]: Start difference. First operand 605 states and 791 transitions. Second operand 10 states. [2019-10-13 23:01:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,964 INFO L93 Difference]: Finished difference Result 618 states and 805 transitions. [2019-10-13 23:01:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:19,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-13 23:01:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,970 INFO L225 Difference]: With dead ends: 618 [2019-10-13 23:01:19,970 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 23:01:19,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 23:01:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-13 23:01:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-13 23:01:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 784 transitions. [2019-10-13 23:01:20,011 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 784 transitions. Word has length 49 [2019-10-13 23:01:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,012 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 784 transitions. [2019-10-13 23:01:20,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 784 transitions. [2019-10-13 23:01:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:20,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,014 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,014 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1878962800, now seen corresponding path program 1 times [2019-10-13 23:01:20,015 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388123452] [2019-10-13 23:01:20,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:20,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388123452] [2019-10-13 23:01:20,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:20,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543323800] [2019-10-13 23:01:20,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:20,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:20,132 INFO L87 Difference]: Start difference. First operand 600 states and 784 transitions. Second operand 12 states. [2019-10-13 23:01:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,387 INFO L93 Difference]: Finished difference Result 625 states and 811 transitions. [2019-10-13 23:01:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:20,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-13 23:01:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,393 INFO L225 Difference]: With dead ends: 625 [2019-10-13 23:01:20,394 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 23:01:20,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 23:01:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2019-10-13 23:01:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 773 transitions. [2019-10-13 23:01:20,476 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 773 transitions. Word has length 51 [2019-10-13 23:01:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,476 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 773 transitions. [2019-10-13 23:01:20,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 773 transitions. [2019-10-13 23:01:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:20,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,478 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,479 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 693077134, now seen corresponding path program 1 times [2019-10-13 23:01:20,479 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67997766] [2019-10-13 23:01:20,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:20,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67997766] [2019-10-13 23:01:20,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:20,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634852436] [2019-10-13 23:01:20,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:20,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:20,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:20,624 INFO L87 Difference]: Start difference. First operand 599 states and 773 transitions. Second operand 11 states. [2019-10-13 23:01:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,876 INFO L93 Difference]: Finished difference Result 615 states and 790 transitions. [2019-10-13 23:01:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:20,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-13 23:01:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,879 INFO L225 Difference]: With dead ends: 615 [2019-10-13 23:01:20,879 INFO L226 Difference]: Without dead ends: 597 [2019-10-13 23:01:20,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-13 23:01:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-13 23:01:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-13 23:01:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 769 transitions. [2019-10-13 23:01:20,919 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 769 transitions. Word has length 50 [2019-10-13 23:01:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,919 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 769 transitions. [2019-10-13 23:01:20,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 769 transitions. [2019-10-13 23:01:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:20,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:20,921 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash 226522084, now seen corresponding path program 1 times [2019-10-13 23:01:20,922 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574956751] [2019-10-13 23:01:20,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:20,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574956751] [2019-10-13 23:01:20,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:20,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571088285] [2019-10-13 23:01:20,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:20,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:20,987 INFO L87 Difference]: Start difference. First operand 597 states and 769 transitions. Second operand 5 states. [2019-10-13 23:01:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,871 INFO L93 Difference]: Finished difference Result 985 states and 1326 transitions. [2019-10-13 23:01:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:21,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:01:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,877 INFO L225 Difference]: With dead ends: 985 [2019-10-13 23:01:21,877 INFO L226 Difference]: Without dead ends: 860 [2019-10-13 23:01:21,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-13 23:01:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 628. [2019-10-13 23:01:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-13 23:01:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 814 transitions. [2019-10-13 23:01:21,928 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 814 transitions. Word has length 54 [2019-10-13 23:01:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,929 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 814 transitions. [2019-10-13 23:01:21,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 814 transitions. [2019-10-13 23:01:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:21,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,932 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1349453429, now seen corresponding path program 1 times [2019-10-13 23:01:21,932 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717709737] [2019-10-13 23:01:21,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717709737] [2019-10-13 23:01:22,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:22,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950651328] [2019-10-13 23:01:22,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:22,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:22,009 INFO L87 Difference]: Start difference. First operand 628 states and 814 transitions. Second operand 9 states. [2019-10-13 23:01:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,214 INFO L93 Difference]: Finished difference Result 652 states and 840 transitions. [2019-10-13 23:01:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:22,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-13 23:01:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,218 INFO L225 Difference]: With dead ends: 652 [2019-10-13 23:01:22,219 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 23:01:22,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 23:01:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 23:01:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 23:01:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 766 transitions. [2019-10-13 23:01:22,323 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 766 transitions. Word has length 51 [2019-10-13 23:01:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,324 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 766 transitions. [2019-10-13 23:01:22,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 766 transitions. [2019-10-13 23:01:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:22,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,326 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:22,326 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1644206521, now seen corresponding path program 1 times [2019-10-13 23:01:22,327 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127904517] [2019-10-13 23:01:22,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127904517] [2019-10-13 23:01:22,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:22,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858343254] [2019-10-13 23:01:22,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:22,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:22,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:22,441 INFO L87 Difference]: Start difference. First operand 601 states and 766 transitions. Second operand 12 states. [2019-10-13 23:01:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,683 INFO L93 Difference]: Finished difference Result 622 states and 788 transitions. [2019-10-13 23:01:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:22,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-13 23:01:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,687 INFO L225 Difference]: With dead ends: 622 [2019-10-13 23:01:22,688 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 23:01:22,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 23:01:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 23:01:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 762 transitions. [2019-10-13 23:01:22,728 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 762 transitions. Word has length 54 [2019-10-13 23:01:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,728 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 762 transitions. [2019-10-13 23:01:22,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 762 transitions. [2019-10-13 23:01:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:01:22,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:22,730 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1729124439, now seen corresponding path program 1 times [2019-10-13 23:01:22,731 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946980713] [2019-10-13 23:01:22,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946980713] [2019-10-13 23:01:22,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:22,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600454167] [2019-10-13 23:01:22,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:22,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:22,856 INFO L87 Difference]: Start difference. First operand 599 states and 762 transitions. Second operand 12 states. [2019-10-13 23:01:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,080 INFO L93 Difference]: Finished difference Result 622 states and 786 transitions. [2019-10-13 23:01:23,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:23,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-13 23:01:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,084 INFO L225 Difference]: With dead ends: 622 [2019-10-13 23:01:23,084 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 23:01:23,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 23:01:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-10-13 23:01:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-13 23:01:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 758 transitions. [2019-10-13 23:01:23,130 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 758 transitions. Word has length 58 [2019-10-13 23:01:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,130 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 758 transitions. [2019-10-13 23:01:23,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 758 transitions. [2019-10-13 23:01:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:01:23,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,133 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -710700847, now seen corresponding path program 1 times [2019-10-13 23:01:23,133 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905624540] [2019-10-13 23:01:23,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905624540] [2019-10-13 23:01:23,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:23,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657324502] [2019-10-13 23:01:23,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:23,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:23,254 INFO L87 Difference]: Start difference. First operand 597 states and 758 transitions. Second operand 12 states. [2019-10-13 23:01:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,540 INFO L93 Difference]: Finished difference Result 620 states and 782 transitions. [2019-10-13 23:01:23,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:23,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-13 23:01:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,545 INFO L225 Difference]: With dead ends: 620 [2019-10-13 23:01:23,545 INFO L226 Difference]: Without dead ends: 597 [2019-10-13 23:01:23,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-13 23:01:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-10-13 23:01:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 23:01:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2019-10-13 23:01:23,607 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 53 [2019-10-13 23:01:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,607 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2019-10-13 23:01:23,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2019-10-13 23:01:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:23,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,612 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1479206302, now seen corresponding path program 1 times [2019-10-13 23:01:23,612 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838772704] [2019-10-13 23:01:23,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838772704] [2019-10-13 23:01:23,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:23,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109999506] [2019-10-13 23:01:23,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:23,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:23,730 INFO L87 Difference]: Start difference. First operand 595 states and 754 transitions. Second operand 11 states. [2019-10-13 23:01:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,850 INFO L93 Difference]: Finished difference Result 656 states and 833 transitions. [2019-10-13 23:01:23,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:23,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-13 23:01:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,854 INFO L225 Difference]: With dead ends: 656 [2019-10-13 23:01:23,854 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 23:01:23,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 23:01:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2019-10-13 23:01:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 771 transitions. [2019-10-13 23:01:23,900 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 771 transitions. Word has length 54 [2019-10-13 23:01:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,900 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 771 transitions. [2019-10-13 23:01:23,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 771 transitions. [2019-10-13 23:01:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 23:01:23,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,903 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,903 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 561992256, now seen corresponding path program 1 times [2019-10-13 23:01:23,904 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249203952] [2019-10-13 23:01:23,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:01:23,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249203952] [2019-10-13 23:01:23,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:23,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102207766] [2019-10-13 23:01:23,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:23,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:23,955 INFO L87 Difference]: Start difference. First operand 599 states and 771 transitions. Second operand 5 states. [2019-10-13 23:01:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,503 INFO L93 Difference]: Finished difference Result 887 states and 1137 transitions. [2019-10-13 23:01:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:24,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-13 23:01:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,508 INFO L225 Difference]: With dead ends: 887 [2019-10-13 23:01:24,508 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 23:01:24,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 23:01:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 23:01:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 23:01:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 759 transitions. [2019-10-13 23:01:24,560 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 759 transitions. Word has length 67 [2019-10-13 23:01:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,560 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 759 transitions. [2019-10-13 23:01:24,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 759 transitions. [2019-10-13 23:01:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:01:24,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,564 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:24,564 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1960985204, now seen corresponding path program 1 times [2019-10-13 23:01:24,565 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341489525] [2019-10-13 23:01:24,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:01:24,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341489525] [2019-10-13 23:01:24,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:24,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:24,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422743192] [2019-10-13 23:01:24,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:24,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:24,612 INFO L87 Difference]: Start difference. First operand 599 states and 759 transitions. Second operand 3 states. [2019-10-13 23:01:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,652 INFO L93 Difference]: Finished difference Result 729 states and 914 transitions. [2019-10-13 23:01:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:24,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-13 23:01:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,655 INFO L225 Difference]: With dead ends: 729 [2019-10-13 23:01:24,655 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 23:01:24,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 23:01:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-13 23:01:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-13 23:01:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 722 transitions. [2019-10-13 23:01:24,699 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 722 transitions. Word has length 68 [2019-10-13 23:01:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,701 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 722 transitions. [2019-10-13 23:01:24,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 722 transitions. [2019-10-13 23:01:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:24,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:24,704 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash 225549446, now seen corresponding path program 1 times [2019-10-13 23:01:24,705 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453238298] [2019-10-13 23:01:24,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:24,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453238298] [2019-10-13 23:01:24,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:24,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:24,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741622809] [2019-10-13 23:01:24,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:24,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:24,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:24,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:24,840 INFO L87 Difference]: Start difference. First operand 575 states and 722 transitions. Second operand 14 states. [2019-10-13 23:01:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,243 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2019-10-13 23:01:25,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:01:25,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-13 23:01:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,249 INFO L225 Difference]: With dead ends: 617 [2019-10-13 23:01:25,249 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 23:01:25,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:01:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 23:01:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 579. [2019-10-13 23:01:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 23:01:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 728 transitions. [2019-10-13 23:01:25,297 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 728 transitions. Word has length 55 [2019-10-13 23:01:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,297 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 728 transitions. [2019-10-13 23:01:25,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 728 transitions. [2019-10-13 23:01:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:25,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,299 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:25,299 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1949389623, now seen corresponding path program 1 times [2019-10-13 23:01:25,300 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921498772] [2019-10-13 23:01:25,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921498772] [2019-10-13 23:01:25,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:25,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691149460] [2019-10-13 23:01:25,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:25,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:25,484 INFO L87 Difference]: Start difference. First operand 579 states and 728 transitions. Second operand 13 states. [2019-10-13 23:01:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,820 INFO L93 Difference]: Finished difference Result 595 states and 745 transitions. [2019-10-13 23:01:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:25,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-13 23:01:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,823 INFO L225 Difference]: With dead ends: 595 [2019-10-13 23:01:25,823 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 23:01:25,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 23:01:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 23:01:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 23:01:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 713 transitions. [2019-10-13 23:01:25,866 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 713 transitions. Word has length 62 [2019-10-13 23:01:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,867 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 713 transitions. [2019-10-13 23:01:25,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 713 transitions. [2019-10-13 23:01:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:25,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,869 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:25,869 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2018558973, now seen corresponding path program 1 times [2019-10-13 23:01:25,870 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63873232] [2019-10-13 23:01:25,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63873232] [2019-10-13 23:01:26,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:26,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886708722] [2019-10-13 23:01:26,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:26,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:26,067 INFO L87 Difference]: Start difference. First operand 568 states and 713 transitions. Second operand 13 states. [2019-10-13 23:01:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,405 INFO L93 Difference]: Finished difference Result 584 states and 730 transitions. [2019-10-13 23:01:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:26,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-13 23:01:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,410 INFO L225 Difference]: With dead ends: 584 [2019-10-13 23:01:26,410 INFO L226 Difference]: Without dead ends: 563 [2019-10-13 23:01:26,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-13 23:01:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-13 23:01:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 23:01:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 706 transitions. [2019-10-13 23:01:26,468 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 706 transitions. Word has length 55 [2019-10-13 23:01:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,468 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 706 transitions. [2019-10-13 23:01:26,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 706 transitions. [2019-10-13 23:01:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 23:01:26,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,471 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:26,471 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1240275999, now seen corresponding path program 1 times [2019-10-13 23:01:26,471 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807588308] [2019-10-13 23:01:26,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807588308] [2019-10-13 23:01:26,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:26,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937028791] [2019-10-13 23:01:26,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:26,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:26,545 INFO L87 Difference]: Start difference. First operand 563 states and 706 transitions. Second operand 3 states. [2019-10-13 23:01:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,603 INFO L93 Difference]: Finished difference Result 658 states and 813 transitions. [2019-10-13 23:01:26,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:26,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-13 23:01:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,607 INFO L225 Difference]: With dead ends: 658 [2019-10-13 23:01:26,607 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 23:01:26,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 23:01:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 564. [2019-10-13 23:01:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 23:01:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 704 transitions. [2019-10-13 23:01:26,650 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 704 transitions. Word has length 69 [2019-10-13 23:01:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 704 transitions. [2019-10-13 23:01:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 704 transitions. [2019-10-13 23:01:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:26,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,653 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:26,653 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash 510330724, now seen corresponding path program 1 times [2019-10-13 23:01:26,654 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360812339] [2019-10-13 23:01:26,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360812339] [2019-10-13 23:01:26,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:26,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388012669] [2019-10-13 23:01:26,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:26,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:26,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:26,754 INFO L87 Difference]: Start difference. First operand 564 states and 704 transitions. Second operand 11 states. [2019-10-13 23:01:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,895 INFO L93 Difference]: Finished difference Result 600 states and 745 transitions. [2019-10-13 23:01:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:26,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-13 23:01:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,899 INFO L225 Difference]: With dead ends: 600 [2019-10-13 23:01:26,899 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 23:01:26,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 23:01:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 564. [2019-10-13 23:01:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 23:01:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 704 transitions. [2019-10-13 23:01:26,942 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 704 transitions. Word has length 56 [2019-10-13 23:01:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,943 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 704 transitions. [2019-10-13 23:01:26,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 704 transitions. [2019-10-13 23:01:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:26,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:26,946 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash -429600589, now seen corresponding path program 1 times [2019-10-13 23:01:26,947 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689227224] [2019-10-13 23:01:26,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689227224] [2019-10-13 23:01:27,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:27,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594307663] [2019-10-13 23:01:27,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:27,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:27,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:27,120 INFO L87 Difference]: Start difference. First operand 564 states and 704 transitions. Second operand 13 states. [2019-10-13 23:01:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,399 INFO L93 Difference]: Finished difference Result 580 states and 721 transitions. [2019-10-13 23:01:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:27,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-13 23:01:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,401 INFO L225 Difference]: With dead ends: 580 [2019-10-13 23:01:27,401 INFO L226 Difference]: Without dead ends: 559 [2019-10-13 23:01:27,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-13 23:01:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-10-13 23:01:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-13 23:01:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-13 23:01:27,442 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 56 [2019-10-13 23:01:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,443 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-13 23:01:27,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-13 23:01:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:27,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:27,445 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1199772891, now seen corresponding path program 1 times [2019-10-13 23:01:27,446 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375686178] [2019-10-13 23:01:27,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375686178] [2019-10-13 23:01:27,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:27,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285227191] [2019-10-13 23:01:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:27,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:27,479 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 3 states. [2019-10-13 23:01:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,513 INFO L93 Difference]: Finished difference Result 710 states and 873 transitions. [2019-10-13 23:01:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:27,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 23:01:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,520 INFO L225 Difference]: With dead ends: 710 [2019-10-13 23:01:27,520 INFO L226 Difference]: Without dead ends: 516 [2019-10-13 23:01:27,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-13 23:01:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 498. [2019-10-13 23:01:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-13 23:01:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 597 transitions. [2019-10-13 23:01:27,558 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 597 transitions. Word has length 56 [2019-10-13 23:01:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,558 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 597 transitions. [2019-10-13 23:01:27,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 597 transitions. [2019-10-13 23:01:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:01:27,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:27,561 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 656330220, now seen corresponding path program 1 times [2019-10-13 23:01:27,561 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220776023] [2019-10-13 23:01:27,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220776023] [2019-10-13 23:01:27,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:27,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586992252] [2019-10-13 23:01:27,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:27,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:27,690 INFO L87 Difference]: Start difference. First operand 498 states and 597 transitions. Second operand 11 states. [2019-10-13 23:01:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,809 INFO L93 Difference]: Finished difference Result 522 states and 623 transitions. [2019-10-13 23:01:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:27,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-13 23:01:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,814 INFO L225 Difference]: With dead ends: 522 [2019-10-13 23:01:27,814 INFO L226 Difference]: Without dead ends: 495 [2019-10-13 23:01:27,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-13 23:01:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-10-13 23:01:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-10-13 23:01:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 592 transitions. [2019-10-13 23:01:27,845 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 592 transitions. Word has length 57 [2019-10-13 23:01:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,846 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 592 transitions. [2019-10-13 23:01:27,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 592 transitions. [2019-10-13 23:01:27,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:27,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:27,848 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1908601480, now seen corresponding path program 1 times [2019-10-13 23:01:27,848 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420508634] [2019-10-13 23:01:27,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420508634] [2019-10-13 23:01:27,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:27,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508678735] [2019-10-13 23:01:27,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:27,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:27,964 INFO L87 Difference]: Start difference. First operand 495 states and 592 transitions. Second operand 12 states. [2019-10-13 23:01:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,200 INFO L93 Difference]: Finished difference Result 516 states and 614 transitions. [2019-10-13 23:01:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:28,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-13 23:01:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,203 INFO L225 Difference]: With dead ends: 516 [2019-10-13 23:01:28,203 INFO L226 Difference]: Without dead ends: 493 [2019-10-13 23:01:28,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-13 23:01:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-10-13 23:01:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-13 23:01:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 588 transitions. [2019-10-13 23:01:28,248 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 588 transitions. Word has length 59 [2019-10-13 23:01:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,249 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 588 transitions. [2019-10-13 23:01:28,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 588 transitions. [2019-10-13 23:01:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:28,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:28,252 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1207180545, now seen corresponding path program 1 times [2019-10-13 23:01:28,253 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715556400] [2019-10-13 23:01:28,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:28,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715556400] [2019-10-13 23:01:28,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:28,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802141936] [2019-10-13 23:01:28,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:28,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:28,399 INFO L87 Difference]: Start difference. First operand 493 states and 588 transitions. Second operand 14 states. [2019-10-13 23:01:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,596 INFO L93 Difference]: Finished difference Result 516 states and 613 transitions. [2019-10-13 23:01:28,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:28,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-10-13 23:01:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,598 INFO L225 Difference]: With dead ends: 516 [2019-10-13 23:01:28,598 INFO L226 Difference]: Without dead ends: 490 [2019-10-13 23:01:28,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-13 23:01:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-10-13 23:01:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 23:01:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 583 transitions. [2019-10-13 23:01:28,631 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 583 transitions. Word has length 59 [2019-10-13 23:01:28,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,631 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 583 transitions. [2019-10-13 23:01:28,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 583 transitions. [2019-10-13 23:01:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:28,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,634 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:28,634 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1171643961, now seen corresponding path program 1 times [2019-10-13 23:01:28,635 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060983333] [2019-10-13 23:01:28,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,635 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:28,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060983333] [2019-10-13 23:01:28,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:28,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519098563] [2019-10-13 23:01:28,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:28,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:28,797 INFO L87 Difference]: Start difference. First operand 490 states and 583 transitions. Second operand 14 states. [2019-10-13 23:01:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,186 INFO L93 Difference]: Finished difference Result 513 states and 608 transitions. [2019-10-13 23:01:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:29,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,189 INFO L225 Difference]: With dead ends: 513 [2019-10-13 23:01:29,189 INFO L226 Difference]: Without dead ends: 487 [2019-10-13 23:01:29,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-13 23:01:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-10-13 23:01:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-13 23:01:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 578 transitions. [2019-10-13 23:01:29,221 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 578 transitions. Word has length 60 [2019-10-13 23:01:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 578 transitions. [2019-10-13 23:01:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 578 transitions. [2019-10-13 23:01:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:29,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:29,224 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash 862953646, now seen corresponding path program 1 times [2019-10-13 23:01:29,224 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606152199] [2019-10-13 23:01:29,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606152199] [2019-10-13 23:01:29,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:29,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777476940] [2019-10-13 23:01:29,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:29,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:29,370 INFO L87 Difference]: Start difference. First operand 487 states and 578 transitions. Second operand 14 states. [2019-10-13 23:01:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,572 INFO L93 Difference]: Finished difference Result 510 states and 603 transitions. [2019-10-13 23:01:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:29,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,576 INFO L225 Difference]: With dead ends: 510 [2019-10-13 23:01:29,576 INFO L226 Difference]: Without dead ends: 482 [2019-10-13 23:01:29,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-13 23:01:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-13 23:01:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-13 23:01:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 571 transitions. [2019-10-13 23:01:29,612 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 571 transitions. Word has length 60 [2019-10-13 23:01:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,613 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 571 transitions. [2019-10-13 23:01:29,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 571 transitions. [2019-10-13 23:01:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 23:01:29,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,615 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:29,615 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash -392712197, now seen corresponding path program 1 times [2019-10-13 23:01:29,616 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304913517] [2019-10-13 23:01:29,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:29,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304913517] [2019-10-13 23:01:29,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:29,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742719099] [2019-10-13 23:01:29,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:29,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:29,763 INFO L87 Difference]: Start difference. First operand 482 states and 571 transitions. Second operand 14 states. [2019-10-13 23:01:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,969 INFO L93 Difference]: Finished difference Result 533 states and 624 transitions. [2019-10-13 23:01:29,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:29,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-10-13 23:01:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,974 INFO L225 Difference]: With dead ends: 533 [2019-10-13 23:01:29,974 INFO L226 Difference]: Without dead ends: 472 [2019-10-13 23:01:29,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-13 23:01:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-10-13 23:01:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-13 23:01:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 556 transitions. [2019-10-13 23:01:30,004 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 556 transitions. Word has length 65 [2019-10-13 23:01:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,005 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 556 transitions. [2019-10-13 23:01:30,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 556 transitions. [2019-10-13 23:01:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:30,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,006 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,007 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1876447963, now seen corresponding path program 1 times [2019-10-13 23:01:30,007 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756733422] [2019-10-13 23:01:30,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756733422] [2019-10-13 23:01:30,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:30,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516749579] [2019-10-13 23:01:30,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:30,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:30,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:30,156 INFO L87 Difference]: Start difference. First operand 472 states and 556 transitions. Second operand 14 states. [2019-10-13 23:01:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,369 INFO L93 Difference]: Finished difference Result 495 states and 581 transitions. [2019-10-13 23:01:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:30,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,373 INFO L225 Difference]: With dead ends: 495 [2019-10-13 23:01:30,373 INFO L226 Difference]: Without dead ends: 466 [2019-10-13 23:01:30,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-13 23:01:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-13 23:01:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 23:01:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 548 transitions. [2019-10-13 23:01:30,407 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 548 transitions. Word has length 60 [2019-10-13 23:01:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,407 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 548 transitions. [2019-10-13 23:01:30,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 548 transitions. [2019-10-13 23:01:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:30,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,410 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash -833697960, now seen corresponding path program 1 times [2019-10-13 23:01:30,410 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660069249] [2019-10-13 23:01:30,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660069249] [2019-10-13 23:01:30,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:30,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040900353] [2019-10-13 23:01:30,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:30,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:30,517 INFO L87 Difference]: Start difference. First operand 466 states and 548 transitions. Second operand 11 states. [2019-10-13 23:01:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,647 INFO L93 Difference]: Finished difference Result 490 states and 574 transitions. [2019-10-13 23:01:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:30,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-13 23:01:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,649 INFO L225 Difference]: With dead ends: 490 [2019-10-13 23:01:30,649 INFO L226 Difference]: Without dead ends: 463 [2019-10-13 23:01:30,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-13 23:01:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2019-10-13 23:01:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-13 23:01:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 543 transitions. [2019-10-13 23:01:30,683 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 543 transitions. Word has length 59 [2019-10-13 23:01:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,684 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 543 transitions. [2019-10-13 23:01:30,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 543 transitions. [2019-10-13 23:01:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:30,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,686 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash 870167993, now seen corresponding path program 1 times [2019-10-13 23:01:30,686 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98217730] [2019-10-13 23:01:30,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:30,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98217730] [2019-10-13 23:01:30,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:30,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452847159] [2019-10-13 23:01:30,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:30,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:30,785 INFO L87 Difference]: Start difference. First operand 463 states and 543 transitions. Second operand 11 states. [2019-10-13 23:01:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,910 INFO L93 Difference]: Finished difference Result 487 states and 569 transitions. [2019-10-13 23:01:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:30,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-13 23:01:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,912 INFO L225 Difference]: With dead ends: 487 [2019-10-13 23:01:30,912 INFO L226 Difference]: Without dead ends: 461 [2019-10-13 23:01:30,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-13 23:01:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-10-13 23:01:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-13 23:01:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 539 transitions. [2019-10-13 23:01:30,959 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 539 transitions. Word has length 60 [2019-10-13 23:01:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,961 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 539 transitions. [2019-10-13 23:01:30,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 539 transitions. [2019-10-13 23:01:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 23:01:30,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,964 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 293777713, now seen corresponding path program 1 times [2019-10-13 23:01:30,965 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182657247] [2019-10-13 23:01:30,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:31,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182657247] [2019-10-13 23:01:31,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:31,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895102276] [2019-10-13 23:01:31,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:31,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:31,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:31,021 INFO L87 Difference]: Start difference. First operand 461 states and 539 transitions. Second operand 5 states. [2019-10-13 23:01:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,378 INFO L93 Difference]: Finished difference Result 514 states and 602 transitions. [2019-10-13 23:01:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:31,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-13 23:01:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,381 INFO L225 Difference]: With dead ends: 514 [2019-10-13 23:01:31,381 INFO L226 Difference]: Without dead ends: 505 [2019-10-13 23:01:31,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-13 23:01:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 461. [2019-10-13 23:01:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-13 23:01:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 537 transitions. [2019-10-13 23:01:31,417 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 537 transitions. Word has length 61 [2019-10-13 23:01:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,417 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 537 transitions. [2019-10-13 23:01:31,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 537 transitions. [2019-10-13 23:01:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:01:31,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,419 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:31,419 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279821, now seen corresponding path program 1 times [2019-10-13 23:01:31,420 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922707654] [2019-10-13 23:01:31,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:01:31,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922707654] [2019-10-13 23:01:31,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:31,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946829547] [2019-10-13 23:01:31,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:31,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:31,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:31,568 INFO L87 Difference]: Start difference. First operand 461 states and 537 transitions. Second operand 6 states. [2019-10-13 23:01:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,641 INFO L93 Difference]: Finished difference Result 532 states and 618 transitions. [2019-10-13 23:01:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:31,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-10-13 23:01:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,644 INFO L225 Difference]: With dead ends: 532 [2019-10-13 23:01:31,644 INFO L226 Difference]: Without dead ends: 459 [2019-10-13 23:01:31,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-13 23:01:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2019-10-13 23:01:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-13 23:01:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 534 transitions. [2019-10-13 23:01:31,684 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 534 transitions. Word has length 76 [2019-10-13 23:01:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,684 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 534 transitions. [2019-10-13 23:01:31,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 534 transitions. [2019-10-13 23:01:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 23:01:31,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,687 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:31,687 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1565735709, now seen corresponding path program 1 times [2019-10-13 23:01:31,687 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161217569] [2019-10-13 23:01:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:01:31,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161217569] [2019-10-13 23:01:31,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:31,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111380566] [2019-10-13 23:01:31,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:31,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:31,806 INFO L87 Difference]: Start difference. First operand 459 states and 534 transitions. Second operand 11 states. [2019-10-13 23:01:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,935 INFO L93 Difference]: Finished difference Result 483 states and 560 transitions. [2019-10-13 23:01:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:31,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-13 23:01:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,938 INFO L225 Difference]: With dead ends: 483 [2019-10-13 23:01:31,938 INFO L226 Difference]: Without dead ends: 452 [2019-10-13 23:01:31,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-13 23:01:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-13 23:01:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-13 23:01:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 523 transitions. [2019-10-13 23:01:31,980 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 523 transitions. Word has length 63 [2019-10-13 23:01:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,981 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 523 transitions. [2019-10-13 23:01:31,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 523 transitions. [2019-10-13 23:01:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:31,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:31,983 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2061580277, now seen corresponding path program 1 times [2019-10-13 23:01:31,984 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720082537] [2019-10-13 23:01:31,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720082537] [2019-10-13 23:01:32,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:32,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2651855] [2019-10-13 23:01:32,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:32,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:32,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,097 INFO L87 Difference]: Start difference. First operand 452 states and 523 transitions. Second operand 11 states. [2019-10-13 23:01:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,247 INFO L93 Difference]: Finished difference Result 476 states and 549 transitions. [2019-10-13 23:01:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:32,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-13 23:01:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,249 INFO L225 Difference]: With dead ends: 476 [2019-10-13 23:01:32,249 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 23:01:32,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 23:01:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2019-10-13 23:01:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-13 23:01:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 516 transitions. [2019-10-13 23:01:32,294 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 516 transitions. Word has length 62 [2019-10-13 23:01:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,295 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 516 transitions. [2019-10-13 23:01:32,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 516 transitions. [2019-10-13 23:01:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:32,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,297 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:32,297 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash -123151742, now seen corresponding path program 1 times [2019-10-13 23:01:32,298 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19711297] [2019-10-13 23:01:32,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19711297] [2019-10-13 23:01:32,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:32,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671087412] [2019-10-13 23:01:32,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:32,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,458 INFO L87 Difference]: Start difference. First operand 447 states and 516 transitions. Second operand 11 states. [2019-10-13 23:01:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,680 INFO L93 Difference]: Finished difference Result 457 states and 525 transitions. [2019-10-13 23:01:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:32,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-13 23:01:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,683 INFO L225 Difference]: With dead ends: 457 [2019-10-13 23:01:32,683 INFO L226 Difference]: Without dead ends: 451 [2019-10-13 23:01:32,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-13 23:01:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 444. [2019-10-13 23:01:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-10-13 23:01:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 509 transitions. [2019-10-13 23:01:32,719 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 509 transitions. Word has length 62 [2019-10-13 23:01:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,719 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 509 transitions. [2019-10-13 23:01:32,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 509 transitions. [2019-10-13 23:01:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:32,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:32,721 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash -123428572, now seen corresponding path program 1 times [2019-10-13 23:01:32,722 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671475693] [2019-10-13 23:01:32,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:32,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671475693] [2019-10-13 23:01:32,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:32,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355063527] [2019-10-13 23:01:32,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:32,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:32,772 INFO L87 Difference]: Start difference. First operand 444 states and 509 transitions. Second operand 5 states. [2019-10-13 23:01:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,126 INFO L93 Difference]: Finished difference Result 491 states and 566 transitions. [2019-10-13 23:01:33,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:33,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 23:01:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,128 INFO L225 Difference]: With dead ends: 491 [2019-10-13 23:01:33,128 INFO L226 Difference]: Without dead ends: 464 [2019-10-13 23:01:33,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-13 23:01:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 423. [2019-10-13 23:01:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-13 23:01:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 484 transitions. [2019-10-13 23:01:33,163 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 484 transitions. Word has length 62 [2019-10-13 23:01:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,164 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 484 transitions. [2019-10-13 23:01:33,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 484 transitions. [2019-10-13 23:01:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:01:33,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:33,165 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1308518573, now seen corresponding path program 1 times [2019-10-13 23:01:33,166 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430027632] [2019-10-13 23:01:33,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:33,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430027632] [2019-10-13 23:01:33,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:33,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96402918] [2019-10-13 23:01:33,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:33,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:33,205 INFO L87 Difference]: Start difference. First operand 423 states and 484 transitions. Second operand 3 states. [2019-10-13 23:01:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,251 INFO L93 Difference]: Finished difference Result 449 states and 514 transitions. [2019-10-13 23:01:33,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:33,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-13 23:01:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,254 INFO L225 Difference]: With dead ends: 449 [2019-10-13 23:01:33,254 INFO L226 Difference]: Without dead ends: 426 [2019-10-13 23:01:33,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-13 23:01:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2019-10-13 23:01:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-10-13 23:01:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 478 transitions. [2019-10-13 23:01:33,288 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 478 transitions. Word has length 62 [2019-10-13 23:01:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,288 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 478 transitions. [2019-10-13 23:01:33,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 478 transitions. [2019-10-13 23:01:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 23:01:33,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:33,291 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1467463391, now seen corresponding path program 1 times [2019-10-13 23:01:33,291 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743142173] [2019-10-13 23:01:33,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:33,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743142173] [2019-10-13 23:01:33,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:33,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608752766] [2019-10-13 23:01:33,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:33,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:33,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:33,417 INFO L87 Difference]: Start difference. First operand 422 states and 478 transitions. Second operand 11 states.