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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:38:13,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:38:13,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:38:13,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:38:13,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:38:13,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:38:13,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:38:13,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:38:13,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:38:13,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:38:13,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:38:13,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:38:13,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:38:13,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:38:13,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:38:13,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:38:13,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:38:13,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:38:13,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:38:13,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:38:13,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:38:13,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:38:13,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:38:13,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:38:13,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:38:13,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:38:13,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:38:13,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:38:13,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:38:13,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:38:13,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:38:13,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:38:13,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:38:13,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:38:13,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:38:13,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:38:13,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:38:13,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:38:13,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:38:13,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:38:13,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:38:13,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:38:13,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:38:13,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:38:13,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:38:13,270 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:38:13,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:38:13,270 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:38:13,271 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:38:13,271 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:38:13,271 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:38:13,271 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:38:13,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:38:13,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:38:13,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:38:13,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:38:13,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:38:13,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:38:13,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:38:13,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:38:13,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:38:13,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:38:13,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:38:13,275 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:38:13,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:38:13,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:13,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:38:13,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:38:13,276 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:38:13,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:38:13,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:38:13,278 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:38:13,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:38:13,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:38:13,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:38:13,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:38:13,352 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:38:13,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2019-10-03 02:38:13,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c101b2e/b5402e815f914dc9bff92455448264f8/FLAGec2631fe7 [2019-10-03 02:38:14,273 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:38:14,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2019-10-03 02:38:14,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c101b2e/b5402e815f914dc9bff92455448264f8/FLAGec2631fe7 [2019-10-03 02:38:14,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c101b2e/b5402e815f914dc9bff92455448264f8 [2019-10-03 02:38:14,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:38:14,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:38:14,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:14,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:38:14,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:38:14,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:14" (1/1) ... [2019-10-03 02:38:14,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f428b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:14, skipping insertion in model container [2019-10-03 02:38:14,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:14" (1/1) ... [2019-10-03 02:38:14,790 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:38:14,952 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:38:16,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:16,520 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:38:17,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:17,112 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:38:17,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17 WrapperNode [2019-10-03 02:38:17,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:17,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:38:17,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:38:17,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:38:17,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (1/1) ... [2019-10-03 02:38:17,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:38:17,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:38:17,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:38:17,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:38:17,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (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-03 02:38:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:38:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:38:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2019-10-03 02:38:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-03 02:38:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-03 02:38:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2019-10-03 02:38:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-03 02:38:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:38:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:38:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-03 02:38:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2019-10-03 02:38:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-03 02:38:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-03 02:38:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-03 02:38:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-03 02:38:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2019-10-03 02:38:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2019-10-03 02:38:17,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-03 02:38:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-03 02:38:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-03 02:38:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2019-10-03 02:38:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2019-10-03 02:38:17,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2019-10-03 02:38:17,836 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2019-10-03 02:38:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2019-10-03 02:38:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-03 02:38:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-03 02:38:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-03 02:38:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-03 02:38:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-03 02:38:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-03 02:38:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-03 02:38:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-03 02:38:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-03 02:38:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:38:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:38:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2019-10-03 02:38:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-03 02:38:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-03 02:38:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-03 02:38:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-03 02:38:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-03 02:38:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-03 02:38:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-03 02:38:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-03 02:38:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-03 02:38:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-03 02:38:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:38:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-03 02:38:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-03 02:38:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-03 02:38:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-03 02:38:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-03 02:38:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-03 02:38:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-03 02:38:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-03 02:38:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-03 02:38:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-03 02:38:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-03 02:38:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-03 02:38:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-03 02:38:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:38:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:38:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:38:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-03 02:38:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-03 02:38:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-03 02:38:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-03 02:38:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-03 02:38:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-03 02:38:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-03 02:38:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:38:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:38:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-03 02:38:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-03 02:38:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-03 02:38:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-03 02:38:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-03 02:38:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-03 02:38:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-03 02:38:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-03 02:38:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-03 02:38:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-03 02:38:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-03 02:38:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-03 02:38:17,854 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-03 02:38:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-03 02:38:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-03 02:38:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-03 02:38:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-03 02:38:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-03 02:38:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-03 02:38:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-03 02:38:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-03 02:38:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 02:38:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-03 02:38:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:38:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:38:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:38:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:38:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:38:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:38:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-03 02:38:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-03 02:38:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-03 02:38:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-03 02:38:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-03 02:38:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-03 02:38:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-03 02:38:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-03 02:38:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-03 02:38:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:38:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:38:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-03 02:38:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-03 02:38:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:38:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-03 02:38:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-03 02:38:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-03 02:38:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:38:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-03 02:38:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-03 02:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-03 02:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-03 02:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-03 02:38:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-03 02:38:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-03 02:38:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-03 02:38:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2019-10-03 02:38:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-03 02:38:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-03 02:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-03 02:38:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-03 02:38:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-03 02:38:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-03 02:38:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-03 02:38:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:38:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:38:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:38:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-03 02:38:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-03 02:38:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-03 02:38:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-03 02:38:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-03 02:38:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-03 02:38:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-03 02:38:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-03 02:38:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-03 02:38:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-03 02:38:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-03 02:38:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-03 02:38:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-03 02:38:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-03 02:38:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:38:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:38:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-03 02:38:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2019-10-03 02:38:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-03 02:38:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-03 02:38:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-03 02:38:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2019-10-03 02:38:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2019-10-03 02:38:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2019-10-03 02:38:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2019-10-03 02:38:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2019-10-03 02:38:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2019-10-03 02:38:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-03 02:38:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-03 02:38:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-03 02:38:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-03 02:38:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-03 02:38:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:38:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:38:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-03 02:38:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-03 02:38:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-03 02:38:19,518 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:19,584 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:19,584 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:19,585 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:19,597 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:19,597 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:19,610 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:19,622 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:19,623 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:19,623 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:19,642 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:19,642 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:19,645 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:33,630 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-03 02:38:33,631 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-03 02:38:33,653 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:33,666 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:33,666 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:33,666 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:33,686 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:33,687 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:33,687 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:33,702 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:33,702 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:33,702 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:33,726 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:33,727 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:33,733 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,077 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-03 02:38:55,077 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-03 02:38:55,091 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,323 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2019-10-03 02:38:55,323 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2019-10-03 02:38:55,335 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,344 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:55,345 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:55,345 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,383 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-03 02:38:55,383 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-03 02:38:55,384 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,403 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:55,404 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:55,404 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,415 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:55,416 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:55,437 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,447 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:55,447 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:55,447 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:55,455 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:55,455 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:03,411 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:09,674 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-03 02:39:09,675 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-03 02:39:09,689 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:21,541 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-03 02:39:21,542 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-03 02:39:21,552 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:21,597 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-03 02:39:21,598 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-03 02:39:21,714 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:21,727 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:21,728 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:21,797 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:21,931 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-03 02:39:21,931 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-03 02:39:22,086 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:22,098 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:22,098 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:22,227 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:22,240 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:22,240 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:22,243 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:32,504 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-03 02:39:32,505 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-03 02:39:32,515 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:32,558 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:39:32,558 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:39:32,568 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:32,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:39:32,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:39:32,667 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:32,676 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:32,676 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:32,803 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:35,009 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-03 02:39:35,010 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L3707: #res := 0; [2019-10-03 02:39:35,010 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-03 02:39:35,010 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:35,021 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:35,021 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:37,255 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:50,973 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-03 02:39:50,973 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-03 02:39:55,729 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:55,730 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-03 02:39:55,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:55 BoogieIcfgContainer [2019-10-03 02:39:55,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:55,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:55,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:55,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:55,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:38:14" (1/3) ... [2019-10-03 02:39:55,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21683ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:55, skipping insertion in model container [2019-10-03 02:39:55,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:17" (2/3) ... [2019-10-03 02:39:55,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21683ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:55, skipping insertion in model container [2019-10-03 02:39:55,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:55" (3/3) ... [2019-10-03 02:39:55,740 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2019-10-03 02:39:55,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:55,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:55,774 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:55,797 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:55,797 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:55,798 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:55,798 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:55,798 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:55,798 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:55,798 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:55,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states. [2019-10-03 02:39:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:39:55,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:55,854 INFO L411 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-03 02:39:55,856 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1015863504, now seen corresponding path program 1 times [2019-10-03 02:39:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:56,387 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-03 02:39:56,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:56,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:56,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:56,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:56,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:56,411 INFO L87 Difference]: Start difference. First operand 1245 states. Second operand 3 states. [2019-10-03 02:39:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:56,683 INFO L93 Difference]: Finished difference Result 679 states and 998 transitions. [2019-10-03 02:39:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:56,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:39:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:56,720 INFO L225 Difference]: With dead ends: 679 [2019-10-03 02:39:56,720 INFO L226 Difference]: Without dead ends: 663 [2019-10-03 02:39:56,722 INFO L640 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-03 02:39:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-03 02:39:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-03 02:39:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-03 02:39:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 970 transitions. [2019-10-03 02:39:56,816 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 970 transitions. Word has length 20 [2019-10-03 02:39:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:56,816 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 970 transitions. [2019-10-03 02:39:56,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 970 transitions. [2019-10-03 02:39:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:39:56,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:56,818 INFO L411 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-03 02:39:56,818 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash -720536967, now seen corresponding path program 1 times [2019-10-03 02:39:56,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:56,975 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-03 02:39:56,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:56,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:56,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:56,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:56,978 INFO L87 Difference]: Start difference. First operand 663 states and 970 transitions. Second operand 3 states. [2019-10-03 02:39:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:57,375 INFO L93 Difference]: Finished difference Result 979 states and 1414 transitions. [2019-10-03 02:39:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:57,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:39:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:57,397 INFO L225 Difference]: With dead ends: 979 [2019-10-03 02:39:57,397 INFO L226 Difference]: Without dead ends: 978 [2019-10-03 02:39:57,398 INFO L640 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-03 02:39:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-03 02:39:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 958. [2019-10-03 02:39:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-10-03 02:39:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1388 transitions. [2019-10-03 02:39:57,513 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1388 transitions. Word has length 25 [2019-10-03 02:39:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:57,513 INFO L475 AbstractCegarLoop]: Abstraction has 958 states and 1388 transitions. [2019-10-03 02:39:57,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1388 transitions. [2019-10-03 02:39:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:39:57,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:57,525 INFO L411 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-03 02:39:57,525 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1363238634, now seen corresponding path program 1 times [2019-10-03 02:39:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:57,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:57,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:57,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:57,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:57,798 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-03 02:39:57,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:57,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:57,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:57,800 INFO L87 Difference]: Start difference. First operand 958 states and 1388 transitions. Second operand 3 states. [2019-10-03 02:39:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:58,102 INFO L93 Difference]: Finished difference Result 1572 states and 2326 transitions. [2019-10-03 02:39:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:58,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:39:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:58,116 INFO L225 Difference]: With dead ends: 1572 [2019-10-03 02:39:58,116 INFO L226 Difference]: Without dead ends: 1572 [2019-10-03 02:39:58,117 INFO L640 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-03 02:39:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-10-03 02:39:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1129. [2019-10-03 02:39:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-03 02:39:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1663 transitions. [2019-10-03 02:39:58,173 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1663 transitions. Word has length 32 [2019-10-03 02:39:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:58,173 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1663 transitions. [2019-10-03 02:39:58,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1663 transitions. [2019-10-03 02:39:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:39:58,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:58,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:58,175 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1807054450, now seen corresponding path program 1 times [2019-10-03 02:39:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:58,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:58,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:58,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:58,308 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-03 02:39:58,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:58,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:58,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:58,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:58,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:58,310 INFO L87 Difference]: Start difference. First operand 1129 states and 1663 transitions. Second operand 3 states. [2019-10-03 02:39:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:58,372 INFO L93 Difference]: Finished difference Result 1700 states and 2473 transitions. [2019-10-03 02:39:58,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:58,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:39:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:58,383 INFO L225 Difference]: With dead ends: 1700 [2019-10-03 02:39:58,384 INFO L226 Difference]: Without dead ends: 1700 [2019-10-03 02:39:58,384 INFO L640 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-03 02:39:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-10-03 02:39:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1612. [2019-10-03 02:39:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-10-03 02:39:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2367 transitions. [2019-10-03 02:39:58,442 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2367 transitions. Word has length 34 [2019-10-03 02:39:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:58,443 INFO L475 AbstractCegarLoop]: Abstraction has 1612 states and 2367 transitions. [2019-10-03 02:39:58,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2367 transitions. [2019-10-03 02:39:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:39:58,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:58,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:58,445 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -927541524, now seen corresponding path program 1 times [2019-10-03 02:39:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:58,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:58,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:58,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:58,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:39:58,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:58,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:39:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:39:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:58,787 INFO L87 Difference]: Start difference. First operand 1612 states and 2367 transitions. Second operand 5 states. [2019-10-03 02:40:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:00,465 INFO L93 Difference]: Finished difference Result 1624 states and 2376 transitions. [2019-10-03 02:40:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:00,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-10-03 02:40:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:00,478 INFO L225 Difference]: With dead ends: 1624 [2019-10-03 02:40:00,478 INFO L226 Difference]: Without dead ends: 1624 [2019-10-03 02:40:00,479 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-10-03 02:40:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1600. [2019-10-03 02:40:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-03 02:40:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2343 transitions. [2019-10-03 02:40:00,527 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2343 transitions. Word has length 33 [2019-10-03 02:40:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:00,528 INFO L475 AbstractCegarLoop]: Abstraction has 1600 states and 2343 transitions. [2019-10-03 02:40:00,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2343 transitions. [2019-10-03 02:40:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:40:00,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:00,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:00,530 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:00,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1697830612, now seen corresponding path program 1 times [2019-10-03 02:40:00,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:00,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:00,694 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-03 02:40:00,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:00,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:00,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:00,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:00,696 INFO L87 Difference]: Start difference. First operand 1600 states and 2343 transitions. Second operand 4 states. [2019-10-03 02:40:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:01,657 INFO L93 Difference]: Finished difference Result 1599 states and 2340 transitions. [2019-10-03 02:40:01,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:01,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-03 02:40:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:01,668 INFO L225 Difference]: With dead ends: 1599 [2019-10-03 02:40:01,668 INFO L226 Difference]: Without dead ends: 1599 [2019-10-03 02:40:01,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03 02:40:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-10-03 02:40:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-10-03 02:40:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-10-03 02:40:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2340 transitions. [2019-10-03 02:40:01,715 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2340 transitions. Word has length 34 [2019-10-03 02:40:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:01,715 INFO L475 AbstractCegarLoop]: Abstraction has 1599 states and 2340 transitions. [2019-10-03 02:40:01,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2340 transitions. [2019-10-03 02:40:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:40:01,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:01,718 INFO L411 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-03 02:40:01,718 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:01,719 INFO L82 PathProgramCache]: Analyzing trace with hash 74007864, now seen corresponding path program 1 times [2019-10-03 02:40:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:01,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:01,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:01,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-03 02:40:01,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:01,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:01,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:01,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:01,914 INFO L87 Difference]: Start difference. First operand 1599 states and 2340 transitions. Second operand 4 states. [2019-10-03 02:40:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:02,344 INFO L93 Difference]: Finished difference Result 1281 states and 1833 transitions. [2019-10-03 02:40:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:02,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-03 02:40:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:02,352 INFO L225 Difference]: With dead ends: 1281 [2019-10-03 02:40:02,352 INFO L226 Difference]: Without dead ends: 1281 [2019-10-03 02:40:02,353 INFO L640 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-03 02:40:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-10-03 02:40:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1188. [2019-10-03 02:40:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-10-03 02:40:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1714 transitions. [2019-10-03 02:40:02,392 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1714 transitions. Word has length 46 [2019-10-03 02:40:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:02,392 INFO L475 AbstractCegarLoop]: Abstraction has 1188 states and 1714 transitions. [2019-10-03 02:40:02,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1714 transitions. [2019-10-03 02:40:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:40:02,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:02,396 INFO L411 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-03 02:40:02,397 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash 617653418, now seen corresponding path program 1 times [2019-10-03 02:40:02,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:02,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:02,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:02,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:02,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:02,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:02,714 INFO L87 Difference]: Start difference. First operand 1188 states and 1714 transitions. Second operand 3 states. [2019-10-03 02:40:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:02,736 INFO L93 Difference]: Finished difference Result 1185 states and 1703 transitions. [2019-10-03 02:40:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:02,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 02:40:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:02,749 INFO L225 Difference]: With dead ends: 1185 [2019-10-03 02:40:02,749 INFO L226 Difference]: Without dead ends: 1185 [2019-10-03 02:40:02,750 INFO L640 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-03 02:40:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-10-03 02:40:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-10-03 02:40:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-10-03 02:40:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1703 transitions. [2019-10-03 02:40:02,806 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1703 transitions. Word has length 47 [2019-10-03 02:40:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:02,807 INFO L475 AbstractCegarLoop]: Abstraction has 1185 states and 1703 transitions. [2019-10-03 02:40:02,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1703 transitions. [2019-10-03 02:40:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:40:02,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:02,813 INFO L411 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-03 02:40:02,814 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1282457629, now seen corresponding path program 1 times [2019-10-03 02:40:02,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:02,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:03,057 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-03 02:40:03,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:03,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:40:03,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:03,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:40:03,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:40:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:40:03,059 INFO L87 Difference]: Start difference. First operand 1185 states and 1703 transitions. Second operand 7 states. [2019-10-03 02:40:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:08,355 INFO L93 Difference]: Finished difference Result 1637 states and 2380 transitions. [2019-10-03 02:40:08,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:40:08,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-10-03 02:40:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:08,366 INFO L225 Difference]: With dead ends: 1637 [2019-10-03 02:40:08,366 INFO L226 Difference]: Without dead ends: 1637 [2019-10-03 02:40:08,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:40:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-10-03 02:40:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1216. [2019-10-03 02:40:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-10-03 02:40:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1748 transitions. [2019-10-03 02:40:08,405 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1748 transitions. Word has length 47 [2019-10-03 02:40:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:08,406 INFO L475 AbstractCegarLoop]: Abstraction has 1216 states and 1748 transitions. [2019-10-03 02:40:08,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:40:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1748 transitions. [2019-10-03 02:40:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:40:08,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:08,409 INFO L411 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-03 02:40:08,409 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1681530814, now seen corresponding path program 1 times [2019-10-03 02:40:08,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:08,596 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-03 02:40:08,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:08,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:08,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:08,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:08,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:08,597 INFO L87 Difference]: Start difference. First operand 1216 states and 1748 transitions. Second operand 3 states. [2019-10-03 02:40:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:08,639 INFO L93 Difference]: Finished difference Result 1212 states and 1741 transitions. [2019-10-03 02:40:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:08,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-03 02:40:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:08,649 INFO L225 Difference]: With dead ends: 1212 [2019-10-03 02:40:08,649 INFO L226 Difference]: Without dead ends: 1212 [2019-10-03 02:40:08,650 INFO L640 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-03 02:40:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-10-03 02:40:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1166. [2019-10-03 02:40:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-10-03 02:40:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1687 transitions. [2019-10-03 02:40:08,695 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1687 transitions. Word has length 49 [2019-10-03 02:40:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:08,695 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1687 transitions. [2019-10-03 02:40:08,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1687 transitions. [2019-10-03 02:40:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:40:08,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:08,700 INFO L411 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-03 02:40:08,700 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1667185905, now seen corresponding path program 1 times [2019-10-03 02:40:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:08,826 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-03 02:40:08,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:08,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:08,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:08,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:08,829 INFO L87 Difference]: Start difference. First operand 1166 states and 1687 transitions. Second operand 3 states. [2019-10-03 02:40:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:09,016 INFO L93 Difference]: Finished difference Result 1491 states and 2144 transitions. [2019-10-03 02:40:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:09,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-03 02:40:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:09,028 INFO L225 Difference]: With dead ends: 1491 [2019-10-03 02:40:09,029 INFO L226 Difference]: Without dead ends: 1491 [2019-10-03 02:40:09,030 INFO L640 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-03 02:40:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-10-03 02:40:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1216. [2019-10-03 02:40:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-10-03 02:40:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1745 transitions. [2019-10-03 02:40:09,099 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1745 transitions. Word has length 49 [2019-10-03 02:40:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:09,100 INFO L475 AbstractCegarLoop]: Abstraction has 1216 states and 1745 transitions. [2019-10-03 02:40:09,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1745 transitions. [2019-10-03 02:40:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:40:09,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:09,104 INFO L411 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-03 02:40:09,105 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1520493103, now seen corresponding path program 1 times [2019-10-03 02:40:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:09,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:09,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:09,298 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-03 02:40:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:09,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:40:09,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:09,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:40:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:40:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:40:09,300 INFO L87 Difference]: Start difference. First operand 1216 states and 1745 transitions. Second operand 7 states. [2019-10-03 02:40:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:13,499 INFO L93 Difference]: Finished difference Result 1320 states and 1921 transitions. [2019-10-03 02:40:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:40:13,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-10-03 02:40:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:13,507 INFO L225 Difference]: With dead ends: 1320 [2019-10-03 02:40:13,508 INFO L226 Difference]: Without dead ends: 1320 [2019-10-03 02:40:13,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:40:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-10-03 02:40:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1193. [2019-10-03 02:40:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-10-03 02:40:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1711 transitions. [2019-10-03 02:40:13,544 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1711 transitions. Word has length 49 [2019-10-03 02:40:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:13,545 INFO L475 AbstractCegarLoop]: Abstraction has 1193 states and 1711 transitions. [2019-10-03 02:40:13,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:40:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1711 transitions. [2019-10-03 02:40:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:40:13,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:13,548 INFO L411 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-03 02:40:13,548 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash 595151312, now seen corresponding path program 1 times [2019-10-03 02:40:13,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:13,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:13,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:13,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:13,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:40:13,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:13,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:40:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:40:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:13,788 INFO L87 Difference]: Start difference. First operand 1193 states and 1711 transitions. Second operand 6 states. [2019-10-03 02:40:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:15,226 INFO L93 Difference]: Finished difference Result 1466 states and 2107 transitions. [2019-10-03 02:40:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:15,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-03 02:40:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:15,234 INFO L225 Difference]: With dead ends: 1466 [2019-10-03 02:40:15,234 INFO L226 Difference]: Without dead ends: 1466 [2019-10-03 02:40:15,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-03 02:40:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1195. [2019-10-03 02:40:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-03 02:40:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1713 transitions. [2019-10-03 02:40:15,267 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1713 transitions. Word has length 50 [2019-10-03 02:40:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:15,267 INFO L475 AbstractCegarLoop]: Abstraction has 1195 states and 1713 transitions. [2019-10-03 02:40:15,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:40:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1713 transitions. [2019-10-03 02:40:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:40:15,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:15,270 INFO L411 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-03 02:40:15,270 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 595428142, now seen corresponding path program 1 times [2019-10-03 02:40:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:15,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:15,429 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-03 02:40:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:15,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:15,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:15,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:15,431 INFO L87 Difference]: Start difference. First operand 1195 states and 1713 transitions. Second operand 8 states. [2019-10-03 02:40:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:16,318 INFO L93 Difference]: Finished difference Result 1204 states and 1722 transitions. [2019-10-03 02:40:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:16,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-03 02:40:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:16,325 INFO L225 Difference]: With dead ends: 1204 [2019-10-03 02:40:16,325 INFO L226 Difference]: Without dead ends: 1172 [2019-10-03 02:40:16,325 INFO L640 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-03 02:40:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-10-03 02:40:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1172. [2019-10-03 02:40:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-03 02:40:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1687 transitions. [2019-10-03 02:40:16,352 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1687 transitions. Word has length 50 [2019-10-03 02:40:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:16,353 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1687 transitions. [2019-10-03 02:40:16,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1687 transitions. [2019-10-03 02:40:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:40:16,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:16,355 INFO L411 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-03 02:40:16,356 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1172509504, now seen corresponding path program 1 times [2019-10-03 02:40:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:16,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:16,529 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-03 02:40:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:16,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:16,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:16,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:16,531 INFO L87 Difference]: Start difference. First operand 1172 states and 1687 transitions. Second operand 3 states. [2019-10-03 02:40:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:16,612 INFO L93 Difference]: Finished difference Result 1242 states and 1770 transitions. [2019-10-03 02:40:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:16,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-03 02:40:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:16,619 INFO L225 Difference]: With dead ends: 1242 [2019-10-03 02:40:16,619 INFO L226 Difference]: Without dead ends: 1242 [2019-10-03 02:40:16,619 INFO L640 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-03 02:40:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2019-10-03 02:40:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1172. [2019-10-03 02:40:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-03 02:40:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1686 transitions. [2019-10-03 02:40:16,649 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1686 transitions. Word has length 54 [2019-10-03 02:40:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:16,650 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1686 transitions. [2019-10-03 02:40:16,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1686 transitions. [2019-10-03 02:40:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:40:16,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:16,653 INFO L411 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-03 02:40:16,653 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash -282150350, now seen corresponding path program 1 times [2019-10-03 02:40:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:16,837 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-03 02:40:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:16,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:16,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:16,839 INFO L87 Difference]: Start difference. First operand 1172 states and 1686 transitions. Second operand 3 states. [2019-10-03 02:40:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:16,873 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2019-10-03 02:40:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:16,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-03 02:40:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:16,878 INFO L225 Difference]: With dead ends: 1181 [2019-10-03 02:40:16,879 INFO L226 Difference]: Without dead ends: 1181 [2019-10-03 02:40:16,879 INFO L640 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-03 02:40:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-03 02:40:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1161. [2019-10-03 02:40:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-10-03 02:40:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1673 transitions. [2019-10-03 02:40:16,921 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1673 transitions. Word has length 55 [2019-10-03 02:40:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:16,921 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1673 transitions. [2019-10-03 02:40:16,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1673 transitions. [2019-10-03 02:40:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:40:16,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:16,932 INFO L411 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-03 02:40:16,932 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 282309626, now seen corresponding path program 1 times [2019-10-03 02:40:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:16,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:17,087 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-03 02:40:17,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:17,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:17,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:17,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:17,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:17,089 INFO L87 Difference]: Start difference. First operand 1161 states and 1673 transitions. Second operand 3 states. [2019-10-03 02:40:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:19,213 INFO L93 Difference]: Finished difference Result 1167 states and 1680 transitions. [2019-10-03 02:40:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:19,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 02:40:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:19,220 INFO L225 Difference]: With dead ends: 1167 [2019-10-03 02:40:19,221 INFO L226 Difference]: Without dead ends: 1167 [2019-10-03 02:40:19,222 INFO L640 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-03 02:40:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-10-03 02:40:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1162. [2019-10-03 02:40:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-10-03 02:40:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1674 transitions. [2019-10-03 02:40:19,250 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1674 transitions. Word has length 58 [2019-10-03 02:40:19,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:19,250 INFO L475 AbstractCegarLoop]: Abstraction has 1162 states and 1674 transitions. [2019-10-03 02:40:19,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1674 transitions. [2019-10-03 02:40:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:40:19,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:19,256 INFO L411 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-03 02:40:19,256 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 422858236, now seen corresponding path program 1 times [2019-10-03 02:40:19,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:19,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:19,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:19,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-03 02:40:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:19,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:19,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:19,375 INFO L87 Difference]: Start difference. First operand 1162 states and 1674 transitions. Second operand 3 states. [2019-10-03 02:40:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:19,499 INFO L93 Difference]: Finished difference Result 1180 states and 1693 transitions. [2019-10-03 02:40:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:19,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 02:40:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:19,507 INFO L225 Difference]: With dead ends: 1180 [2019-10-03 02:40:19,507 INFO L226 Difference]: Without dead ends: 1178 [2019-10-03 02:40:19,508 INFO L640 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-03 02:40:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-03 02:40:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-10-03 02:40:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-10-03 02:40:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1690 transitions. [2019-10-03 02:40:19,544 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1690 transitions. Word has length 58 [2019-10-03 02:40:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:19,544 INFO L475 AbstractCegarLoop]: Abstraction has 1176 states and 1690 transitions. [2019-10-03 02:40:19,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1690 transitions. [2019-10-03 02:40:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 02:40:19,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:19,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:19,549 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -539850114, now seen corresponding path program 1 times [2019-10-03 02:40:19,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:19,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:19,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:19,769 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-03 02:40:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:40:19,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:19,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:40:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:40:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:40:19,771 INFO L87 Difference]: Start difference. First operand 1176 states and 1690 transitions. Second operand 10 states. [2019-10-03 02:40:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:21,068 INFO L93 Difference]: Finished difference Result 1188 states and 1702 transitions. [2019-10-03 02:40:21,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:40:21,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-10-03 02:40:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:21,074 INFO L225 Difference]: With dead ends: 1188 [2019-10-03 02:40:21,075 INFO L226 Difference]: Without dead ends: 1174 [2019-10-03 02:40:21,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-10-03 02:40:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2019-10-03 02:40:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-10-03 02:40:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1686 transitions. [2019-10-03 02:40:21,103 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1686 transitions. Word has length 57 [2019-10-03 02:40:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:21,104 INFO L475 AbstractCegarLoop]: Abstraction has 1174 states and 1686 transitions. [2019-10-03 02:40:21,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:40:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1686 transitions. [2019-10-03 02:40:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:40:21,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:21,107 INFO L411 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-03 02:40:21,107 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1418017912, now seen corresponding path program 1 times [2019-10-03 02:40:21,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:21,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:21,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:21,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:21,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:21,298 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-03 02:40:21,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:21,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:21,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:21,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:21,300 INFO L87 Difference]: Start difference. First operand 1174 states and 1686 transitions. Second operand 5 states. [2019-10-03 02:40:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:22,335 INFO L93 Difference]: Finished difference Result 1176 states and 1686 transitions. [2019-10-03 02:40:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:22,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 02:40:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:22,340 INFO L225 Difference]: With dead ends: 1176 [2019-10-03 02:40:22,341 INFO L226 Difference]: Without dead ends: 1176 [2019-10-03 02:40:22,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-10-03 02:40:22,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1174. [2019-10-03 02:40:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-10-03 02:40:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1685 transitions. [2019-10-03 02:40:22,370 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1685 transitions. Word has length 60 [2019-10-03 02:40:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:22,370 INFO L475 AbstractCegarLoop]: Abstraction has 1174 states and 1685 transitions. [2019-10-03 02:40:22,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1685 transitions. [2019-10-03 02:40:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:40:22,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:22,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:22,374 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -843286890, now seen corresponding path program 1 times [2019-10-03 02:40:22,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:22,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:22,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:22,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:22,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:22,587 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-03 02:40:22,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:22,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:22,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:22,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:22,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:22,590 INFO L87 Difference]: Start difference. First operand 1174 states and 1685 transitions. Second operand 4 states. [2019-10-03 02:40:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:23,867 INFO L93 Difference]: Finished difference Result 2343 states and 3364 transitions. [2019-10-03 02:40:23,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:40:23,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-03 02:40:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:23,877 INFO L225 Difference]: With dead ends: 2343 [2019-10-03 02:40:23,877 INFO L226 Difference]: Without dead ends: 2343 [2019-10-03 02:40:23,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 02:40:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-10-03 02:40:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2205. [2019-10-03 02:40:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2205 states. [2019-10-03 02:40:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3185 transitions. [2019-10-03 02:40:23,933 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 3185 transitions. Word has length 62 [2019-10-03 02:40:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:23,933 INFO L475 AbstractCegarLoop]: Abstraction has 2205 states and 3185 transitions. [2019-10-03 02:40:23,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 3185 transitions. [2019-10-03 02:40:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:40:23,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:23,939 INFO L411 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-03 02:40:23,939 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 931882268, now seen corresponding path program 1 times [2019-10-03 02:40:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:23,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:24,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:24,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:40:24,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:24,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:40:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:40:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:40:24,133 INFO L87 Difference]: Start difference. First operand 2205 states and 3185 transitions. Second operand 10 states. [2019-10-03 02:40:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:25,196 INFO L93 Difference]: Finished difference Result 2214 states and 3194 transitions. [2019-10-03 02:40:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:40:25,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-10-03 02:40:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:25,208 INFO L225 Difference]: With dead ends: 2214 [2019-10-03 02:40:25,208 INFO L226 Difference]: Without dead ends: 2196 [2019-10-03 02:40:25,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-10-03 02:40:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2019-10-03 02:40:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-10-03 02:40:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3172 transitions. [2019-10-03 02:40:25,269 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3172 transitions. Word has length 59 [2019-10-03 02:40:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:25,270 INFO L475 AbstractCegarLoop]: Abstraction has 2196 states and 3172 transitions. [2019-10-03 02:40:25,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:40:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3172 transitions. [2019-10-03 02:40:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:40:25,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:25,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:25,276 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 847574493, now seen corresponding path program 1 times [2019-10-03 02:40:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:25,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:25,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:25,423 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-03 02:40:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:25,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:25,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:25,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:25,424 INFO L87 Difference]: Start difference. First operand 2196 states and 3172 transitions. Second operand 3 states. [2019-10-03 02:40:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:25,511 INFO L93 Difference]: Finished difference Result 2183 states and 3151 transitions. [2019-10-03 02:40:25,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:25,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-03 02:40:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:25,518 INFO L225 Difference]: With dead ends: 2183 [2019-10-03 02:40:25,518 INFO L226 Difference]: Without dead ends: 2183 [2019-10-03 02:40:25,519 INFO L640 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-03 02:40:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-10-03 02:40:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2183. [2019-10-03 02:40:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-10-03 02:40:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3151 transitions. [2019-10-03 02:40:25,578 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3151 transitions. Word has length 64 [2019-10-03 02:40:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:25,578 INFO L475 AbstractCegarLoop]: Abstraction has 2183 states and 3151 transitions. [2019-10-03 02:40:25,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3151 transitions. [2019-10-03 02:40:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:40:25,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:25,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:25,584 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -473492496, now seen corresponding path program 1 times [2019-10-03 02:40:25,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:25,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:25,839 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-03 02:40:25,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:25,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:40:25,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:25,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:40:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:40:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:25,841 INFO L87 Difference]: Start difference. First operand 2183 states and 3151 transitions. Second operand 9 states. [2019-10-03 02:40:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:28,139 INFO L93 Difference]: Finished difference Result 2206 states and 3178 transitions. [2019-10-03 02:40:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:40:28,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-03 02:40:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:28,150 INFO L225 Difference]: With dead ends: 2206 [2019-10-03 02:40:28,151 INFO L226 Difference]: Without dead ends: 2071 [2019-10-03 02:40:28,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-10-03 02:40:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2070. [2019-10-03 02:40:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-10-03 02:40:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2927 transitions. [2019-10-03 02:40:28,205 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2927 transitions. Word has length 61 [2019-10-03 02:40:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:28,206 INFO L475 AbstractCegarLoop]: Abstraction has 2070 states and 2927 transitions. [2019-10-03 02:40:28,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:40:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2927 transitions. [2019-10-03 02:40:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:40:28,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:28,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:28,211 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2053130340, now seen corresponding path program 1 times [2019-10-03 02:40:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:28,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:28,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:28,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:28,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:28,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:28,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:40:28,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:28,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:40:28,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:40:28,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:28,420 INFO L87 Difference]: Start difference. First operand 2070 states and 2927 transitions. Second operand 9 states. [2019-10-03 02:40:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:30,897 INFO L93 Difference]: Finished difference Result 2109 states and 2988 transitions. [2019-10-03 02:40:30,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:40:30,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-03 02:40:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:30,905 INFO L225 Difference]: With dead ends: 2109 [2019-10-03 02:40:30,905 INFO L226 Difference]: Without dead ends: 2008 [2019-10-03 02:40:30,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-10-03 02:40:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1987. [2019-10-03 02:40:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-10-03 02:40:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2755 transitions. [2019-10-03 02:40:30,955 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2755 transitions. Word has length 61 [2019-10-03 02:40:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:30,955 INFO L475 AbstractCegarLoop]: Abstraction has 1987 states and 2755 transitions. [2019-10-03 02:40:30,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:40:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2755 transitions. [2019-10-03 02:40:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:40:30,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:30,959 INFO L411 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-03 02:40:30,960 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash -210184969, now seen corresponding path program 1 times [2019-10-03 02:40:30,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:30,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:31,169 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-03 02:40:31,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:31,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:40:31,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:31,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:40:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:40:31,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:31,171 INFO L87 Difference]: Start difference. First operand 1987 states and 2755 transitions. Second operand 11 states. [2019-10-03 02:40:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:32,320 INFO L93 Difference]: Finished difference Result 2003 states and 2771 transitions. [2019-10-03 02:40:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:40:32,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-03 02:40:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:32,332 INFO L225 Difference]: With dead ends: 2003 [2019-10-03 02:40:32,332 INFO L226 Difference]: Without dead ends: 1981 [2019-10-03 02:40:32,333 INFO L640 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-03 02:40:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-10-03 02:40:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1981. [2019-10-03 02:40:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-10-03 02:40:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2745 transitions. [2019-10-03 02:40:32,375 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2745 transitions. Word has length 60 [2019-10-03 02:40:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:32,375 INFO L475 AbstractCegarLoop]: Abstraction has 1981 states and 2745 transitions. [2019-10-03 02:40:32,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:40:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2745 transitions. [2019-10-03 02:40:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:40:32,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:32,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:32,380 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 861905322, now seen corresponding path program 1 times [2019-10-03 02:40:32,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:32,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:32,745 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-03 02:40:32,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:32,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:40:32,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:32,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:40:32,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:40:32,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:40:32,747 INFO L87 Difference]: Start difference. First operand 1981 states and 2745 transitions. Second operand 13 states. [2019-10-03 02:40:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:34,147 INFO L93 Difference]: Finished difference Result 1997 states and 2761 transitions. [2019-10-03 02:40:34,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:40:34,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-10-03 02:40:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:34,151 INFO L225 Difference]: With dead ends: 1997 [2019-10-03 02:40:34,152 INFO L226 Difference]: Without dead ends: 1971 [2019-10-03 02:40:34,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:40:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-10-03 02:40:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1971. [2019-10-03 02:40:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-10-03 02:40:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 2731 transitions. [2019-10-03 02:40:34,192 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 2731 transitions. Word has length 65 [2019-10-03 02:40:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:34,192 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 2731 transitions. [2019-10-03 02:40:34,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:40:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 2731 transitions. [2019-10-03 02:40:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:40:34,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:34,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:34,197 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash -985874297, now seen corresponding path program 1 times [2019-10-03 02:40:34,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:34,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:34,452 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-03 02:40:34,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:34,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:40:34,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:34,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:40:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:40:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:40:34,453 INFO L87 Difference]: Start difference. First operand 1971 states and 2731 transitions. Second operand 13 states. [2019-10-03 02:40:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:35,650 INFO L93 Difference]: Finished difference Result 1987 states and 2747 transitions. [2019-10-03 02:40:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:40:35,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-10-03 02:40:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:35,656 INFO L225 Difference]: With dead ends: 1987 [2019-10-03 02:40:35,656 INFO L226 Difference]: Without dead ends: 1961 [2019-10-03 02:40:35,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:40:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-10-03 02:40:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2019-10-03 02:40:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-10-03 02:40:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2717 transitions. [2019-10-03 02:40:35,699 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2717 transitions. Word has length 64 [2019-10-03 02:40:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:35,699 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 2717 transitions. [2019-10-03 02:40:35,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:40:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2717 transitions. [2019-10-03 02:40:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:40:35,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:35,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:35,705 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1750805789, now seen corresponding path program 1 times [2019-10-03 02:40:35,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:35,860 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-03 02:40:35,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:35,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:35,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:35,861 INFO L87 Difference]: Start difference. First operand 1961 states and 2717 transitions. Second operand 4 states. [2019-10-03 02:40:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:36,717 INFO L93 Difference]: Finished difference Result 1979 states and 2733 transitions. [2019-10-03 02:40:36,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:40:36,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-03 02:40:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:36,723 INFO L225 Difference]: With dead ends: 1979 [2019-10-03 02:40:36,723 INFO L226 Difference]: Without dead ends: 1979 [2019-10-03 02:40:36,723 INFO L640 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-03 02:40:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-10-03 02:40:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1961. [2019-10-03 02:40:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-10-03 02:40:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2715 transitions. [2019-10-03 02:40:36,764 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2715 transitions. Word has length 65 [2019-10-03 02:40:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:36,764 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 2715 transitions. [2019-10-03 02:40:36,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2715 transitions. [2019-10-03 02:40:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 02:40:36,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:36,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:36,769 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1289508219, now seen corresponding path program 1 times [2019-10-03 02:40:36,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:36,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:36,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-03 02:40:36,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:36,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:36,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:36,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:36,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:36,885 INFO L87 Difference]: Start difference. First operand 1961 states and 2715 transitions. Second operand 4 states. [2019-10-03 02:40:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:37,108 INFO L93 Difference]: Finished difference Result 2055 states and 2869 transitions. [2019-10-03 02:40:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:40:37,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-03 02:40:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:37,118 INFO L225 Difference]: With dead ends: 2055 [2019-10-03 02:40:37,118 INFO L226 Difference]: Without dead ends: 2051 [2019-10-03 02:40:37,119 INFO L640 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-03 02:40:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-10-03 02:40:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1983. [2019-10-03 02:40:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-10-03 02:40:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2751 transitions. [2019-10-03 02:40:37,175 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2751 transitions. Word has length 66 [2019-10-03 02:40:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:37,175 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2751 transitions. [2019-10-03 02:40:37,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2751 transitions. [2019-10-03 02:40:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 02:40:37,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:37,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:37,181 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1564267833, now seen corresponding path program 1 times [2019-10-03 02:40:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:37,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:37,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:37,383 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-03 02:40:37,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:37,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:40:37,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:37,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:40:37,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:40:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:37,385 INFO L87 Difference]: Start difference. First operand 1983 states and 2751 transitions. Second operand 9 states. [2019-10-03 02:40:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:39,566 INFO L93 Difference]: Finished difference Result 2001 states and 2771 transitions. [2019-10-03 02:40:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:40:39,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-03 02:40:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:39,575 INFO L225 Difference]: With dead ends: 2001 [2019-10-03 02:40:39,575 INFO L226 Difference]: Without dead ends: 1977 [2019-10-03 02:40:39,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-03 02:40:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2019-10-03 02:40:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-03 02:40:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2744 transitions. [2019-10-03 02:40:39,617 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2744 transitions. Word has length 66 [2019-10-03 02:40:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:39,618 INFO L475 AbstractCegarLoop]: Abstraction has 1977 states and 2744 transitions. [2019-10-03 02:40:39,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:40:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2744 transitions. [2019-10-03 02:40:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 02:40:39,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:39,622 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:39,622 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash 332492777, now seen corresponding path program 1 times [2019-10-03 02:40:39,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:39,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:39,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:39,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:39,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:39,761 INFO L87 Difference]: Start difference. First operand 1977 states and 2744 transitions. Second operand 5 states. [2019-10-03 02:40:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:47,456 INFO L93 Difference]: Finished difference Result 1947 states and 2646 transitions. [2019-10-03 02:40:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:47,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-03 02:40:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:47,463 INFO L225 Difference]: With dead ends: 1947 [2019-10-03 02:40:47,463 INFO L226 Difference]: Without dead ends: 1947 [2019-10-03 02:40:47,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-10-03 02:40:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1947. [2019-10-03 02:40:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-03 02:40:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2646 transitions. [2019-10-03 02:40:47,498 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2646 transitions. Word has length 80 [2019-10-03 02:40:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:47,498 INFO L475 AbstractCegarLoop]: Abstraction has 1947 states and 2646 transitions. [2019-10-03 02:40:47,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2646 transitions. [2019-10-03 02:40:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 02:40:47,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:47,503 INFO L411 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:47,503 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1556405916, now seen corresponding path program 1 times [2019-10-03 02:40:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:47,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:47,850 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-03 02:40:47,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:47,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:47,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:47,855 INFO L87 Difference]: Start difference. First operand 1947 states and 2646 transitions. Second operand 5 states. [2019-10-03 02:40:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:49,241 INFO L93 Difference]: Finished difference Result 2508 states and 3432 transitions. [2019-10-03 02:40:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:49,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-03 02:40:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:49,252 INFO L225 Difference]: With dead ends: 2508 [2019-10-03 02:40:49,252 INFO L226 Difference]: Without dead ends: 2508 [2019-10-03 02:40:49,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-10-03 02:40:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2087. [2019-10-03 02:40:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-10-03 02:40:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2818 transitions. [2019-10-03 02:40:49,311 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2818 transitions. Word has length 81 [2019-10-03 02:40:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:49,312 INFO L475 AbstractCegarLoop]: Abstraction has 2087 states and 2818 transitions. [2019-10-03 02:40:49,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2818 transitions. [2019-10-03 02:40:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 02:40:49,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:49,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:49,316 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash -495018614, now seen corresponding path program 1 times [2019-10-03 02:40:49,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:49,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:49,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:49,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-03 02:40:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:40:49,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:49,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:40:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:40:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:49,611 INFO L87 Difference]: Start difference. First operand 2087 states and 2818 transitions. Second operand 11 states. [2019-10-03 02:40:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:51,845 INFO L93 Difference]: Finished difference Result 2142 states and 2906 transitions. [2019-10-03 02:40:51,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:40:51,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-10-03 02:40:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:51,850 INFO L225 Difference]: With dead ends: 2142 [2019-10-03 02:40:51,851 INFO L226 Difference]: Without dead ends: 2119 [2019-10-03 02:40:51,851 INFO L640 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-03 02:40:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2019-10-03 02:40:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2099. [2019-10-03 02:40:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2019-10-03 02:40:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2854 transitions. [2019-10-03 02:40:51,887 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2854 transitions. Word has length 67 [2019-10-03 02:40:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:51,888 INFO L475 AbstractCegarLoop]: Abstraction has 2099 states and 2854 transitions. [2019-10-03 02:40:51,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:40:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2854 transitions. [2019-10-03 02:40:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 02:40:51,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:51,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:51,892 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1453129239, now seen corresponding path program 1 times [2019-10-03 02:40:51,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:51,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:51,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:51,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:51,990 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-03 02:40:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:51,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:51,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:51,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:51,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:51,992 INFO L87 Difference]: Start difference. First operand 2099 states and 2854 transitions. Second operand 3 states. [2019-10-03 02:40:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:52,002 INFO L93 Difference]: Finished difference Result 1941 states and 2580 transitions. [2019-10-03 02:40:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:52,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-03 02:40:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:52,008 INFO L225 Difference]: With dead ends: 1941 [2019-10-03 02:40:52,009 INFO L226 Difference]: Without dead ends: 1929 [2019-10-03 02:40:52,009 INFO L640 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-03 02:40:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-10-03 02:40:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1717. [2019-10-03 02:40:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-10-03 02:40:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2294 transitions. [2019-10-03 02:40:52,038 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2294 transitions. Word has length 69 [2019-10-03 02:40:52,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:52,038 INFO L475 AbstractCegarLoop]: Abstraction has 1717 states and 2294 transitions. [2019-10-03 02:40:52,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:52,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2294 transitions. [2019-10-03 02:40:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:40:52,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:52,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:52,042 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:52,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash 513271334, now seen corresponding path program 1 times [2019-10-03 02:40:52,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:52,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:52,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:52,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:40:52,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:52,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:40:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:40:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:52,311 INFO L87 Difference]: Start difference. First operand 1717 states and 2294 transitions. Second operand 11 states. [2019-10-03 02:40:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:54,518 INFO L93 Difference]: Finished difference Result 1739 states and 2319 transitions. [2019-10-03 02:40:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:40:54,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-10-03 02:40:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:54,523 INFO L225 Difference]: With dead ends: 1739 [2019-10-03 02:40:54,524 INFO L226 Difference]: Without dead ends: 1712 [2019-10-03 02:40:54,524 INFO L640 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-03 02:40:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-10-03 02:40:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2019-10-03 02:40:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-10-03 02:40:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2285 transitions. [2019-10-03 02:40:54,549 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2285 transitions. Word has length 71 [2019-10-03 02:40:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:54,549 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2285 transitions. [2019-10-03 02:40:54,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:40:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2285 transitions. [2019-10-03 02:40:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:40:54,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:54,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:54,552 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1423241789, now seen corresponding path program 1 times [2019-10-03 02:40:54,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:54,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:54,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:54,832 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-03 02:40:54,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:54,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:40:54,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:54,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:40:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:40:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:40:54,835 INFO L87 Difference]: Start difference. First operand 1712 states and 2285 transitions. Second operand 11 states. [2019-10-03 02:40:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:57,588 INFO L93 Difference]: Finished difference Result 1734 states and 2310 transitions. [2019-10-03 02:40:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:40:57,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-10-03 02:40:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:57,594 INFO L225 Difference]: With dead ends: 1734 [2019-10-03 02:40:57,595 INFO L226 Difference]: Without dead ends: 1712 [2019-10-03 02:40:57,597 INFO L640 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-03 02:40:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-10-03 02:40:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1708. [2019-10-03 02:40:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2019-10-03 02:40:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2279 transitions. [2019-10-03 02:40:57,626 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2279 transitions. Word has length 71 [2019-10-03 02:40:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:57,626 INFO L475 AbstractCegarLoop]: Abstraction has 1708 states and 2279 transitions. [2019-10-03 02:40:57,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:40:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2279 transitions. [2019-10-03 02:40:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:40:57,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:57,632 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:57,632 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash 422856646, now seen corresponding path program 1 times [2019-10-03 02:40:57,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:57,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:57,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:57,791 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-03 02:40:57,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:57,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:57,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:57,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:57,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:57,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:57,793 INFO L87 Difference]: Start difference. First operand 1708 states and 2279 transitions. Second operand 3 states. [2019-10-03 02:40:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:57,829 INFO L93 Difference]: Finished difference Result 1760 states and 2335 transitions. [2019-10-03 02:40:57,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:57,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-03 02:40:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:57,834 INFO L225 Difference]: With dead ends: 1760 [2019-10-03 02:40:57,835 INFO L226 Difference]: Without dead ends: 1760 [2019-10-03 02:40:57,835 INFO L640 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-03 02:40:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-10-03 02:40:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1720. [2019-10-03 02:40:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1720 states. [2019-10-03 02:40:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2295 transitions. [2019-10-03 02:40:57,863 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2295 transitions. Word has length 87 [2019-10-03 02:40:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:57,863 INFO L475 AbstractCegarLoop]: Abstraction has 1720 states and 2295 transitions. [2019-10-03 02:40:57,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2295 transitions. [2019-10-03 02:40:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:40:57,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:57,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:57,867 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1578147283, now seen corresponding path program 1 times [2019-10-03 02:40:57,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:57,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:58,002 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-03 02:40:58,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:58,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:58,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:58,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:58,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:58,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:58,004 INFO L87 Difference]: Start difference. First operand 1720 states and 2295 transitions. Second operand 3 states. [2019-10-03 02:41:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:00,062 INFO L93 Difference]: Finished difference Result 1720 states and 2289 transitions. [2019-10-03 02:41:00,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:41:00,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-03 02:41:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:00,067 INFO L225 Difference]: With dead ends: 1720 [2019-10-03 02:41:00,067 INFO L226 Difference]: Without dead ends: 1720 [2019-10-03 02:41:00,068 INFO L640 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-03 02:41:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-10-03 02:41:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1720. [2019-10-03 02:41:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1720 states. [2019-10-03 02:41:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2289 transitions. [2019-10-03 02:41:00,095 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2289 transitions. Word has length 74 [2019-10-03 02:41:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:00,096 INFO L475 AbstractCegarLoop]: Abstraction has 1720 states and 2289 transitions. [2019-10-03 02:41:00,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:41:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2289 transitions. [2019-10-03 02:41:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:41:00,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,099 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash 411845250, now seen corresponding path program 1 times [2019-10-03 02:41:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:00,512 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-03 02:41:00,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:00,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:00,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:00,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:00,514 INFO L87 Difference]: Start difference. First operand 1720 states and 2289 transitions. Second operand 11 states. [2019-10-03 02:41:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,722 INFO L93 Difference]: Finished difference Result 1742 states and 2314 transitions. [2019-10-03 02:41:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:02,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-10-03 02:41:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,728 INFO L225 Difference]: With dead ends: 1742 [2019-10-03 02:41:02,728 INFO L226 Difference]: Without dead ends: 1712 [2019-10-03 02:41:02,728 INFO L640 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-03 02:41:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-10-03 02:41:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2019-10-03 02:41:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-10-03 02:41:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2277 transitions. [2019-10-03 02:41:02,756 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2277 transitions. Word has length 72 [2019-10-03 02:41:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,756 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2277 transitions. [2019-10-03 02:41:02,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2277 transitions. [2019-10-03 02:41:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:41:02,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,759 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 131425590, now seen corresponding path program 1 times [2019-10-03 02:41:02,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:03,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:03,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:03,021 INFO L87 Difference]: Start difference. First operand 1712 states and 2277 transitions. Second operand 11 states. [2019-10-03 02:41:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,679 INFO L93 Difference]: Finished difference Result 1743 states and 2313 transitions. [2019-10-03 02:41:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:05,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-10-03 02:41:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,685 INFO L225 Difference]: With dead ends: 1743 [2019-10-03 02:41:05,685 INFO L226 Difference]: Without dead ends: 1713 [2019-10-03 02:41:05,685 INFO L640 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-03 02:41:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-10-03 02:41:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1704. [2019-10-03 02:41:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-03 02:41:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2265 transitions. [2019-10-03 02:41:05,708 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2265 transitions. Word has length 72 [2019-10-03 02:41:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,708 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2265 transitions. [2019-10-03 02:41:05,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2265 transitions. [2019-10-03 02:41:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:41:05,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:05,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:05,711 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash -557408408, now seen corresponding path program 1 times [2019-10-03 02:41:05,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:05,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:05,852 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-03 02:41:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:41:05,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:41:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:41:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:41:05,854 INFO L87 Difference]: Start difference. First operand 1704 states and 2265 transitions. Second operand 3 states. [2019-10-03 02:41:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,948 INFO L93 Difference]: Finished difference Result 2067 states and 2793 transitions. [2019-10-03 02:41:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:41:05,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-03 02:41:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,956 INFO L225 Difference]: With dead ends: 2067 [2019-10-03 02:41:05,956 INFO L226 Difference]: Without dead ends: 2067 [2019-10-03 02:41:05,957 INFO L640 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-03 02:41:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-03 02:41:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2047. [2019-10-03 02:41:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-10-03 02:41:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2772 transitions. [2019-10-03 02:41:05,999 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2772 transitions. Word has length 76 [2019-10-03 02:41:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,999 INFO L475 AbstractCegarLoop]: Abstraction has 2047 states and 2772 transitions. [2019-10-03 02:41:05,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:41:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2772 transitions. [2019-10-03 02:41:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:41:06,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:06,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:06,002 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2078807621, now seen corresponding path program 1 times [2019-10-03 02:41:06,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:06,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:06,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:06,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:06,281 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-03 02:41:06,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:06,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:06,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:06,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:06,284 INFO L87 Difference]: Start difference. First operand 2047 states and 2772 transitions. Second operand 11 states. [2019-10-03 02:41:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:07,734 INFO L93 Difference]: Finished difference Result 2078 states and 2808 transitions. [2019-10-03 02:41:07,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:07,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-10-03 02:41:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:07,741 INFO L225 Difference]: With dead ends: 2078 [2019-10-03 02:41:07,741 INFO L226 Difference]: Without dead ends: 2048 [2019-10-03 02:41:07,742 INFO L640 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-03 02:41:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-10-03 02:41:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2039. [2019-10-03 02:41:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-10-03 02:41:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2760 transitions. [2019-10-03 02:41:07,776 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2760 transitions. Word has length 74 [2019-10-03 02:41:07,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:07,777 INFO L475 AbstractCegarLoop]: Abstraction has 2039 states and 2760 transitions. [2019-10-03 02:41:07,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2760 transitions. [2019-10-03 02:41:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:41:07,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:07,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:07,780 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1758202982, now seen corresponding path program 1 times [2019-10-03 02:41:07,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:07,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:07,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:07,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:08,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:08,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:08,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:08,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:08,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:08,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:08,021 INFO L87 Difference]: Start difference. First operand 2039 states and 2760 transitions. Second operand 11 states. [2019-10-03 02:41:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:10,467 INFO L93 Difference]: Finished difference Result 2070 states and 2796 transitions. [2019-10-03 02:41:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:10,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-10-03 02:41:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:10,474 INFO L225 Difference]: With dead ends: 2070 [2019-10-03 02:41:10,475 INFO L226 Difference]: Without dead ends: 2043 [2019-10-03 02:41:10,475 INFO L640 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-03 02:41:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2019-10-03 02:41:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2034. [2019-10-03 02:41:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-10-03 02:41:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2751 transitions. [2019-10-03 02:41:10,510 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2751 transitions. Word has length 74 [2019-10-03 02:41:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:10,510 INFO L475 AbstractCegarLoop]: Abstraction has 2034 states and 2751 transitions. [2019-10-03 02:41:10,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2751 transitions. [2019-10-03 02:41:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 02:41:10,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:10,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:10,513 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash -982054741, now seen corresponding path program 1 times [2019-10-03 02:41:10,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:10,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:10,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:10,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:10,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:10,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:10,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:10,753 INFO L87 Difference]: Start difference. First operand 2034 states and 2751 transitions. Second operand 11 states. [2019-10-03 02:41:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:12,976 INFO L93 Difference]: Finished difference Result 2056 states and 2776 transitions. [2019-10-03 02:41:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:12,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-10-03 02:41:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:12,982 INFO L225 Difference]: With dead ends: 2056 [2019-10-03 02:41:12,983 INFO L226 Difference]: Without dead ends: 2015 [2019-10-03 02:41:12,983 INFO L640 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-03 02:41:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-10-03 02:41:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2015. [2019-10-03 02:41:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2019-10-03 02:41:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2721 transitions. [2019-10-03 02:41:13,013 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2721 transitions. Word has length 75 [2019-10-03 02:41:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:13,014 INFO L475 AbstractCegarLoop]: Abstraction has 2015 states and 2721 transitions. [2019-10-03 02:41:13,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2721 transitions. [2019-10-03 02:41:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:41:13,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:13,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:13,017 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1877640660, now seen corresponding path program 1 times [2019-10-03 02:41:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:13,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:13,182 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-03 02:41:13,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:13,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:41:13,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:13,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:41:13,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:41:13,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:13,183 INFO L87 Difference]: Start difference. First operand 2015 states and 2721 transitions. Second operand 5 states. [2019-10-03 02:41:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:14,282 INFO L93 Difference]: Finished difference Result 2428 states and 3317 transitions. [2019-10-03 02:41:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:14,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-03 02:41:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:14,288 INFO L225 Difference]: With dead ends: 2428 [2019-10-03 02:41:14,288 INFO L226 Difference]: Without dead ends: 2428 [2019-10-03 02:41:14,288 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-10-03 02:41:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2015. [2019-10-03 02:41:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2019-10-03 02:41:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2720 transitions. [2019-10-03 02:41:14,319 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2720 transitions. Word has length 76 [2019-10-03 02:41:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:14,319 INFO L475 AbstractCegarLoop]: Abstraction has 2015 states and 2720 transitions. [2019-10-03 02:41:14,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:41:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2720 transitions. [2019-10-03 02:41:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:41:14,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:14,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:14,321 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash 831310547, now seen corresponding path program 1 times [2019-10-03 02:41:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:14,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:14,617 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-03 02:41:14,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:14,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:41:14,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:14,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:41:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:41:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:14,619 INFO L87 Difference]: Start difference. First operand 2015 states and 2720 transitions. Second operand 13 states. [2019-10-03 02:41:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:16,104 INFO L93 Difference]: Finished difference Result 2037 states and 2742 transitions. [2019-10-03 02:41:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:41:16,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-10-03 02:41:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:16,110 INFO L225 Difference]: With dead ends: 2037 [2019-10-03 02:41:16,110 INFO L226 Difference]: Without dead ends: 2005 [2019-10-03 02:41:16,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:41:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-10-03 02:41:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2005. [2019-10-03 02:41:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-10-03 02:41:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2704 transitions. [2019-10-03 02:41:16,141 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2704 transitions. Word has length 87 [2019-10-03 02:41:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:16,141 INFO L475 AbstractCegarLoop]: Abstraction has 2005 states and 2704 transitions. [2019-10-03 02:41:16,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:41:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2704 transitions. [2019-10-03 02:41:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 02:41:16,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:16,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:16,144 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 962817234, now seen corresponding path program 1 times [2019-10-03 02:41:16,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:16,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:16,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:41:16,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:16,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:41:16,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:41:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:16,401 INFO L87 Difference]: Start difference. First operand 2005 states and 2704 transitions. Second operand 13 states. [2019-10-03 02:41:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:17,894 INFO L93 Difference]: Finished difference Result 2021 states and 2720 transitions. [2019-10-03 02:41:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:41:17,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-10-03 02:41:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:17,898 INFO L225 Difference]: With dead ends: 2021 [2019-10-03 02:41:17,898 INFO L226 Difference]: Without dead ends: 1949 [2019-10-03 02:41:17,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:41:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-10-03 02:41:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1949. [2019-10-03 02:41:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-10-03 02:41:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2626 transitions. [2019-10-03 02:41:17,919 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2626 transitions. Word has length 77 [2019-10-03 02:41:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:17,919 INFO L475 AbstractCegarLoop]: Abstraction has 1949 states and 2626 transitions. [2019-10-03 02:41:17,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:41:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2626 transitions. [2019-10-03 02:41:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 02:41:17,920 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:17,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:17,921 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1473846103, now seen corresponding path program 1 times [2019-10-03 02:41:17,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:17,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:18,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-03 02:41:18,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:18,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:41:18,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:18,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:41:18,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:41:18,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:18,181 INFO L87 Difference]: Start difference. First operand 1949 states and 2626 transitions. Second operand 5 states. [2019-10-03 02:41:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:19,295 INFO L93 Difference]: Finished difference Result 2358 states and 3219 transitions. [2019-10-03 02:41:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:19,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-03 02:41:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:19,303 INFO L225 Difference]: With dead ends: 2358 [2019-10-03 02:41:19,304 INFO L226 Difference]: Without dead ends: 2358 [2019-10-03 02:41:19,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2019-10-03 02:41:19,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 1947. [2019-10-03 02:41:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-03 02:41:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2623 transitions. [2019-10-03 02:41:19,350 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2623 transitions. Word has length 77 [2019-10-03 02:41:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:19,350 INFO L475 AbstractCegarLoop]: Abstraction has 1947 states and 2623 transitions. [2019-10-03 02:41:19,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:41:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2623 transitions. [2019-10-03 02:41:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 02:41:19,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:19,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:19,354 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:19,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1474122933, now seen corresponding path program 1 times [2019-10-03 02:41:19,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:19,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:19,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:19,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:19,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-03 02:41:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:19,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:19,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:19,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:19,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:19,787 INFO L87 Difference]: Start difference. First operand 1947 states and 2623 transitions. Second operand 11 states. [2019-10-03 02:41:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:20,831 INFO L93 Difference]: Finished difference Result 1954 states and 2629 transitions. [2019-10-03 02:41:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:20,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-10-03 02:41:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:20,835 INFO L225 Difference]: With dead ends: 1954 [2019-10-03 02:41:20,835 INFO L226 Difference]: Without dead ends: 1909 [2019-10-03 02:41:20,835 INFO L640 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-03 02:41:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-10-03 02:41:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1905. [2019-10-03 02:41:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2019-10-03 02:41:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2568 transitions. [2019-10-03 02:41:20,863 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2568 transitions. Word has length 77 [2019-10-03 02:41:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:20,864 INFO L475 AbstractCegarLoop]: Abstraction has 1905 states and 2568 transitions. [2019-10-03 02:41:20,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2568 transitions. [2019-10-03 02:41:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 02:41:20,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:20,866 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:20,866 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2125152472, now seen corresponding path program 1 times [2019-10-03 02:41:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:20,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:20,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:20,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 02:41:21,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:21,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:41:21,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:21,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:41:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:41:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:21,169 INFO L87 Difference]: Start difference. First operand 1905 states and 2568 transitions. Second operand 13 states. [2019-10-03 02:41:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:23,394 INFO L93 Difference]: Finished difference Result 1905 states and 2566 transitions. [2019-10-03 02:41:23,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:23,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-10-03 02:41:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:23,402 INFO L225 Difference]: With dead ends: 1905 [2019-10-03 02:41:23,402 INFO L226 Difference]: Without dead ends: 1905 [2019-10-03 02:41:23,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2019-10-03 02:41:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1905. [2019-10-03 02:41:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1905 states. [2019-10-03 02:41:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2566 transitions. [2019-10-03 02:41:23,446 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2566 transitions. Word has length 80 [2019-10-03 02:41:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:23,447 INFO L475 AbstractCegarLoop]: Abstraction has 1905 states and 2566 transitions. [2019-10-03 02:41:23,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:41:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2566 transitions. [2019-10-03 02:41:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 02:41:23,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:23,453 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:23,453 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1290633700, now seen corresponding path program 1 times [2019-10-03 02:41:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:23,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:23,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:23,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:23,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:23,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:23,831 INFO L87 Difference]: Start difference. First operand 1905 states and 2566 transitions. Second operand 11 states. [2019-10-03 02:41:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:26,194 INFO L93 Difference]: Finished difference Result 1927 states and 2591 transitions. [2019-10-03 02:41:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:41:26,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2019-10-03 02:41:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:26,199 INFO L225 Difference]: With dead ends: 1927 [2019-10-03 02:41:26,199 INFO L226 Difference]: Without dead ends: 1887 [2019-10-03 02:41:26,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:41:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-10-03 02:41:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2019-10-03 02:41:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-10-03 02:41:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2540 transitions. [2019-10-03 02:41:26,220 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2540 transitions. Word has length 80 [2019-10-03 02:41:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:26,220 INFO L475 AbstractCegarLoop]: Abstraction has 1887 states and 2540 transitions. [2019-10-03 02:41:26,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2540 transitions. [2019-10-03 02:41:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 02:41:26,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:26,222 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:26,222 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2082798982, now seen corresponding path program 1 times [2019-10-03 02:41:26,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:26,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:26,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:26,549 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-03 02:41:26,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:26,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:41:26,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:26,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:41:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:41:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:26,552 INFO L87 Difference]: Start difference. First operand 1887 states and 2540 transitions. Second operand 13 states. [2019-10-03 02:41:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:27,835 INFO L93 Difference]: Finished difference Result 1886 states and 2538 transitions. [2019-10-03 02:41:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:41:27,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-10-03 02:41:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:27,840 INFO L225 Difference]: With dead ends: 1886 [2019-10-03 02:41:27,840 INFO L226 Difference]: Without dead ends: 1808 [2019-10-03 02:41:27,841 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:41:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2019-10-03 02:41:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1745. [2019-10-03 02:41:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-10-03 02:41:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2376 transitions. [2019-10-03 02:41:27,858 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2376 transitions. Word has length 80 [2019-10-03 02:41:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:27,859 INFO L475 AbstractCegarLoop]: Abstraction has 1745 states and 2376 transitions. [2019-10-03 02:41:27,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:41:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2376 transitions. [2019-10-03 02:41:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:41:27,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:27,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:27,861 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 93716409, now seen corresponding path program 1 times [2019-10-03 02:41:27,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:27,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:27,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:28,039 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-03 02:41:28,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:28,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:41:28,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:28,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:41:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:41:28,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:28,040 INFO L87 Difference]: Start difference. First operand 1745 states and 2376 transitions. Second operand 8 states. [2019-10-03 02:41:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,844 INFO L93 Difference]: Finished difference Result 1898 states and 2552 transitions. [2019-10-03 02:41:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:41:34,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-10-03 02:41:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:34,848 INFO L225 Difference]: With dead ends: 1898 [2019-10-03 02:41:34,848 INFO L226 Difference]: Without dead ends: 1898 [2019-10-03 02:41:34,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:41:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-03 02:41:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1745. [2019-10-03 02:41:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-10-03 02:41:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2373 transitions. [2019-10-03 02:41:34,872 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2373 transitions. Word has length 84 [2019-10-03 02:41:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:34,873 INFO L475 AbstractCegarLoop]: Abstraction has 1745 states and 2373 transitions. [2019-10-03 02:41:34,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:41:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2373 transitions. [2019-10-03 02:41:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 02:41:34,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:34,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:34,875 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2009674859, now seen corresponding path program 1 times [2019-10-03 02:41:34,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:35,061 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-03 02:41:35,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:35,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:41:35,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:35,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:41:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:41:35,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:41:35,063 INFO L87 Difference]: Start difference. First operand 1745 states and 2373 transitions. Second operand 9 states. [2019-10-03 02:43:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:35,373 INFO L93 Difference]: Finished difference Result 1816 states and 2455 transitions. [2019-10-03 02:43:35,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:43:35,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-10-03 02:43:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:35,377 INFO L225 Difference]: With dead ends: 1816 [2019-10-03 02:43:35,378 INFO L226 Difference]: Without dead ends: 1793 [2019-10-03 02:43:35,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:43:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2019-10-03 02:43:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1683. [2019-10-03 02:43:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-10-03 02:43:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2302 transitions. [2019-10-03 02:43:35,399 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2302 transitions. Word has length 81 [2019-10-03 02:43:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:35,399 INFO L475 AbstractCegarLoop]: Abstraction has 1683 states and 2302 transitions. [2019-10-03 02:43:35,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:43:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2302 transitions. [2019-10-03 02:43:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:43:35,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:35,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:35,401 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:35,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2004758967, now seen corresponding path program 1 times [2019-10-03 02:43:35,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:35,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:35,561 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-03 02:43:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:35,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:43:35,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:35,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:43:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:43:35,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:35,563 INFO L87 Difference]: Start difference. First operand 1683 states and 2302 transitions. Second operand 5 states. [2019-10-03 02:43:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:35,589 INFO L93 Difference]: Finished difference Result 1669 states and 2282 transitions. [2019-10-03 02:43:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:35,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-03 02:43:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:35,593 INFO L225 Difference]: With dead ends: 1669 [2019-10-03 02:43:35,593 INFO L226 Difference]: Without dead ends: 1669 [2019-10-03 02:43:35,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-10-03 02:43:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2019-10-03 02:43:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-10-03 02:43:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2282 transitions. [2019-10-03 02:43:35,617 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2282 transitions. Word has length 84 [2019-10-03 02:43:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:35,617 INFO L475 AbstractCegarLoop]: Abstraction has 1669 states and 2282 transitions. [2019-10-03 02:43:35,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:43:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2282 transitions. [2019-10-03 02:43:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:43:35,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:35,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:35,621 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1473094261, now seen corresponding path program 1 times [2019-10-03 02:43:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:35,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:35,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:35,859 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-03 02:43:35,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:43:35,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:35,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:43:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:43:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:35,861 INFO L87 Difference]: Start difference. First operand 1669 states and 2282 transitions. Second operand 9 states. [2019-10-03 02:43:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:39,749 INFO L93 Difference]: Finished difference Result 1725 states and 2339 transitions. [2019-10-03 02:43:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:39,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-03 02:43:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:39,753 INFO L225 Difference]: With dead ends: 1725 [2019-10-03 02:43:39,753 INFO L226 Difference]: Without dead ends: 1722 [2019-10-03 02:43:39,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:43:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-10-03 02:43:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1674. [2019-10-03 02:43:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-03 02:43:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2288 transitions. [2019-10-03 02:43:39,773 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2288 transitions. Word has length 85 [2019-10-03 02:43:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:39,774 INFO L475 AbstractCegarLoop]: Abstraction has 1674 states and 2288 transitions. [2019-10-03 02:43:39,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:43:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2288 transitions. [2019-10-03 02:43:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:43:39,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:39,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:39,775 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1555452438, now seen corresponding path program 1 times [2019-10-03 02:43:39,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:39,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:40,033 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-03 02:43:40,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:40,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:43:40,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:40,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:43:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:43:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:43:40,034 INFO L87 Difference]: Start difference. First operand 1674 states and 2288 transitions. Second operand 11 states. [2019-10-03 02:43:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:42,086 INFO L93 Difference]: Finished difference Result 1689 states and 2304 transitions. [2019-10-03 02:43:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:43:42,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-10-03 02:43:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:42,089 INFO L225 Difference]: With dead ends: 1689 [2019-10-03 02:43:42,089 INFO L226 Difference]: Without dead ends: 1649 [2019-10-03 02:43:42,089 INFO L640 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-03 02:43:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-10-03 02:43:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1644. [2019-10-03 02:43:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1644 states. [2019-10-03 02:43:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2249 transitions. [2019-10-03 02:43:42,107 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2249 transitions. Word has length 85 [2019-10-03 02:43:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:42,107 INFO L475 AbstractCegarLoop]: Abstraction has 1644 states and 2249 transitions. [2019-10-03 02:43:42,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:43:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2249 transitions. [2019-10-03 02:43:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:43:42,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:42,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:42,108 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -220096048, now seen corresponding path program 1 times [2019-10-03 02:43:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:42,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:42,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:42,269 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-03 02:43:42,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:42,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:43:42,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:42,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:43:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:43:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:42,270 INFO L87 Difference]: Start difference. First operand 1644 states and 2249 transitions. Second operand 5 states. [2019-10-03 02:43:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:42,900 INFO L93 Difference]: Finished difference Result 1616 states and 2214 transitions. [2019-10-03 02:43:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:42,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-03 02:43:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:42,904 INFO L225 Difference]: With dead ends: 1616 [2019-10-03 02:43:42,905 INFO L226 Difference]: Without dead ends: 1616 [2019-10-03 02:43:42,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:43:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2019-10-03 02:43:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2019-10-03 02:43:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2019-10-03 02:43:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2213 transitions. [2019-10-03 02:43:42,924 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2213 transitions. Word has length 88 [2019-10-03 02:43:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:42,924 INFO L475 AbstractCegarLoop]: Abstraction has 1614 states and 2213 transitions. [2019-10-03 02:43:42,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:43:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2213 transitions. [2019-10-03 02:43:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:43:42,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:42,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:42,926 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1779855618, now seen corresponding path program 1 times [2019-10-03 02:43:42,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:42,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:43,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:43:43,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:43,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:43:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:43:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:43,134 INFO L87 Difference]: Start difference. First operand 1614 states and 2213 transitions. Second operand 9 states. [2019-10-03 02:43:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:46,328 INFO L93 Difference]: Finished difference Result 1670 states and 2269 transitions. [2019-10-03 02:43:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:46,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-10-03 02:43:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:46,333 INFO L225 Difference]: With dead ends: 1670 [2019-10-03 02:43:46,333 INFO L226 Difference]: Without dead ends: 1667 [2019-10-03 02:43:46,333 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:43:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-10-03 02:43:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1619. [2019-10-03 02:43:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2019-10-03 02:43:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2218 transitions. [2019-10-03 02:43:46,353 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2218 transitions. Word has length 90 [2019-10-03 02:43:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:46,353 INFO L475 AbstractCegarLoop]: Abstraction has 1619 states and 2218 transitions. [2019-10-03 02:43:46,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:43:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2218 transitions. [2019-10-03 02:43:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:43:46,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:46,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:46,355 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1785770401, now seen corresponding path program 1 times [2019-10-03 02:43:46,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:46,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:46,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:46,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:46,576 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-03 02:43:46,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:46,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:43:46,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:46,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:43:46,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:43:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:43:46,577 INFO L87 Difference]: Start difference. First operand 1619 states and 2218 transitions. Second operand 11 states. [2019-10-03 02:43:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:48,816 INFO L93 Difference]: Finished difference Result 1641 states and 2242 transitions. [2019-10-03 02:43:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:43:48,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-10-03 02:43:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:48,821 INFO L225 Difference]: With dead ends: 1641 [2019-10-03 02:43:48,821 INFO L226 Difference]: Without dead ends: 1605 [2019-10-03 02:43:48,821 INFO L640 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-03 02:43:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-10-03 02:43:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1600. [2019-10-03 02:43:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-10-03 02:43:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2193 transitions. [2019-10-03 02:43:48,845 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2193 transitions. Word has length 90 [2019-10-03 02:43:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:48,845 INFO L475 AbstractCegarLoop]: Abstraction has 1600 states and 2193 transitions. [2019-10-03 02:43:48,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:43:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2193 transitions. [2019-10-03 02:43:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:43:48,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:48,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:48,848 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 493912583, now seen corresponding path program 1 times [2019-10-03 02:43:48,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:48,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:48,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:48,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:49,082 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-03 02:43:49,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:49,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:43:49,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:49,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:43:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:43:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:49,085 INFO L87 Difference]: Start difference. First operand 1600 states and 2193 transitions. Second operand 9 states. [2019-10-03 02:45:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:10,332 INFO L93 Difference]: Finished difference Result 1627 states and 2220 transitions. [2019-10-03 02:45:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:45:10,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-10-03 02:45:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:10,336 INFO L225 Difference]: With dead ends: 1627 [2019-10-03 02:45:10,336 INFO L226 Difference]: Without dead ends: 1598 [2019-10-03 02:45:10,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:45:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2019-10-03 02:45:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1524. [2019-10-03 02:45:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-10-03 02:45:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2106 transitions. [2019-10-03 02:45:10,354 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2106 transitions. Word has length 87 [2019-10-03 02:45:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:10,355 INFO L475 AbstractCegarLoop]: Abstraction has 1524 states and 2106 transitions. [2019-10-03 02:45:10,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2106 transitions. [2019-10-03 02:45:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:45:10,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:10,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:10,357 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash -986302537, now seen corresponding path program 1 times [2019-10-03 02:45:10,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:10,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:10,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:10,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:10,507 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-03 02:45:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:10,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:10,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:10,508 INFO L87 Difference]: Start difference. First operand 1524 states and 2106 transitions. Second operand 4 states. [2019-10-03 02:45:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:10,675 INFO L93 Difference]: Finished difference Result 1532 states and 2116 transitions. [2019-10-03 02:45:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:10,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:45:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:10,678 INFO L225 Difference]: With dead ends: 1532 [2019-10-03 02:45:10,679 INFO L226 Difference]: Without dead ends: 1526 [2019-10-03 02:45:10,679 INFO L640 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-03 02:45:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2019-10-03 02:45:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2019-10-03 02:45:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2019-10-03 02:45:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2108 transitions. [2019-10-03 02:45:10,701 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2108 transitions. Word has length 91 [2019-10-03 02:45:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:10,702 INFO L475 AbstractCegarLoop]: Abstraction has 1526 states and 2108 transitions. [2019-10-03 02:45:10,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2108 transitions. [2019-10-03 02:45:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:45:10,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:10,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:10,703 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -825343148, now seen corresponding path program 1 times [2019-10-03 02:45:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:10,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:45:11,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:11,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:11,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:11,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:11,031 INFO L87 Difference]: Start difference. First operand 1526 states and 2108 transitions. Second operand 4 states. [2019-10-03 02:45:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:11,104 INFO L93 Difference]: Finished difference Result 1532 states and 2114 transitions. [2019-10-03 02:45:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:11,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:45:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:11,107 INFO L225 Difference]: With dead ends: 1532 [2019-10-03 02:45:11,107 INFO L226 Difference]: Without dead ends: 1528 [2019-10-03 02:45:11,108 INFO L640 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-03 02:45:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-10-03 02:45:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-10-03 02:45:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-10-03 02:45:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2110 transitions. [2019-10-03 02:45:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2110 transitions. Word has length 92 [2019-10-03 02:45:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:11,132 INFO L475 AbstractCegarLoop]: Abstraction has 1528 states and 2110 transitions. [2019-10-03 02:45:11,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2110 transitions. [2019-10-03 02:45:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:45:11,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:11,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:11,134 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1019755495, now seen corresponding path program 1 times [2019-10-03 02:45:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:11,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:45:11,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:45:11,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:45:11,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2019-10-03 02:45:11,271 INFO L207 CegarAbsIntRunner]: [31], [32], [464], [1130], [1132], [1135], [1543], [1631], [1636], [2405], [2408], [2415], [2418], [2420], [2426], [2438], [2443], [2448], [2455], [2463], [2466], [2469], [2482], [2483], [2492], [2493], [2536], [2540], [2543], [2551], [2556], [2559], [2680], [2685], [2700], [2701], [2702], [2703], [2719], [2721], [2722], [3172], [3183], [3189], [3195], [3201], [3205], [3208], [3209], [3213], [3215], [3219], [3221], [3222], [3273], [3276], [3287], [3751], [3753], [3759], [3765], [3767], [3769], [3772], [3774], [3778], [3779], [3916], [3917], [3986], [4086], [4087], [4088], [4089], [4094], [4095], [4096], [4097], [4100], [4116], [4117], [4184], [4185], [4186], [4228], [4229], [4230], [4276], [4277], [4282], [4283], [4284], [4285] [2019-10-03 02:45:11,336 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:45:11,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:45:11,448 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:45:11,450 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 108 root evaluator evaluations with a maximum evaluation depth of 0. Performed 108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 174 variables. [2019-10-03 02:45:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:11,456 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:45:11,557 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:45:11,557 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:45:11,566 INFO L420 sIntCurrentIteration]: We unified 92 AI predicates to 92 [2019-10-03 02:45:11,567 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:45:11,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:45:11,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-10-03 02:45:11,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:11,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:45:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:45:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:45:11,569 INFO L87 Difference]: Start difference. First operand 1528 states and 2110 transitions. Second operand 2 states. [2019-10-03 02:45:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:11,570 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:45:11,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:45:11,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 93 [2019-10-03 02:45:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:11,571 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:45:11,571 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:45:11,571 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:45:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:45:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:45:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:45:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:45:11,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2019-10-03 02:45:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:11,572 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:45:11,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:45:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:45:11,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:45:11,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:45:11 BoogieIcfgContainer [2019-10-03 02:45:11,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:45:11,580 INFO L168 Benchmark]: Toolchain (without parser) took 416808.62 ms. Allocated memory was 133.2 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 78.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 237.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:45:11,581 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:45:11,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2339.64 ms. Allocated memory was 133.2 MB in the beginning and 265.3 MB in the end (delta: 132.1 MB). Free memory was 77.8 MB in the beginning and 105.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:45:11,582 INFO L168 Benchmark]: Boogie Preprocessor took 622.40 ms. Allocated memory was 265.3 MB in the beginning and 269.5 MB in the end (delta: 4.2 MB). Free memory was 105.8 MB in the beginning and 160.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:45:11,583 INFO L168 Benchmark]: RCFGBuilder took 97995.95 ms. Allocated memory was 269.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 160.6 MB in the beginning and 268.8 MB in the end (delta: -108.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-03 02:45:11,583 INFO L168 Benchmark]: TraceAbstraction took 315844.60 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 176.7 MB). Free memory was 268.8 MB in the beginning and 1.2 GB in the end (delta: -957.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:45:11,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2339.64 ms. Allocated memory was 133.2 MB in the beginning and 265.3 MB in the end (delta: 132.1 MB). Free memory was 77.8 MB in the beginning and 105.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 622.40 ms. Allocated memory was 265.3 MB in the beginning and 269.5 MB in the end (delta: 4.2 MB). Free memory was 105.8 MB in the beginning and 160.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 97995.95 ms. Allocated memory was 269.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 160.6 MB in the beginning and 268.8 MB in the end (delta: -108.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * TraceAbstraction took 315844.60 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 176.7 MB). Free memory was 268.8 MB in the beginning and 1.2 GB in the end (delta: -957.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2845]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 96 procedures, 1435 locations, 1 error locations. SAFE Result, 315.7s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 297.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51752 SDtfs, 26924 SDslu, 194753 SDs, 0 SdLazy, 20075 SolverSat, 3693 SolverUnsat, 114 SolverUnknown, 0 SolverNotchecked, 286.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 4.032608695652174 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 65 MinimizatonAttempts, 4233 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 4327 NumberOfCodeBlocks, 4327 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4262 ConstructedInterpolants, 0 QuantifiedInterpolants, 564356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 64 PerfectInterpolantSequences, 23/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...