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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:44,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:44,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:44,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:44,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:44,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:44,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:44,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:44,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:44,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:44,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:44,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:44,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:44,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:44,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:44,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:44,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:44,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:44,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:44,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:44,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:44,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:44,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:44,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:44,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:44,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:44,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:44,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:44,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:44,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:44,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:44,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:44,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:44,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:44,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:44,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:44,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:44,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:44,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:44,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:44,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:44,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:06:44,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:44,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:44,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:44,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:44,907 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:44,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:44,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:44,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:44,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:44,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:44,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:44,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:44,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:44,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:44,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:44,910 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:44,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:44,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:44,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:44,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:44,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:44,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:44,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:44,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:44,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:44,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:44,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:44,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:44,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:06:45,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:45,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:45,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:45,219 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:45,219 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:45,220 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-15 01:06:45,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5434f59e4/4192fb6c5c5e4aa2a6554dcc3ea2c907/FLAG25528e8a6 [2019-10-15 01:06:45,926 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:45,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-15 01:06:45,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5434f59e4/4192fb6c5c5e4aa2a6554dcc3ea2c907/FLAG25528e8a6 [2019-10-15 01:06:46,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5434f59e4/4192fb6c5c5e4aa2a6554dcc3ea2c907 [2019-10-15 01:06:46,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:46,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:46,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:46,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:46,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:46,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:46,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6bfa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46, skipping insertion in model container [2019-10-15 01:06:46,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:46,150 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:46,218 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:46,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:46,789 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:46,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:46,964 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:46,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46 WrapperNode [2019-10-15 01:06:46,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:46,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:46,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:46,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:46,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:46,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... [2019-10-15 01:06:47,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:47,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:47,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:47,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:47,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:06:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:06:47,195 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-15 01:06:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-15 01:06:47,196 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-15 01:06:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-15 01:06:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-15 01:06:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-15 01:06:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-15 01:06:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-15 01:06:47,198 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-15 01:06:47,199 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-15 01:06:47,199 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-15 01:06:47,199 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-15 01:06:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-15 01:06:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-15 01:06:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-15 01:06:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:06:47,202 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:06:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:06:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:06:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 01:06:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 01:06:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:06:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:06:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:06:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-15 01:06:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-15 01:06:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-15 01:06:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-15 01:06:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-15 01:06:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-15 01:06:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:06:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-15 01:06:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-15 01:06:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:06:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:06:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:47,774 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:47,874 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 01:06:47,874 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 01:06:47,881 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:47,924 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 01:06:47,924 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 01:06:47,956 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:47,981 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:06:47,982 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:06:48,070 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,119 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-15 01:06:48,120 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 01:06:48,120 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 01:06:48,126 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,326 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-15 01:06:48,327 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-15 01:06:48,328 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,372 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 01:06:48,372 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 01:06:48,404 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,425 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 01:06:48,425 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 01:06:48,431 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,656 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-15 01:06:48,657 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-15 01:06:48,674 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:48,679 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:48,679 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:48,698 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:48,698 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:06:48,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:48 BoogieIcfgContainer [2019-10-15 01:06:48,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:48,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:48,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:48,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:48,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:46" (1/3) ... [2019-10-15 01:06:48,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dae1a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:48, skipping insertion in model container [2019-10-15 01:06:48,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:46" (2/3) ... [2019-10-15 01:06:48,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dae1a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:48, skipping insertion in model container [2019-10-15 01:06:48,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:48" (3/3) ... [2019-10-15 01:06:48,724 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-10-15 01:06:48,733 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:48,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:48,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:48,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:48,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:48,804 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:48,804 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:48,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:48,804 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:48,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:48,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2019-10-15 01:06:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:06:48,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:48,846 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] [2019-10-15 01:06:48,848 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2019-10-15 01:06:48,861 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:48,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529164534] [2019-10-15 01:06:48,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:48,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:49,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529164534] [2019-10-15 01:06:49,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:49,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:49,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796704205] [2019-10-15 01:06:49,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:49,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:49,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:49,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:49,191 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2019-10-15 01:06:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:49,441 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2019-10-15 01:06:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:49,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:06:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:49,463 INFO L225 Difference]: With dead ends: 891 [2019-10-15 01:06:49,463 INFO L226 Difference]: Without dead ends: 509 [2019-10-15 01:06:49,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-15 01:06:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-10-15 01:06:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-15 01:06:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2019-10-15 01:06:49,617 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2019-10-15 01:06:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:49,618 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2019-10-15 01:06:49,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2019-10-15 01:06:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:06:49,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:49,619 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] [2019-10-15 01:06:49,620 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2019-10-15 01:06:49,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:49,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736835288] [2019-10-15 01:06:49,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,621 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:49,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:49,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736835288] [2019-10-15 01:06:49,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:49,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:49,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108206181] [2019-10-15 01:06:49,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:49,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:49,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:49,790 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2019-10-15 01:06:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:50,061 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2019-10-15 01:06:50,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:50,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:06:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:50,079 INFO L225 Difference]: With dead ends: 795 [2019-10-15 01:06:50,079 INFO L226 Difference]: Without dead ends: 674 [2019-10-15 01:06:50,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-15 01:06:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2019-10-15 01:06:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-15 01:06:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2019-10-15 01:06:50,162 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2019-10-15 01:06:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:50,163 INFO L462 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2019-10-15 01:06:50,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2019-10-15 01:06:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 01:06:50,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:50,171 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] [2019-10-15 01:06:50,172 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash -584641203, now seen corresponding path program 1 times [2019-10-15 01:06:50,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:50,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163480594] [2019-10-15 01:06:50,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163480594] [2019-10-15 01:06:50,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:50,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906620242] [2019-10-15 01:06:50,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:50,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,339 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2019-10-15 01:06:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:50,406 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2019-10-15 01:06:50,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:50,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 01:06:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:50,413 INFO L225 Difference]: With dead ends: 1001 [2019-10-15 01:06:50,414 INFO L226 Difference]: Without dead ends: 823 [2019-10-15 01:06:50,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-10-15 01:06:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2019-10-15 01:06:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-10-15 01:06:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2019-10-15 01:06:50,483 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2019-10-15 01:06:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:50,483 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2019-10-15 01:06:50,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2019-10-15 01:06:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:06:50,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:50,486 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] [2019-10-15 01:06:50,487 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1008074, now seen corresponding path program 1 times [2019-10-15 01:06:50,487 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:50,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840296959] [2019-10-15 01:06:50,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840296959] [2019-10-15 01:06:50,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:50,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548395796] [2019-10-15 01:06:50,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:50,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:50,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,569 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2019-10-15 01:06:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:50,785 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2019-10-15 01:06:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:50,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:06:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:50,794 INFO L225 Difference]: With dead ends: 1430 [2019-10-15 01:06:50,794 INFO L226 Difference]: Without dead ends: 1164 [2019-10-15 01:06:50,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-10-15 01:06:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2019-10-15 01:06:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-15 01:06:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2019-10-15 01:06:50,847 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2019-10-15 01:06:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:50,849 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2019-10-15 01:06:50,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2019-10-15 01:06:50,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 01:06:50,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:50,859 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] [2019-10-15 01:06:50,860 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash -269643889, now seen corresponding path program 1 times [2019-10-15 01:06:50,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:50,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583803272] [2019-10-15 01:06:50,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:50,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:50,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583803272] [2019-10-15 01:06:50,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:50,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:06:50,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208838706] [2019-10-15 01:06:50,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:06:50,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:06:50,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:50,970 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2019-10-15 01:06:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,099 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2019-10-15 01:06:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:52,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-15 01:06:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,106 INFO L225 Difference]: With dead ends: 1570 [2019-10-15 01:06:52,106 INFO L226 Difference]: Without dead ends: 990 [2019-10-15 01:06:52,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:06:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-10-15 01:06:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2019-10-15 01:06:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-10-15 01:06:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2019-10-15 01:06:52,162 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2019-10-15 01:06:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,162 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2019-10-15 01:06:52,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:06:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2019-10-15 01:06:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 01:06:52,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,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] [2019-10-15 01:06:52,165 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash 428268071, now seen corresponding path program 1 times [2019-10-15 01:06:52,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84473461] [2019-10-15 01:06:52,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84473461] [2019-10-15 01:06:52,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545376532] [2019-10-15 01:06:52,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,236 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2019-10-15 01:06:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,342 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2019-10-15 01:06:52,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 01:06:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,349 INFO L225 Difference]: With dead ends: 892 [2019-10-15 01:06:52,349 INFO L226 Difference]: Without dead ends: 888 [2019-10-15 01:06:52,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-10-15 01:06:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2019-10-15 01:06:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-15 01:06:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2019-10-15 01:06:52,404 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2019-10-15 01:06:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,405 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2019-10-15 01:06:52,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2019-10-15 01:06:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:06:52,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,407 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] [2019-10-15 01:06:52,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1410155750, now seen corresponding path program 1 times [2019-10-15 01:06:52,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296784276] [2019-10-15 01:06:52,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296784276] [2019-10-15 01:06:52,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566857718] [2019-10-15 01:06:52,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,469 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2019-10-15 01:06:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,532 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2019-10-15 01:06:52,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 01:06:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,548 INFO L225 Difference]: With dead ends: 1280 [2019-10-15 01:06:52,548 INFO L226 Difference]: Without dead ends: 1019 [2019-10-15 01:06:52,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-15 01:06:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2019-10-15 01:06:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-15 01:06:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2019-10-15 01:06:52,655 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2019-10-15 01:06:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,655 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2019-10-15 01:06:52,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2019-10-15 01:06:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:06:52,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,661 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:52,663 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2019-10-15 01:06:52,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627546795] [2019-10-15 01:06:52,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627546795] [2019-10-15 01:06:52,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275691406] [2019-10-15 01:06:52,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,737 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2019-10-15 01:06:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:52,810 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2019-10-15 01:06:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:52,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 01:06:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:52,825 INFO L225 Difference]: With dead ends: 976 [2019-10-15 01:06:52,826 INFO L226 Difference]: Without dead ends: 956 [2019-10-15 01:06:52,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-10-15 01:06:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2019-10-15 01:06:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-10-15 01:06:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2019-10-15 01:06:52,885 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2019-10-15 01:06:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:52,887 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2019-10-15 01:06:52,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2019-10-15 01:06:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:06:52,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:52,891 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] [2019-10-15 01:06:52,891 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash -539598420, now seen corresponding path program 1 times [2019-10-15 01:06:52,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:52,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334132568] [2019-10-15 01:06:52,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:52,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:52,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334132568] [2019-10-15 01:06:52,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:52,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:52,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693832076] [2019-10-15 01:06:52,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:52,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:52,962 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2019-10-15 01:06:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,023 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2019-10-15 01:06:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:53,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:06:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,030 INFO L225 Difference]: With dead ends: 1175 [2019-10-15 01:06:53,030 INFO L226 Difference]: Without dead ends: 933 [2019-10-15 01:06:53,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-10-15 01:06:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2019-10-15 01:06:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-10-15 01:06:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2019-10-15 01:06:53,098 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2019-10-15 01:06:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,099 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2019-10-15 01:06:53,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2019-10-15 01:06:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:06:53,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:53,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1793960754, now seen corresponding path program 1 times [2019-10-15 01:06:53,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408858719] [2019-10-15 01:06:53,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408858719] [2019-10-15 01:06:53,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:06:53,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140246013] [2019-10-15 01:06:53,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:06:53,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:06:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:53,188 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2019-10-15 01:06:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,648 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2019-10-15 01:06:53,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:06:53,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 01:06:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,654 INFO L225 Difference]: With dead ends: 1022 [2019-10-15 01:06:53,654 INFO L226 Difference]: Without dead ends: 793 [2019-10-15 01:06:53,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-15 01:06:53,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2019-10-15 01:06:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-15 01:06:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2019-10-15 01:06:53,699 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2019-10-15 01:06:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,699 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2019-10-15 01:06:53,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:06:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2019-10-15 01:06:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:06:53,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,702 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:53,702 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,703 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2019-10-15 01:06:53,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062392623] [2019-10-15 01:06:53,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062392623] [2019-10-15 01:06:53,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:53,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751963872] [2019-10-15 01:06:53,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:53,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,745 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2019-10-15 01:06:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:53,789 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2019-10-15 01:06:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:53,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 01:06:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:53,794 INFO L225 Difference]: With dead ends: 879 [2019-10-15 01:06:53,794 INFO L226 Difference]: Without dead ends: 783 [2019-10-15 01:06:53,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-15 01:06:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2019-10-15 01:06:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-15 01:06:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2019-10-15 01:06:53,839 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2019-10-15 01:06:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:53,840 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2019-10-15 01:06:53,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2019-10-15 01:06:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:06:53,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:53,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:53,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2019-10-15 01:06:53,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:53,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757117335] [2019-10-15 01:06:53,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:53,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:53,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757117335] [2019-10-15 01:06:53,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:53,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:53,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757424152] [2019-10-15 01:06:53,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:53,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:53,887 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2019-10-15 01:06:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,015 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2019-10-15 01:06:54,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:54,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-15 01:06:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,022 INFO L225 Difference]: With dead ends: 957 [2019-10-15 01:06:54,022 INFO L226 Difference]: Without dead ends: 943 [2019-10-15 01:06:54,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-15 01:06:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2019-10-15 01:06:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-15 01:06:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2019-10-15 01:06:54,090 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2019-10-15 01:06:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2019-10-15 01:06:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2019-10-15 01:06:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:06:54,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,094 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:54,095 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2019-10-15 01:06:54,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343437977] [2019-10-15 01:06:54,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343437977] [2019-10-15 01:06:54,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:06:54,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207118086] [2019-10-15 01:06:54,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:54,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:54,182 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2019-10-15 01:06:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,357 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2019-10-15 01:06:54,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:06:54,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:06:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,363 INFO L225 Difference]: With dead ends: 863 [2019-10-15 01:06:54,363 INFO L226 Difference]: Without dead ends: 859 [2019-10-15 01:06:54,364 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-15 01:06:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-10-15 01:06:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2019-10-15 01:06:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-15 01:06:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2019-10-15 01:06:54,459 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2019-10-15 01:06:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,460 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2019-10-15 01:06:54,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2019-10-15 01:06:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:06:54,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:54,464 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2019-10-15 01:06:54,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351797983] [2019-10-15 01:06:54,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351797983] [2019-10-15 01:06:54,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:06:54,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911307524] [2019-10-15 01:06:54,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:06:54,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:06:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:54,574 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2019-10-15 01:06:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,711 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2019-10-15 01:06:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:06:54,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:06:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,717 INFO L225 Difference]: With dead ends: 898 [2019-10-15 01:06:54,717 INFO L226 Difference]: Without dead ends: 877 [2019-10-15 01:06:54,719 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-15 01:06:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-10-15 01:06:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2019-10-15 01:06:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-15 01:06:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2019-10-15 01:06:54,770 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2019-10-15 01:06:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,770 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2019-10-15 01:06:54,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:06:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2019-10-15 01:06:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:54,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:54,776 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2019-10-15 01:06:54,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92791465] [2019-10-15 01:06:54,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:54,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92791465] [2019-10-15 01:06:54,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:54,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:06:54,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495708907] [2019-10-15 01:06:54,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:06:54,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:06:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:06:54,817 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2019-10-15 01:06:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:54,878 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2019-10-15 01:06:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:06:54,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-15 01:06:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:54,883 INFO L225 Difference]: With dead ends: 901 [2019-10-15 01:06:54,884 INFO L226 Difference]: Without dead ends: 879 [2019-10-15 01:06:54,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-10-15 01:06:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2019-10-15 01:06:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-15 01:06:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2019-10-15 01:06:54,938 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2019-10-15 01:06:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:54,938 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2019-10-15 01:06:54,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:06:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2019-10-15 01:06:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:54,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:54,941 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:54,941 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:54,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2019-10-15 01:06:54,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:54,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417322586] [2019-10-15 01:06:54,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:54,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:55,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417322586] [2019-10-15 01:06:55,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:55,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:06:55,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145416829] [2019-10-15 01:06:55,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:06:55,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:06:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:06:55,019 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2019-10-15 01:06:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:56,275 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2019-10-15 01:06:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:06:56,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-15 01:06:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:56,282 INFO L225 Difference]: With dead ends: 1088 [2019-10-15 01:06:56,283 INFO L226 Difference]: Without dead ends: 997 [2019-10-15 01:06:56,284 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-15 01:06:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-10-15 01:06:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2019-10-15 01:06:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-15 01:06:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2019-10-15 01:06:56,339 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2019-10-15 01:06:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:56,340 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2019-10-15 01:06:56,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:06:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2019-10-15 01:06:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:56,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,343 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,343 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2019-10-15 01:06:56,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437462672] [2019-10-15 01:06:56,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:56,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437462672] [2019-10-15 01:06:56,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:56,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:56,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9472783] [2019-10-15 01:06:56,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:56,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:56,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,391 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2019-10-15 01:06:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:56,533 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2019-10-15 01:06:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 01:06:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:56,540 INFO L225 Difference]: With dead ends: 1038 [2019-10-15 01:06:56,541 INFO L226 Difference]: Without dead ends: 998 [2019-10-15 01:06:56,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-10-15 01:06:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2019-10-15 01:06:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-10-15 01:06:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2019-10-15 01:06:56,616 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2019-10-15 01:06:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:56,617 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2019-10-15 01:06:56,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2019-10-15 01:06:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:06:56,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,621 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2019-10-15 01:06:56,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520343383] [2019-10-15 01:06:56,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:56,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520343383] [2019-10-15 01:06:56,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:56,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:06:56,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875889789] [2019-10-15 01:06:56,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:06:56,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:06:56,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:56,901 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 15 states. [2019-10-15 01:07:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:00,472 INFO L93 Difference]: Finished difference Result 1077 states and 1501 transitions. [2019-10-15 01:07:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:07:00,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-10-15 01:07:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:00,478 INFO L225 Difference]: With dead ends: 1077 [2019-10-15 01:07:00,479 INFO L226 Difference]: Without dead ends: 1056 [2019-10-15 01:07:00,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:07:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-15 01:07:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 891. [2019-10-15 01:07:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-10-15 01:07:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1202 transitions. [2019-10-15 01:07:00,533 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1202 transitions. Word has length 50 [2019-10-15 01:07:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:00,533 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1202 transitions. [2019-10-15 01:07:00,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1202 transitions. [2019-10-15 01:07:00,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:00,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:00,542 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:00,542 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -120624203, now seen corresponding path program 1 times [2019-10-15 01:07:00,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:00,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516960063] [2019-10-15 01:07:00,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:00,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516960063] [2019-10-15 01:07:00,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:00,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:00,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388790764] [2019-10-15 01:07:00,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:00,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:00,659 INFO L87 Difference]: Start difference. First operand 891 states and 1202 transitions. Second operand 10 states. [2019-10-15 01:07:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,269 INFO L93 Difference]: Finished difference Result 1165 states and 1621 transitions. [2019-10-15 01:07:03,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:03,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-15 01:07:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,275 INFO L225 Difference]: With dead ends: 1165 [2019-10-15 01:07:03,276 INFO L226 Difference]: Without dead ends: 1144 [2019-10-15 01:07:03,277 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-15 01:07:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-10-15 01:07:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 895. [2019-10-15 01:07:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-15 01:07:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1204 transitions. [2019-10-15 01:07:03,329 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1204 transitions. Word has length 50 [2019-10-15 01:07:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,330 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1204 transitions. [2019-10-15 01:07:03,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1204 transitions. [2019-10-15 01:07:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:03,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,336 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] [2019-10-15 01:07:03,337 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2019-10-15 01:07:03,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917592774] [2019-10-15 01:07:03,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917592774] [2019-10-15 01:07:03,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569450649] [2019-10-15 01:07:03,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,390 INFO L87 Difference]: Start difference. First operand 895 states and 1204 transitions. Second operand 3 states. [2019-10-15 01:07:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,488 INFO L93 Difference]: Finished difference Result 923 states and 1236 transitions. [2019-10-15 01:07:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 01:07:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,496 INFO L225 Difference]: With dead ends: 923 [2019-10-15 01:07:03,496 INFO L226 Difference]: Without dead ends: 918 [2019-10-15 01:07:03,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-10-15 01:07:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2019-10-15 01:07:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-10-15 01:07:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1225 transitions. [2019-10-15 01:07:03,560 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1225 transitions. Word has length 52 [2019-10-15 01:07:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,561 INFO L462 AbstractCegarLoop]: Abstraction has 912 states and 1225 transitions. [2019-10-15 01:07:03,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1225 transitions. [2019-10-15 01:07:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:03,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,567 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2019-10-15 01:07:03,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141687830] [2019-10-15 01:07:03,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141687830] [2019-10-15 01:07:03,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741945828] [2019-10-15 01:07:03,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,622 INFO L87 Difference]: Start difference. First operand 912 states and 1225 transitions. Second operand 3 states. [2019-10-15 01:07:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,710 INFO L93 Difference]: Finished difference Result 1128 states and 1513 transitions. [2019-10-15 01:07:03,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:07:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,716 INFO L225 Difference]: With dead ends: 1128 [2019-10-15 01:07:03,717 INFO L226 Difference]: Without dead ends: 881 [2019-10-15 01:07:03,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-15 01:07:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-15 01:07:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2019-10-15 01:07:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-10-15 01:07:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1185 transitions. [2019-10-15 01:07:03,770 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1185 transitions. Word has length 54 [2019-10-15 01:07:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,771 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1185 transitions. [2019-10-15 01:07:03,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1185 transitions. [2019-10-15 01:07:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:03,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,775 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,775 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2019-10-15 01:07:03,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227270783] [2019-10-15 01:07:03,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227270783] [2019-10-15 01:07:03,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:07:03,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513738413] [2019-10-15 01:07:03,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:07:03,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:07:03,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:03,915 INFO L87 Difference]: Start difference. First operand 881 states and 1185 transitions. Second operand 13 states. [2019-10-15 01:07:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,829 INFO L93 Difference]: Finished difference Result 918 states and 1226 transitions. [2019-10-15 01:07:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:07:05,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-10-15 01:07:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,836 INFO L225 Difference]: With dead ends: 918 [2019-10-15 01:07:05,836 INFO L226 Difference]: Without dead ends: 912 [2019-10-15 01:07:05,838 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-15 01:07:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-10-15 01:07:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 881. [2019-10-15 01:07:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-10-15 01:07:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1184 transitions. [2019-10-15 01:07:05,888 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1184 transitions. Word has length 53 [2019-10-15 01:07:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,890 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1184 transitions. [2019-10-15 01:07:05,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:07:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1184 transitions. [2019-10-15 01:07:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:05,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:05,894 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1853675269, now seen corresponding path program 1 times [2019-10-15 01:07:05,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078302322] [2019-10-15 01:07:05,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:06,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078302322] [2019-10-15 01:07:06,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:06,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:06,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279816997] [2019-10-15 01:07:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:06,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:06,010 INFO L87 Difference]: Start difference. First operand 881 states and 1184 transitions. Second operand 10 states. [2019-10-15 01:07:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,437 INFO L93 Difference]: Finished difference Result 1138 states and 1584 transitions. [2019-10-15 01:07:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:08,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-15 01:07:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,444 INFO L225 Difference]: With dead ends: 1138 [2019-10-15 01:07:08,444 INFO L226 Difference]: Without dead ends: 1132 [2019-10-15 01:07:08,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 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-15 01:07:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2019-10-15 01:07:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 881. [2019-10-15 01:07:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-10-15 01:07:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1183 transitions. [2019-10-15 01:07:08,503 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1183 transitions. Word has length 53 [2019-10-15 01:07:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,503 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1183 transitions. [2019-10-15 01:07:08,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1183 transitions. [2019-10-15 01:07:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:08,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,507 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] [2019-10-15 01:07:08,507 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2019-10-15 01:07:08,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434627395] [2019-10-15 01:07:08,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434627395] [2019-10-15 01:07:08,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:08,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636312822] [2019-10-15 01:07:08,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:08,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:08,612 INFO L87 Difference]: Start difference. First operand 881 states and 1183 transitions. Second operand 11 states. [2019-10-15 01:07:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,858 INFO L93 Difference]: Finished difference Result 904 states and 1207 transitions. [2019-10-15 01:07:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:09,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-15 01:07:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,864 INFO L225 Difference]: With dead ends: 904 [2019-10-15 01:07:09,864 INFO L226 Difference]: Without dead ends: 880 [2019-10-15 01:07:09,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-10-15 01:07:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2019-10-15 01:07:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-15 01:07:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1181 transitions. [2019-10-15 01:07:09,916 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1181 transitions. Word has length 52 [2019-10-15 01:07:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,917 INFO L462 AbstractCegarLoop]: Abstraction has 880 states and 1181 transitions. [2019-10-15 01:07:09,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1181 transitions. [2019-10-15 01:07:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:09,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,920 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] [2019-10-15 01:07:09,920 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2080253382, now seen corresponding path program 1 times [2019-10-15 01:07:09,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734163432] [2019-10-15 01:07:09,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:09,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734163432] [2019-10-15 01:07:09,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:09,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051904480] [2019-10-15 01:07:09,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:09,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:09,972 INFO L87 Difference]: Start difference. First operand 880 states and 1181 transitions. Second operand 5 states. [2019-10-15 01:07:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,581 INFO L93 Difference]: Finished difference Result 895 states and 1196 transitions. [2019-10-15 01:07:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:10,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-15 01:07:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,585 INFO L225 Difference]: With dead ends: 895 [2019-10-15 01:07:10,586 INFO L226 Difference]: Without dead ends: 860 [2019-10-15 01:07:10,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-15 01:07:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 852. [2019-10-15 01:07:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-10-15 01:07:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1151 transitions. [2019-10-15 01:07:10,633 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1151 transitions. Word has length 52 [2019-10-15 01:07:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,634 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1151 transitions. [2019-10-15 01:07:10,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1151 transitions. [2019-10-15 01:07:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:10,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,637 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:10,637 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2019-10-15 01:07:10,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321959023] [2019-10-15 01:07:10,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321959023] [2019-10-15 01:07:10,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:07:10,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911714455] [2019-10-15 01:07:10,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:07:10,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:07:10,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:10,786 INFO L87 Difference]: Start difference. First operand 852 states and 1151 transitions. Second operand 13 states. [2019-10-15 01:07:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,600 INFO L93 Difference]: Finished difference Result 887 states and 1189 transitions. [2019-10-15 01:07:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:07:12,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-10-15 01:07:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,607 INFO L225 Difference]: With dead ends: 887 [2019-10-15 01:07:12,607 INFO L226 Difference]: Without dead ends: 881 [2019-10-15 01:07:12,608 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-15 01:07:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-15 01:07:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 852. [2019-10-15 01:07:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-10-15 01:07:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-10-15 01:07:12,695 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 54 [2019-10-15 01:07:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,695 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-10-15 01:07:12,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:07:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-10-15 01:07:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:12,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,699 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,699 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1485113554, now seen corresponding path program 1 times [2019-10-15 01:07:12,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764162245] [2019-10-15 01:07:12,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764162245] [2019-10-15 01:07:12,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:12,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406718170] [2019-10-15 01:07:12,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:12,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:12,798 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 9 states. [2019-10-15 01:07:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:14,714 INFO L93 Difference]: Finished difference Result 1157 states and 1604 transitions. [2019-10-15 01:07:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:14,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:07:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:14,720 INFO L225 Difference]: With dead ends: 1157 [2019-10-15 01:07:14,721 INFO L226 Difference]: Without dead ends: 1107 [2019-10-15 01:07:14,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-10-15 01:07:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 861. [2019-10-15 01:07:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-10-15 01:07:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2019-10-15 01:07:14,776 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 55 [2019-10-15 01:07:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:14,777 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2019-10-15 01:07:14,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2019-10-15 01:07:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:14,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:14,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:14,780 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2019-10-15 01:07:14,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:14,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963873396] [2019-10-15 01:07:14,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:14,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,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-15 01:07:14,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963873396] [2019-10-15 01:07:14,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:14,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448360001] [2019-10-15 01:07:14,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:14,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:14,858 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2019-10-15 01:07:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,051 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2019-10-15 01:07:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:15,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:07:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,057 INFO L225 Difference]: With dead ends: 888 [2019-10-15 01:07:15,057 INFO L226 Difference]: Without dead ends: 852 [2019-10-15 01:07:15,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-10-15 01:07:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2019-10-15 01:07:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-10-15 01:07:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2019-10-15 01:07:15,115 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2019-10-15 01:07:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,115 INFO L462 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2019-10-15 01:07:15,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2019-10-15 01:07:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:15,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,119 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,119 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,119 INFO L82 PathProgramCache]: Analyzing trace with hash 100740086, now seen corresponding path program 1 times [2019-10-15 01:07:15,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482483471] [2019-10-15 01:07:15,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,120 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482483471] [2019-10-15 01:07:15,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:15,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861310843] [2019-10-15 01:07:15,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:15,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:15,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:15,291 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2019-10-15 01:07:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,536 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2019-10-15 01:07:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:15,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 01:07:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,541 INFO L225 Difference]: With dead ends: 868 [2019-10-15 01:07:15,541 INFO L226 Difference]: Without dead ends: 850 [2019-10-15 01:07:15,542 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-15 01:07:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-15 01:07:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2019-10-15 01:07:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-15 01:07:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2019-10-15 01:07:15,593 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 55 [2019-10-15 01:07:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,593 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2019-10-15 01:07:15,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2019-10-15 01:07:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:15,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,596 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,596 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2119637056, now seen corresponding path program 1 times [2019-10-15 01:07:15,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195406136] [2019-10-15 01:07:15,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:15,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195406136] [2019-10-15 01:07:15,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:15,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:15,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792487403] [2019-10-15 01:07:15,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:15,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:15,733 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2019-10-15 01:07:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,975 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2019-10-15 01:07:15,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:15,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-15 01:07:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,979 INFO L225 Difference]: With dead ends: 863 [2019-10-15 01:07:15,980 INFO L226 Difference]: Without dead ends: 845 [2019-10-15 01:07:15,980 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-15 01:07:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-15 01:07:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2019-10-15 01:07:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-15 01:07:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2019-10-15 01:07:16,035 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 56 [2019-10-15 01:07:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,035 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2019-10-15 01:07:16,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2019-10-15 01:07:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 01:07:16,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,039 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, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,039 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash 463394390, now seen corresponding path program 1 times [2019-10-15 01:07:16,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327338176] [2019-10-15 01:07:16,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327338176] [2019-10-15 01:07:16,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:16,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594032511] [2019-10-15 01:07:16,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:16,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:16,094 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 3 states. [2019-10-15 01:07:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,153 INFO L93 Difference]: Finished difference Result 1098 states and 1473 transitions. [2019-10-15 01:07:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:16,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-15 01:07:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,157 INFO L225 Difference]: With dead ends: 1098 [2019-10-15 01:07:16,158 INFO L226 Difference]: Without dead ends: 935 [2019-10-15 01:07:16,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-10-15 01:07:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 904. [2019-10-15 01:07:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-15 01:07:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2019-10-15 01:07:16,217 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 74 [2019-10-15 01:07:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2019-10-15 01:07:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2019-10-15 01:07:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:16,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,223 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -534409564, now seen corresponding path program 1 times [2019-10-15 01:07:16,223 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348813436] [2019-10-15 01:07:16,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348813436] [2019-10-15 01:07:16,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:07:16,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281686728] [2019-10-15 01:07:16,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:07:16,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:07:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:16,413 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand 12 states. [2019-10-15 01:07:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,699 INFO L93 Difference]: Finished difference Result 930 states and 1243 transitions. [2019-10-15 01:07:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:07:16,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-15 01:07:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,704 INFO L225 Difference]: With dead ends: 930 [2019-10-15 01:07:16,704 INFO L226 Difference]: Without dead ends: 905 [2019-10-15 01:07:16,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:07:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-15 01:07:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2019-10-15 01:07:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-10-15 01:07:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1204 transitions. [2019-10-15 01:07:16,757 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1204 transitions. Word has length 59 [2019-10-15 01:07:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,758 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1204 transitions. [2019-10-15 01:07:16,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:07:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1204 transitions. [2019-10-15 01:07:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:07:16,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:16,761 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2019-10-15 01:07:16,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710389397] [2019-10-15 01:07:16,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710389397] [2019-10-15 01:07:16,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:16,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834767464] [2019-10-15 01:07:16,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:16,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:16,911 INFO L87 Difference]: Start difference. First operand 903 states and 1204 transitions. Second operand 11 states. [2019-10-15 01:07:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,220 INFO L93 Difference]: Finished difference Result 920 states and 1222 transitions. [2019-10-15 01:07:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:17,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-10-15 01:07:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,224 INFO L225 Difference]: With dead ends: 920 [2019-10-15 01:07:17,224 INFO L226 Difference]: Without dead ends: 900 [2019-10-15 01:07:17,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-15 01:07:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2019-10-15 01:07:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-10-15 01:07:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1199 transitions. [2019-10-15 01:07:17,275 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1199 transitions. Word has length 58 [2019-10-15 01:07:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,275 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1199 transitions. [2019-10-15 01:07:17,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1199 transitions. [2019-10-15 01:07:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:07:17,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:17,279 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,279 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2019-10-15 01:07:17,279 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930417875] [2019-10-15 01:07:17,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:17,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930417875] [2019-10-15 01:07:17,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:17,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900193212] [2019-10-15 01:07:17,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:17,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:17,376 INFO L87 Difference]: Start difference. First operand 900 states and 1199 transitions. Second operand 10 states. [2019-10-15 01:07:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,674 INFO L93 Difference]: Finished difference Result 967 states and 1274 transitions. [2019-10-15 01:07:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:17,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-10-15 01:07:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,678 INFO L225 Difference]: With dead ends: 967 [2019-10-15 01:07:17,679 INFO L226 Difference]: Without dead ends: 858 [2019-10-15 01:07:17,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-10-15 01:07:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 855. [2019-10-15 01:07:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-10-15 01:07:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1118 transitions. [2019-10-15 01:07:17,732 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1118 transitions. Word has length 59 [2019-10-15 01:07:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,732 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1118 transitions. [2019-10-15 01:07:17,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1118 transitions. [2019-10-15 01:07:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:17,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,735 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-15 01:07:17,735 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2019-10-15 01:07:17,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158194057] [2019-10-15 01:07:17,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:17,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158194057] [2019-10-15 01:07:17,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:17,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120120538] [2019-10-15 01:07:17,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:17,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:17,775 INFO L87 Difference]: Start difference. First operand 855 states and 1118 transitions. Second operand 4 states. [2019-10-15 01:07:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,915 INFO L93 Difference]: Finished difference Result 1012 states and 1336 transitions. [2019-10-15 01:07:17,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:17,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-15 01:07:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,919 INFO L225 Difference]: With dead ends: 1012 [2019-10-15 01:07:17,919 INFO L226 Difference]: Without dead ends: 904 [2019-10-15 01:07:17,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-15 01:07:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 862. [2019-10-15 01:07:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-15 01:07:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1133 transitions. [2019-10-15 01:07:17,973 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1133 transitions. Word has length 60 [2019-10-15 01:07:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,973 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1133 transitions. [2019-10-15 01:07:17,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1133 transitions. [2019-10-15 01:07:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:17,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,977 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-15 01:07:17,977 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2019-10-15 01:07:17,978 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964949768] [2019-10-15 01:07:17,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat