java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:50:22,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:50:22,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:50:22,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:50:22,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:50:22,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:50:22,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:50:22,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:50:22,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:50:22,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:50:22,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:50:22,297 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:50:22,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:50:22,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:50:22,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:50:22,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:50:22,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:50:22,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:50:22,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:50:22,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:50:22,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:50:22,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:50:22,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:50:22,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:50:22,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:50:22,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:50:22,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:50:22,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:50:22,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:50:22,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:50:22,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:50:22,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:50:22,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:50:22,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:50:22,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:50:22,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:50:22,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:50:22,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:50:22,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:50:22,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:50:22,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:50:22,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:50:22,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:50:22,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:50:22,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:50:22,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:50:22,354 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:50:22,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:50:22,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:50:22,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:50:22,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:50:22,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:50:22,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:50:22,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:50:22,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:50:22,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:50:22,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:50:22,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:50:22,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:50:22,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:50:22,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:50:22,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:50:22,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:50:22,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:50:22,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:50:22,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:50:22,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:50:22,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:50:22,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:50:22,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:50:22,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:50:22,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:50:22,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:50:22,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:50:22,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:50:22,681 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:50:22,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c [2019-10-07 13:50:22,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c04827/623fe38d3a81444ba44f0053bee92390/FLAGa99488479 [2019-10-07 13:50:23,491 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:50:23,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c [2019-10-07 13:50:23,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c04827/623fe38d3a81444ba44f0053bee92390/FLAGa99488479 [2019-10-07 13:50:23,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55c04827/623fe38d3a81444ba44f0053bee92390 [2019-10-07 13:50:23,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:50:23,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:50:23,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:23,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:50:23,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:50:23,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:23" (1/1) ... [2019-10-07 13:50:23,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35299c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:23, skipping insertion in model container [2019-10-07 13:50:23,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:50:23" (1/1) ... [2019-10-07 13:50:23,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:50:23,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:50:24,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:25,032 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:50:25,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:50:25,430 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:50:25,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25 WrapperNode [2019-10-07 13:50:25,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:50:25,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:50:25,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:50:25,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:50:25,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (1/1) ... [2019-10-07 13:50:25,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:50:25,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:50:25,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:50:25,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:50:25,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (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-07 13:50:26,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:50:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:50:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-10-07 13:50:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-07 13:50:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-07 13:50:26,015 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-10-07 13:50:26,016 INFO L138 BoogieDeclarations]: Found implementation of procedure KeGetCurrentProcessorNumber [2019-10-07 13:50:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2019-10-07 13:50:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-10-07 13:50:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-10-07 13:50:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-10-07 13:50:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2019-10-07 13:50:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-10-07 13:50:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:50:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:50:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-07 13:50:26,024 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-07 13:50:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddDevice [2019-10-07 13:50:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-07 13:50:26,025 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-07 13:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfReadWrite [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfWmi [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-07 13:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-07 13:50:26,028 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-07 13:50:26,028 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2019-10-07 13:50:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiRegInfo [2019-10-07 13:50:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiDataBlock [2019-10-07 13:50:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfWmiFunctionControl [2019-10-07 13:50:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2019-10-07 13:50:26,029 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:50:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:50:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-07 13:50:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-07 13:50:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-07 13:50:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-07 13:50:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-07 13:50:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:50:26,032 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-07 13:50:26,033 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-07 13:50:26,034 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-07 13:50:26,035 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:50:26,036 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-07 13:50:26,037 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-07 13:50:26,038 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-07 13:50:26,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-07 13:50:26,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:50:26,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:50:26,040 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-07 13:50:26,040 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-07 13:50:26,040 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:50:26,040 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-07 13:50:26,040 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-07 13:50:26,041 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-07 13:50:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-07 13:50:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-07 13:50:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-07 13:50:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-07 13:50:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-07 13:50:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-07 13:50:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-07 13:50:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-07 13:50:26,044 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-07 13:50:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:50:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-10-07 13:50:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-07 13:50:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-07 13:50:26,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-07 13:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:50:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 13:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 13:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-10-07 13:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-07 13:50:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-07 13:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-07 13:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-07 13:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-07 13:50:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-07 13:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-07 13:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:50:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-07 13:50:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-07 13:50:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-07 13:50:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-07 13:50:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:50:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:50:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-07 13:50:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-10-07 13:50:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure KeGetCurrentProcessorNumber [2019-10-07 13:50:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-07 13:50:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:50:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-07 13:50:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-07 13:50:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-07 13:50:26,053 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:50:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-07 13:50:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-07 13:50:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2019-10-07 13:50:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-07 13:50:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-07 13:50:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-07 13:50:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-07 13:50:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-07 13:50:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-07 13:50:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:50:26,061 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-07 13:50:26,067 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:50:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-07 13:50:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-07 13:50:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-07 13:50:26,068 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-07 13:50:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-07 13:50:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:50:26,071 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-07 13:50:26,072 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-07 13:50:26,073 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-07 13:50:26,074 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-07 13:50:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure swprintf [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-10-07 13:50:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:50:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:50:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-07 13:50:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddDevice [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-07 13:50:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfReadWrite [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-07 13:50:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfWmi [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiRegInfo [2019-10-07 13:50:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiDataBlock [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfWmiFunctionControl [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 13:50:26,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:50:26,082 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-07 13:50:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-07 13:50:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-07 13:50:27,395 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,462 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,462 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,462 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,484 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,484 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,515 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,527 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,527 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,528 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,549 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,573 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,573 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,574 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,590 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,590 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,591 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,611 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,612 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,612 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,631 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,631 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,930 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,941 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,941 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,970 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:27,984 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:27,985 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:27,985 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:28,006 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:28,006 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:28,040 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:28,059 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:28,059 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:28,084 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:28,095 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:28,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:28,104 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:30,346 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-10-07 13:50:30,347 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-10-07 13:50:32,802 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:32,856 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-07 13:50:32,856 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-07 13:50:35,798 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:50:35,807 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:50:35,807 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:50:35,833 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:37,433 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-10-07 13:51:37,434 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-10-07 13:51:37,526 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:37,548 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:37,549 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:38,995 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:39,009 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:51:39,009 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:51:39,015 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:51:41,145 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-07 13:51:41,145 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-07 13:52:11,306 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:11,372 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:52:11,372 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:52:11,407 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:11,433 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:52:11,433 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:52:11,516 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:11,527 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:11,527 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:16,719 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:16,728 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:16,728 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:46,528 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:52:46,528 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 13:52:46,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:52:46 BoogieIcfgContainer [2019-10-07 13:52:46,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:52:46,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:52:46,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:52:46,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:52:46,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:50:23" (1/3) ... [2019-10-07 13:52:46,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fee9650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:52:46, skipping insertion in model container [2019-10-07 13:52:46,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:50:25" (2/3) ... [2019-10-07 13:52:46,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fee9650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:52:46, skipping insertion in model container [2019-10-07 13:52:46,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:52:46" (3/3) ... [2019-10-07 13:52:46,538 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2019-10-07 13:52:46,548 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:52:46,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:52:46,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:52:46,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:52:46,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:52:46,602 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:52:46,602 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:52:46,602 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:52:46,602 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:52:46,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:52:46,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:52:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-10-07 13:52:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:52:46,639 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:46,641 INFO L385 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] [2019-10-07 13:52:46,643 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 887382904, now seen corresponding path program 1 times [2019-10-07 13:52:46,658 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:46,658 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:46,658 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:46,659 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:52:47,689 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:47,689 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:47,690 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 13:52:47,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 13:52:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 13:52:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 13:52:47,712 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 2 states. [2019-10-07 13:52:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:47,814 INFO L93 Difference]: Finished difference Result 712 states and 1023 transitions. [2019-10-07 13:52:47,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 13:52:47,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-10-07 13:52:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:47,830 INFO L225 Difference]: With dead ends: 712 [2019-10-07 13:52:47,830 INFO L226 Difference]: Without dead ends: 354 [2019-10-07 13:52:47,839 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07 13:52:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-07 13:52:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-10-07 13:52:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-07 13:52:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 468 transitions. [2019-10-07 13:52:47,919 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 468 transitions. Word has length 22 [2019-10-07 13:52:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:47,919 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 468 transitions. [2019-10-07 13:52:47,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 13:52:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 468 transitions. [2019-10-07 13:52:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:52:47,921 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:47,921 INFO L385 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] [2019-10-07 13:52:47,921 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1746737171, now seen corresponding path program 1 times [2019-10-07 13:52:47,922 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:47,922 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:47,922 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:47,923 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:48,558 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-07 13:52:48,558 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:48,559 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:48,559 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:52:48,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:52:48,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:52:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:52:48,563 INFO L87 Difference]: Start difference. First operand 354 states and 468 transitions. Second operand 3 states. [2019-10-07 13:52:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:48,800 INFO L93 Difference]: Finished difference Result 374 states and 494 transitions. [2019-10-07 13:52:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:52:48,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-07 13:52:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:48,810 INFO L225 Difference]: With dead ends: 374 [2019-10-07 13:52:48,810 INFO L226 Difference]: Without dead ends: 354 [2019-10-07 13:52:48,812 INFO L606 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-07 13:52:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-07 13:52:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-10-07 13:52:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-07 13:52:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 467 transitions. [2019-10-07 13:52:48,856 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 467 transitions. Word has length 24 [2019-10-07 13:52:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:48,857 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 467 transitions. [2019-10-07 13:52:48,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:52:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2019-10-07 13:52:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:52:48,858 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:48,858 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:52:48,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash 431348609, now seen corresponding path program 1 times [2019-10-07 13:52:48,859 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:48,859 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:48,860 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:48,860 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:50,939 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-07 13:52:50,939 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:50,939 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:50,940 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:52:50,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:52:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:52:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:52:50,941 INFO L87 Difference]: Start difference. First operand 354 states and 467 transitions. Second operand 3 states. [2019-10-07 13:52:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:51,307 INFO L93 Difference]: Finished difference Result 744 states and 997 transitions. [2019-10-07 13:52:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:52:51,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:52:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:51,316 INFO L225 Difference]: With dead ends: 744 [2019-10-07 13:52:51,317 INFO L226 Difference]: Without dead ends: 512 [2019-10-07 13:52:51,318 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:52:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-07 13:52:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2019-10-07 13:52:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-07 13:52:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2019-10-07 13:52:51,372 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 27 [2019-10-07 13:52:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:51,373 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2019-10-07 13:52:51,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:52:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2019-10-07 13:52:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:52:51,384 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:51,384 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:52:51,384 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:51,385 INFO L82 PathProgramCache]: Analyzing trace with hash -42344207, now seen corresponding path program 1 times [2019-10-07 13:52:51,385 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:51,387 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:51,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:51,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:53,983 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-07 13:52:53,983 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:53,984 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:53,984 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:52:53,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:52:53,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:52:53,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:52:53,985 INFO L87 Difference]: Start difference. First operand 509 states and 676 transitions. Second operand 3 states. [2019-10-07 13:52:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:54,170 INFO L93 Difference]: Finished difference Result 563 states and 743 transitions. [2019-10-07 13:52:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:52:54,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-07 13:52:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:54,176 INFO L225 Difference]: With dead ends: 563 [2019-10-07 13:52:54,176 INFO L226 Difference]: Without dead ends: 559 [2019-10-07 13:52:54,177 INFO L606 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-07 13:52:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-07 13:52:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2019-10-07 13:52:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-07 13:52:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 731 transitions. [2019-10-07 13:52:54,215 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 731 transitions. Word has length 36 [2019-10-07 13:52:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:54,216 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 731 transitions. [2019-10-07 13:52:54,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:52:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 731 transitions. [2019-10-07 13:52:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:52:54,221 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:54,221 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:52:54,222 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1352767469, now seen corresponding path program 1 times [2019-10-07 13:52:54,222 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:54,222 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:54,223 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:54,223 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:55,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-07 13:52:55,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:55,976 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:55,976 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:52:55,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:52:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:52:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:52:55,977 INFO L87 Difference]: Start difference. First operand 553 states and 731 transitions. Second operand 3 states. [2019-10-07 13:52:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:56,091 INFO L93 Difference]: Finished difference Result 1220 states and 1658 transitions. [2019-10-07 13:52:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:52:56,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-07 13:52:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:56,100 INFO L225 Difference]: With dead ends: 1220 [2019-10-07 13:52:56,101 INFO L226 Difference]: Without dead ends: 811 [2019-10-07 13:52:56,104 INFO L606 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-07 13:52:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-10-07 13:52:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 777. [2019-10-07 13:52:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-10-07 13:52:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1056 transitions. [2019-10-07 13:52:56,169 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1056 transitions. Word has length 37 [2019-10-07 13:52:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:56,172 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1056 transitions. [2019-10-07 13:52:56,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:52:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1056 transitions. [2019-10-07 13:52:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:52:56,174 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:56,174 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:52:56,174 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash -134980486, now seen corresponding path program 1 times [2019-10-07 13:52:56,175 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:56,175 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:56,180 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:56,181 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:52:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:52:57,603 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-07 13:52:57,603 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:57,604 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:52:57,604 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:52:57,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:52:57,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:52:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:52:57,606 INFO L87 Difference]: Start difference. First operand 777 states and 1056 transitions. Second operand 5 states. [2019-10-07 13:52:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:52:58,904 INFO L93 Difference]: Finished difference Result 818 states and 1105 transitions. [2019-10-07 13:52:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:52:58,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-07 13:52:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:52:58,912 INFO L225 Difference]: With dead ends: 818 [2019-10-07 13:52:58,912 INFO L226 Difference]: Without dead ends: 807 [2019-10-07 13:52:58,913 INFO L606 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-07 13:52:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-07 13:52:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 795. [2019-10-07 13:52:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-10-07 13:52:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1078 transitions. [2019-10-07 13:52:58,961 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1078 transitions. Word has length 40 [2019-10-07 13:52:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:52:58,962 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1078 transitions. [2019-10-07 13:52:58,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:52:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1078 transitions. [2019-10-07 13:52:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:52:58,963 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:52:58,963 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:52:58,964 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:52:58,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:52:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash -326157411, now seen corresponding path program 1 times [2019-10-07 13:52:58,964 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:52:58,964 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:52:58,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:58,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:52:58,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:00,410 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-07 13:53:00,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:00,410 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:00,410 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:53:00,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:53:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:53:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:53:00,412 INFO L87 Difference]: Start difference. First operand 795 states and 1078 transitions. Second operand 5 states. [2019-10-07 13:53:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:01,629 INFO L93 Difference]: Finished difference Result 809 states and 1090 transitions. [2019-10-07 13:53:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:53:01,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-07 13:53:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:01,635 INFO L225 Difference]: With dead ends: 809 [2019-10-07 13:53:01,635 INFO L226 Difference]: Without dead ends: 801 [2019-10-07 13:53:01,636 INFO L606 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-07 13:53:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-07 13:53:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 795. [2019-10-07 13:53:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-10-07 13:53:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1077 transitions. [2019-10-07 13:53:01,791 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1077 transitions. Word has length 41 [2019-10-07 13:53:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:01,791 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1077 transitions. [2019-10-07 13:53:01,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:53:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1077 transitions. [2019-10-07 13:53:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:53:01,792 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:01,793 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:01,793 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1788670447, now seen corresponding path program 1 times [2019-10-07 13:53:01,794 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:01,794 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:01,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:01,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:03,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-07 13:53:03,039 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:03,040 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:03,040 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:53:03,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:53:03,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:53:03,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:53:03,041 INFO L87 Difference]: Start difference. First operand 795 states and 1077 transitions. Second operand 3 states. [2019-10-07 13:53:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:03,179 INFO L93 Difference]: Finished difference Result 1421 states and 1954 transitions. [2019-10-07 13:53:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:53:03,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:53:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:03,189 INFO L225 Difference]: With dead ends: 1421 [2019-10-07 13:53:03,190 INFO L226 Difference]: Without dead ends: 1392 [2019-10-07 13:53:03,191 INFO L606 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-07 13:53:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-10-07 13:53:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1383. [2019-10-07 13:53:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-10-07 13:53:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1902 transitions. [2019-10-07 13:53:03,270 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1902 transitions. Word has length 42 [2019-10-07 13:53:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:03,271 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 1902 transitions. [2019-10-07 13:53:03,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:53:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1902 transitions. [2019-10-07 13:53:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:53:03,272 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:03,272 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:03,273 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 393644037, now seen corresponding path program 1 times [2019-10-07 13:53:03,273 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:03,273 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:03,273 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:03,274 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:53:04,476 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:04,477 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:04,477 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:53:04,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:53:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:53:04,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:53:04,479 INFO L87 Difference]: Start difference. First operand 1383 states and 1902 transitions. Second operand 5 states. [2019-10-07 13:53:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:06,685 INFO L93 Difference]: Finished difference Result 1397 states and 1915 transitions. [2019-10-07 13:53:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:53:06,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-07 13:53:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:06,694 INFO L225 Difference]: With dead ends: 1397 [2019-10-07 13:53:06,695 INFO L226 Difference]: Without dead ends: 1377 [2019-10-07 13:53:06,696 INFO L606 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-07 13:53:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-10-07 13:53:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2019-10-07 13:53:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-10-07 13:53:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1894 transitions. [2019-10-07 13:53:06,779 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1894 transitions. Word has length 43 [2019-10-07 13:53:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:06,779 INFO L462 AbstractCegarLoop]: Abstraction has 1377 states and 1894 transitions. [2019-10-07 13:53:06,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:53:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1894 transitions. [2019-10-07 13:53:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:53:06,781 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:06,781 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:06,781 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1574677080, now seen corresponding path program 1 times [2019-10-07 13:53:06,782 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:06,782 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:06,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:06,782 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:08,171 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-07 13:53:08,171 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:08,172 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:08,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:53:08,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:53:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:53:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:53:08,173 INFO L87 Difference]: Start difference. First operand 1377 states and 1894 transitions. Second operand 3 states. [2019-10-07 13:53:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:08,469 INFO L93 Difference]: Finished difference Result 2028 states and 2911 transitions. [2019-10-07 13:53:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:53:08,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 13:53:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:08,486 INFO L225 Difference]: With dead ends: 2028 [2019-10-07 13:53:08,486 INFO L226 Difference]: Without dead ends: 2020 [2019-10-07 13:53:08,488 INFO L606 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-07 13:53:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-10-07 13:53:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1500. [2019-10-07 13:53:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-07 13:53:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2080 transitions. [2019-10-07 13:53:08,594 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2080 transitions. Word has length 45 [2019-10-07 13:53:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 2080 transitions. [2019-10-07 13:53:08,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:53:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2080 transitions. [2019-10-07 13:53:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:53:08,596 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:08,596 INFO L385 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-07 13:53:08,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2023171279, now seen corresponding path program 1 times [2019-10-07 13:53:08,597 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:08,597 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:08,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:08,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:10,052 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-07 13:53:10,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:10,052 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:10,052 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:53:10,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:53:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:53:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:53:10,053 INFO L87 Difference]: Start difference. First operand 1500 states and 2080 transitions. Second operand 5 states. [2019-10-07 13:53:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:11,853 INFO L93 Difference]: Finished difference Result 2032 states and 2913 transitions. [2019-10-07 13:53:11,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:53:11,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 13:53:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:11,880 INFO L225 Difference]: With dead ends: 2032 [2019-10-07 13:53:11,881 INFO L226 Difference]: Without dead ends: 2024 [2019-10-07 13:53:11,883 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-07 13:53:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-10-07 13:53:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1500. [2019-10-07 13:53:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-07 13:53:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2079 transitions. [2019-10-07 13:53:12,020 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2079 transitions. Word has length 46 [2019-10-07 13:53:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:12,021 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 2079 transitions. [2019-10-07 13:53:12,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:53:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2079 transitions. [2019-10-07 13:53:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:53:12,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:12,024 INFO L385 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-07 13:53:12,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:12,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1691154242, now seen corresponding path program 1 times [2019-10-07 13:53:12,025 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:12,025 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:12,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:12,026 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:13,489 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-07 13:53:13,490 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:13,490 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:13,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:53:13,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:53:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:53:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:53:13,491 INFO L87 Difference]: Start difference. First operand 1500 states and 2079 transitions. Second operand 8 states. [2019-10-07 13:53:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:16,393 INFO L93 Difference]: Finished difference Result 1515 states and 2094 transitions. [2019-10-07 13:53:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:53:16,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-07 13:53:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:16,404 INFO L225 Difference]: With dead ends: 1515 [2019-10-07 13:53:16,404 INFO L226 Difference]: Without dead ends: 1511 [2019-10-07 13:53:16,406 INFO L606 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-07 13:53:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-10-07 13:53:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2019-10-07 13:53:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2019-10-07 13:53:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2086 transitions. [2019-10-07 13:53:16,499 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2086 transitions. Word has length 47 [2019-10-07 13:53:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:16,500 INFO L462 AbstractCegarLoop]: Abstraction has 1507 states and 2086 transitions. [2019-10-07 13:53:16,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:53:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2086 transitions. [2019-10-07 13:53:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:53:16,501 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:16,502 INFO L385 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-07 13:53:16,502 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1690877412, now seen corresponding path program 1 times [2019-10-07 13:53:16,502 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:16,503 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:16,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:16,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:17,669 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-07 13:53:17,669 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:17,670 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:17,670 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:53:17,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:53:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:53:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:53:17,671 INFO L87 Difference]: Start difference. First operand 1507 states and 2086 transitions. Second operand 5 states. [2019-10-07 13:53:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:19,324 INFO L93 Difference]: Finished difference Result 2033 states and 2912 transitions. [2019-10-07 13:53:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:53:19,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-07 13:53:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:19,340 INFO L225 Difference]: With dead ends: 2033 [2019-10-07 13:53:19,340 INFO L226 Difference]: Without dead ends: 2015 [2019-10-07 13:53:19,342 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-07 13:53:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-10-07 13:53:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1497. [2019-10-07 13:53:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2019-10-07 13:53:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 2074 transitions. [2019-10-07 13:53:19,570 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 2074 transitions. Word has length 47 [2019-10-07 13:53:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:19,571 INFO L462 AbstractCegarLoop]: Abstraction has 1497 states and 2074 transitions. [2019-10-07 13:53:19,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:53:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 2074 transitions. [2019-10-07 13:53:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:53:19,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:19,572 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:19,572 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 400517174, now seen corresponding path program 1 times [2019-10-07 13:53:19,573 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:19,573 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:19,573 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:19,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:53:20,788 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:20,788 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:20,788 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:53:20,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:53:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:53:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:53:20,790 INFO L87 Difference]: Start difference. First operand 1497 states and 2074 transitions. Second operand 6 states. [2019-10-07 13:53:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:24,988 INFO L93 Difference]: Finished difference Result 1513 states and 2089 transitions. [2019-10-07 13:53:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:53:24,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-10-07 13:53:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:24,997 INFO L225 Difference]: With dead ends: 1513 [2019-10-07 13:53:24,998 INFO L226 Difference]: Without dead ends: 1464 [2019-10-07 13:53:24,999 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:53:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-10-07 13:53:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1450. [2019-10-07 13:53:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2019-10-07 13:53:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2014 transitions. [2019-10-07 13:53:25,078 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2014 transitions. Word has length 48 [2019-10-07 13:53:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 1450 states and 2014 transitions. [2019-10-07 13:53:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:53:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2014 transitions. [2019-10-07 13:53:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:53:25,079 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:25,080 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:25,080 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 448057373, now seen corresponding path program 1 times [2019-10-07 13:53:25,080 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:25,080 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:25,081 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:25,081 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:26,376 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-07 13:53:26,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:26,377 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:26,377 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:53:26,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:53:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:53:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:53:26,378 INFO L87 Difference]: Start difference. First operand 1450 states and 2014 transitions. Second operand 7 states. [2019-10-07 13:53:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:47,119 INFO L93 Difference]: Finished difference Result 2094 states and 3116 transitions. [2019-10-07 13:53:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:53:47,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-10-07 13:53:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:47,134 INFO L225 Difference]: With dead ends: 2094 [2019-10-07 13:53:47,134 INFO L226 Difference]: Without dead ends: 2060 [2019-10-07 13:53:47,138 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:53:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-10-07 13:53:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2055. [2019-10-07 13:53:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-10-07 13:53:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3070 transitions. [2019-10-07 13:53:47,263 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3070 transitions. Word has length 48 [2019-10-07 13:53:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:47,264 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 3070 transitions. [2019-10-07 13:53:47,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:53:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3070 transitions. [2019-10-07 13:53:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:53:47,265 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:47,265 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:53:47,265 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1773492420, now seen corresponding path program 1 times [2019-10-07 13:53:47,266 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:47,266 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:47,266 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:47,266 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:48,608 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-07 13:53:48,609 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:48,609 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:48,609 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:53:48,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:53:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:53:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:53:48,610 INFO L87 Difference]: Start difference. First operand 2055 states and 3070 transitions. Second operand 8 states. [2019-10-07 13:53:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:51,276 INFO L93 Difference]: Finished difference Result 2068 states and 3082 transitions. [2019-10-07 13:53:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:53:51,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-10-07 13:53:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:51,290 INFO L225 Difference]: With dead ends: 2068 [2019-10-07 13:53:51,290 INFO L226 Difference]: Without dead ends: 2048 [2019-10-07 13:53:51,292 INFO L606 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-07 13:53:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-10-07 13:53:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-10-07 13:53:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-07 13:53:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 3061 transitions. [2019-10-07 13:53:51,434 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 3061 transitions. Word has length 48 [2019-10-07 13:53:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:51,434 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 3061 transitions. [2019-10-07 13:53:51,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:53:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 3061 transitions. [2019-10-07 13:53:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:53:51,436 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:51,436 INFO L385 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-07 13:53:51,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash -784482690, now seen corresponding path program 1 times [2019-10-07 13:53:51,437 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:51,437 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:51,437 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:51,437 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:52,630 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-07 13:53:52,631 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:52,631 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:52,631 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:53:52,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:53:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:53:52,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:53:52,633 INFO L87 Difference]: Start difference. First operand 2048 states and 3061 transitions. Second operand 3 states. [2019-10-07 13:53:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:52,922 INFO L93 Difference]: Finished difference Result 2875 states and 4461 transitions. [2019-10-07 13:53:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:53:52,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-07 13:53:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:52,945 INFO L225 Difference]: With dead ends: 2875 [2019-10-07 13:53:52,945 INFO L226 Difference]: Without dead ends: 2862 [2019-10-07 13:53:52,948 INFO L606 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-07 13:53:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-10-07 13:53:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2654. [2019-10-07 13:53:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2019-10-07 13:53:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4056 transitions. [2019-10-07 13:53:53,132 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4056 transitions. Word has length 49 [2019-10-07 13:53:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:53,132 INFO L462 AbstractCegarLoop]: Abstraction has 2654 states and 4056 transitions. [2019-10-07 13:53:53,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:53:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4056 transitions. [2019-10-07 13:53:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:53:53,133 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:53:53,133 INFO L385 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-07 13:53:53,134 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:53:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:53:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1993175891, now seen corresponding path program 1 times [2019-10-07 13:53:53,134 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:53:53,135 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:53,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:53,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:53:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:53:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:53:54,362 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-07 13:53:54,363 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:53:54,363 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:53:54,363 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:53:54,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:53:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:53:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:53:54,364 INFO L87 Difference]: Start difference. First operand 2654 states and 4056 transitions. Second operand 7 states. [2019-10-07 13:54:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:14,989 INFO L93 Difference]: Finished difference Result 3452 states and 5456 transitions. [2019-10-07 13:54:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:54:14,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-10-07 13:54:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:15,015 INFO L225 Difference]: With dead ends: 3452 [2019-10-07 13:54:15,016 INFO L226 Difference]: Without dead ends: 3426 [2019-10-07 13:54:15,019 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:54:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-10-07 13:54:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 2186. [2019-10-07 13:54:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2019-10-07 13:54:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3270 transitions. [2019-10-07 13:54:15,175 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3270 transitions. Word has length 49 [2019-10-07 13:54:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:15,175 INFO L462 AbstractCegarLoop]: Abstraction has 2186 states and 3270 transitions. [2019-10-07 13:54:15,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:54:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3270 transitions. [2019-10-07 13:54:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:54:15,176 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:15,176 INFO L385 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-07 13:54:15,176 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1903662441, now seen corresponding path program 1 times [2019-10-07 13:54:15,177 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:15,177 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:15,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:15,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:16,259 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-07 13:54:16,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:16,259 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:16,260 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:54:16,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:54:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:54:16,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:54:16,267 INFO L87 Difference]: Start difference. First operand 2186 states and 3270 transitions. Second operand 8 states. [2019-10-07 13:54:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:18,969 INFO L93 Difference]: Finished difference Result 2200 states and 3284 transitions. [2019-10-07 13:54:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:54:18,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-07 13:54:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:18,981 INFO L225 Difference]: With dead ends: 2200 [2019-10-07 13:54:18,981 INFO L226 Difference]: Without dead ends: 2196 [2019-10-07 13:54:18,983 INFO L606 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-07 13:54:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2019-10-07 13:54:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2192. [2019-10-07 13:54:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-10-07 13:54:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 3276 transitions. [2019-10-07 13:54:19,114 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 3276 transitions. Word has length 50 [2019-10-07 13:54:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:19,114 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 3276 transitions. [2019-10-07 13:54:19,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:54:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 3276 transitions. [2019-10-07 13:54:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:54:19,118 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:19,118 INFO L385 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-07 13:54:19,118 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1903385611, now seen corresponding path program 1 times [2019-10-07 13:54:19,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:19,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:19,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:19,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:20,172 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-07 13:54:20,173 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:20,173 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:20,173 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:54:20,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:54:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:54:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:54:20,174 INFO L87 Difference]: Start difference. First operand 2192 states and 3276 transitions. Second operand 5 states. [2019-10-07 13:54:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:21,626 INFO L93 Difference]: Finished difference Result 2923 states and 4590 transitions. [2019-10-07 13:54:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:54:21,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-07 13:54:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:21,668 INFO L225 Difference]: With dead ends: 2923 [2019-10-07 13:54:21,668 INFO L226 Difference]: Without dead ends: 2894 [2019-10-07 13:54:21,670 INFO L606 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-07 13:54:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2019-10-07 13:54:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2169. [2019-10-07 13:54:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-10-07 13:54:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3251 transitions. [2019-10-07 13:54:21,828 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3251 transitions. Word has length 50 [2019-10-07 13:54:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:21,828 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 3251 transitions. [2019-10-07 13:54:21,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:54:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3251 transitions. [2019-10-07 13:54:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:54:21,829 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:21,829 INFO L385 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-07 13:54:21,830 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1820217756, now seen corresponding path program 1 times [2019-10-07 13:54:21,830 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:21,830 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:21,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:21,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:22,861 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:22,861 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:22,861 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:54:22,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:54:22,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:54:22,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:54:22,862 INFO L87 Difference]: Start difference. First operand 2169 states and 3251 transitions. Second operand 4 states. [2019-10-07 13:54:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:23,598 INFO L93 Difference]: Finished difference Result 2245 states and 3330 transitions. [2019-10-07 13:54:23,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:54:23,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-07 13:54:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:23,603 INFO L225 Difference]: With dead ends: 2245 [2019-10-07 13:54:23,604 INFO L226 Difference]: Without dead ends: 1141 [2019-10-07 13:54:23,611 INFO L606 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-07 13:54:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-10-07 13:54:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1139. [2019-10-07 13:54:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-10-07 13:54:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1610 transitions. [2019-10-07 13:54:23,680 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1610 transitions. Word has length 57 [2019-10-07 13:54:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:23,680 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1610 transitions. [2019-10-07 13:54:23,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:54:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1610 transitions. [2019-10-07 13:54:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:54:23,681 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:23,681 INFO L385 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-07 13:54:23,681 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash 307472570, now seen corresponding path program 1 times [2019-10-07 13:54:23,682 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:23,682 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:23,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:23,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:24,921 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-07 13:54:24,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:24,922 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:24,922 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:24,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:24,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:24,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:24,923 INFO L87 Difference]: Start difference. First operand 1139 states and 1610 transitions. Second operand 3 states. [2019-10-07 13:54:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:25,008 INFO L93 Difference]: Finished difference Result 1605 states and 2336 transitions. [2019-10-07 13:54:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:25,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-07 13:54:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:25,011 INFO L225 Difference]: With dead ends: 1605 [2019-10-07 13:54:25,012 INFO L226 Difference]: Without dead ends: 557 [2019-10-07 13:54:25,018 INFO L606 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-07 13:54:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-07 13:54:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554. [2019-10-07 13:54:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-07 13:54:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 765 transitions. [2019-10-07 13:54:25,052 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 765 transitions. Word has length 62 [2019-10-07 13:54:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:25,052 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 765 transitions. [2019-10-07 13:54:25,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 765 transitions. [2019-10-07 13:54:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:54:25,053 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:25,053 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:54:25,053 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2058418152, now seen corresponding path program 1 times [2019-10-07 13:54:25,054 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:25,054 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:25,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:25,054 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:25,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:26,165 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-07 13:54:26,165 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:26,166 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:26,166 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:54:26,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:54:26,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:54:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:54:26,167 INFO L87 Difference]: Start difference. First operand 554 states and 765 transitions. Second operand 10 states. [2019-10-07 13:54:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:28,842 INFO L93 Difference]: Finished difference Result 556 states and 766 transitions. [2019-10-07 13:54:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:54:28,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-07 13:54:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:28,845 INFO L225 Difference]: With dead ends: 556 [2019-10-07 13:54:28,845 INFO L226 Difference]: Without dead ends: 525 [2019-10-07 13:54:28,845 INFO L606 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-07 13:54:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-07 13:54:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-10-07 13:54:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-10-07 13:54:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 735 transitions. [2019-10-07 13:54:28,880 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 735 transitions. Word has length 56 [2019-10-07 13:54:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:28,880 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 735 transitions. [2019-10-07 13:54:28,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:54:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 735 transitions. [2019-10-07 13:54:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:54:28,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:28,881 INFO L385 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-07 13:54:28,881 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash -972324132, now seen corresponding path program 1 times [2019-10-07 13:54:28,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:28,882 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:28,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:28,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:30,065 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-07 13:54:30,065 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:30,065 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:30,065 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:30,066 INFO L87 Difference]: Start difference. First operand 525 states and 735 transitions. Second operand 3 states. [2019-10-07 13:54:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:30,173 INFO L93 Difference]: Finished difference Result 990 states and 1423 transitions. [2019-10-07 13:54:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:30,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-07 13:54:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:30,175 INFO L225 Difference]: With dead ends: 990 [2019-10-07 13:54:30,176 INFO L226 Difference]: Without dead ends: 524 [2019-10-07 13:54:30,177 INFO L606 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-07 13:54:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-10-07 13:54:30,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-10-07 13:54:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-10-07 13:54:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 732 transitions. [2019-10-07 13:54:30,209 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 732 transitions. Word has length 64 [2019-10-07 13:54:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:30,210 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 732 transitions. [2019-10-07 13:54:30,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 732 transitions. [2019-10-07 13:54:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:54:30,210 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:30,211 INFO L385 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-07 13:54:30,211 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 283618160, now seen corresponding path program 1 times [2019-10-07 13:54:30,211 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:30,211 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:30,211 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:30,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:31,284 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-07 13:54:31,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:31,284 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:31,284 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:31,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:31,286 INFO L87 Difference]: Start difference. First operand 524 states and 732 transitions. Second operand 3 states. [2019-10-07 13:54:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:31,649 INFO L93 Difference]: Finished difference Result 720 states and 1028 transitions. [2019-10-07 13:54:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:31,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-07 13:54:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:31,654 INFO L225 Difference]: With dead ends: 720 [2019-10-07 13:54:31,654 INFO L226 Difference]: Without dead ends: 717 [2019-10-07 13:54:31,655 INFO L606 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-07 13:54:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-07 13:54:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 526. [2019-10-07 13:54:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-07 13:54:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 735 transitions. [2019-10-07 13:54:31,713 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 735 transitions. Word has length 67 [2019-10-07 13:54:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:31,713 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 735 transitions. [2019-10-07 13:54:31,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 735 transitions. [2019-10-07 13:54:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 13:54:31,715 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:31,715 INFO L385 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] [2019-10-07 13:54:31,716 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1437980205, now seen corresponding path program 1 times [2019-10-07 13:54:31,716 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:31,716 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:31,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:31,717 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:33,276 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:33,277 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:33,277 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:54:33,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:54:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:54:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:54:33,278 INFO L87 Difference]: Start difference. First operand 526 states and 735 transitions. Second operand 5 states. [2019-10-07 13:54:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:34,967 INFO L93 Difference]: Finished difference Result 1397 states and 2078 transitions. [2019-10-07 13:54:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:54:34,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-07 13:54:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:34,972 INFO L225 Difference]: With dead ends: 1397 [2019-10-07 13:54:34,973 INFO L226 Difference]: Without dead ends: 933 [2019-10-07 13:54:34,976 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:54:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-10-07 13:54:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 690. [2019-10-07 13:54:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-07 13:54:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1002 transitions. [2019-10-07 13:54:35,034 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1002 transitions. Word has length 82 [2019-10-07 13:54:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:35,034 INFO L462 AbstractCegarLoop]: Abstraction has 690 states and 1002 transitions. [2019-10-07 13:54:35,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:54:35,035 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1002 transitions. [2019-10-07 13:54:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 13:54:35,036 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:35,036 INFO L385 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] [2019-10-07 13:54:35,036 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1764033855, now seen corresponding path program 1 times [2019-10-07 13:54:35,037 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:35,037 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:35,037 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:35,037 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:36,175 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-07 13:54:36,175 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:36,176 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:36,176 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:54:36,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:54:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:54:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:54:36,177 INFO L87 Difference]: Start difference. First operand 690 states and 1002 transitions. Second operand 4 states. [2019-10-07 13:54:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:36,257 INFO L93 Difference]: Finished difference Result 1379 states and 2004 transitions. [2019-10-07 13:54:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:54:36,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-07 13:54:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:36,259 INFO L225 Difference]: With dead ends: 1379 [2019-10-07 13:54:36,259 INFO L226 Difference]: Without dead ends: 696 [2019-10-07 13:54:36,262 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:54:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-10-07 13:54:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 694. [2019-10-07 13:54:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-07 13:54:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1006 transitions. [2019-10-07 13:54:36,316 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1006 transitions. Word has length 82 [2019-10-07 13:54:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:36,317 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1006 transitions. [2019-10-07 13:54:36,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:54:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1006 transitions. [2019-10-07 13:54:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 13:54:36,318 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:36,318 INFO L385 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] [2019-10-07 13:54:36,318 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1957228321, now seen corresponding path program 1 times [2019-10-07 13:54:36,319 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:36,319 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:36,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:36,320 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:54:37,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:37,929 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:37,929 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:54:37,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:54:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:54:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:54:37,931 INFO L87 Difference]: Start difference. First operand 694 states and 1006 transitions. Second operand 4 states. [2019-10-07 13:54:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:38,119 INFO L93 Difference]: Finished difference Result 1342 states and 2039 transitions. [2019-10-07 13:54:38,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:54:38,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-10-07 13:54:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:38,123 INFO L225 Difference]: With dead ends: 1342 [2019-10-07 13:54:38,123 INFO L226 Difference]: Without dead ends: 704 [2019-10-07 13:54:38,126 INFO L606 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-07 13:54:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-07 13:54:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-10-07 13:54:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-10-07 13:54:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1025 transitions. [2019-10-07 13:54:38,182 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1025 transitions. Word has length 86 [2019-10-07 13:54:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:38,182 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1025 transitions. [2019-10-07 13:54:38,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:54:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1025 transitions. [2019-10-07 13:54:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-07 13:54:38,183 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:38,183 INFO L385 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-07 13:54:38,184 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:38,184 INFO L82 PathProgramCache]: Analyzing trace with hash 128700659, now seen corresponding path program 1 times [2019-10-07 13:54:38,184 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:38,184 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:38,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:38,185 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:39,515 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-07 13:54:39,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:39,516 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:39,516 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:54:39,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:54:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:54:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:54:39,517 INFO L87 Difference]: Start difference. First operand 704 states and 1025 transitions. Second operand 4 states. [2019-10-07 13:54:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:39,636 INFO L93 Difference]: Finished difference Result 1363 states and 2080 transitions. [2019-10-07 13:54:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:54:39,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-07 13:54:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:39,640 INFO L225 Difference]: With dead ends: 1363 [2019-10-07 13:54:39,640 INFO L226 Difference]: Without dead ends: 717 [2019-10-07 13:54:39,643 INFO L606 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-07 13:54:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-07 13:54:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 708. [2019-10-07 13:54:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-07 13:54:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1032 transitions. [2019-10-07 13:54:39,699 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1032 transitions. Word has length 87 [2019-10-07 13:54:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:39,699 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1032 transitions. [2019-10-07 13:54:39,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:54:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1032 transitions. [2019-10-07 13:54:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 13:54:39,701 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:39,701 INFO L385 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, 1] [2019-10-07 13:54:39,702 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash -669015203, now seen corresponding path program 1 times [2019-10-07 13:54:39,702 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:39,703 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:39,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:39,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-07 13:54:41,278 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:41,278 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:54:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:54:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:43,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 5680 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 13:54:43,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:54:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:54:43,461 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:54:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 13:54:43,619 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:54:43,653 INFO L162 IcfgInterpreter]: Started Sifa with 83 locations of interest [2019-10-07 13:54:43,653 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:54:43,659 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:54:43,668 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:54:43,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:54:47,326 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 3257 [2019-10-07 13:54:48,551 WARN L191 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 3263 [2019-10-07 13:54:49,589 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification that was a NOOP. DAG size: 3269 [2019-10-07 13:54:50,659 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 3275 [2019-10-07 13:54:51,918 WARN L191 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 3281 [2019-10-07 13:54:52,992 WARN L191 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 3287 [2019-10-07 13:54:54,821 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 3293 [2019-10-07 13:54:55,920 WARN L191 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 3299 [2019-10-07 13:54:57,022 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 3305 [2019-10-07 13:54:58,186 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 3311 [2019-10-07 13:54:59,310 WARN L191 SmtUtils]: Spent 827.00 ms on a formula simplification that was a NOOP. DAG size: 3317 [2019-10-07 13:55:00,449 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 3323 [2019-10-07 13:55:01,679 WARN L191 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 3329 [2019-10-07 13:55:02,852 WARN L191 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 3335 [2019-10-07 13:55:04,085 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 3341 [2019-10-07 13:55:05,287 WARN L191 SmtUtils]: Spent 907.00 ms on a formula simplification that was a NOOP. DAG size: 3347 [2019-10-07 13:55:06,500 WARN L191 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 3353 [2019-10-07 13:55:07,734 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 3359 [2019-10-07 13:55:08,970 WARN L191 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 3365 [2019-10-07 13:55:10,240 WARN L191 SmtUtils]: Spent 973.00 ms on a formula simplification that was a NOOP. DAG size: 3371 [2019-10-07 13:55:11,568 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 3377 [2019-10-07 13:55:12,862 WARN L191 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 3383 [2019-10-07 13:55:14,183 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 3389 [2019-10-07 13:55:15,503 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 3395 [2019-10-07 13:55:16,832 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 3401 [2019-10-07 13:55:18,195 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 3407 [2019-10-07 13:55:19,606 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 3413 [2019-10-07 13:55:21,020 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 3419 [2019-10-07 13:55:22,413 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 3425 [2019-10-07 13:55:23,826 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 3431 [2019-10-07 13:55:25,263 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 3437 [2019-10-07 13:55:26,715 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 3443 [2019-10-07 13:55:28,186 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 3449 [2019-10-07 13:55:29,661 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 3455 [2019-10-07 13:55:31,181 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 3461 [2019-10-07 13:55:32,691 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 3467 [2019-10-07 13:55:34,225 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 3473 [2019-10-07 13:55:35,779 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 3479 [2019-10-07 13:55:37,350 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 3485 [2019-10-07 13:55:38,928 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 3491 [2019-10-07 13:55:40,536 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 3497 [2019-10-07 13:55:42,155 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 3503 [2019-10-07 13:55:43,805 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 3509 [2019-10-07 13:55:45,452 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 3515 [2019-10-07 13:55:47,145 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 3521 [2019-10-07 13:55:48,829 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 3527 [2019-10-07 13:55:50,545 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 3533 [2019-10-07 13:55:52,292 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 3539 [2019-10-07 13:55:54,036 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 3545 [2019-10-07 13:55:55,793 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 3551 [2019-10-07 13:55:57,594 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 3557 [2019-10-07 13:55:59,399 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 3563 [2019-10-07 13:56:01,221 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 3569 [2019-10-07 13:56:03,052 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 3575 [2019-10-07 13:56:04,916 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 3581 [2019-10-07 13:56:06,806 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 3587 [2019-10-07 13:56:08,710 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 3593 [2019-10-07 13:56:10,638 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 3599 [2019-10-07 13:56:12,581 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 3605 [2019-10-07 13:56:14,578 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 3611 [2019-10-07 13:56:16,577 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 3617 [2019-10-07 13:56:18,581 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 3623 [2019-10-07 13:56:20,617 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 3629 [2019-10-07 13:56:22,683 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 3635 [2019-10-07 13:56:24,752 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 3641 [2019-10-07 13:56:26,864 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 3647 [2019-10-07 13:56:28,979 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 3653 [2019-10-07 13:56:31,111 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 3659 [2019-10-07 13:56:33,281 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 3665 [2019-10-07 13:56:35,457 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 3671 [2019-10-07 13:56:37,670 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 3677 [2019-10-07 13:56:39,892 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 3683 [2019-10-07 13:56:42,143 WARN L191 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 3689 [2019-10-07 13:56:44,424 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 3695 [2019-10-07 13:56:46,710 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 3701 [2019-10-07 13:56:49,033 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 3707 [2019-10-07 13:56:51,373 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 3713 [2019-10-07 13:56:53,775 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 3719 [2019-10-07 13:56:56,154 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 3725 [2019-10-07 13:56:58,556 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 3731 [2019-10-07 13:57:00,965 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 3737 [2019-10-07 13:57:03,407 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 3743 [2019-10-07 13:57:05,860 WARN L191 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 3749 [2019-10-07 13:57:08,348 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 3755 [2019-10-07 13:57:10,851 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 3761 [2019-10-07 13:57:13,409 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 3767 [2019-10-07 13:57:15,965 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 3773 [2019-10-07 13:57:18,541 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 3779 [2019-10-07 13:57:21,124 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 3785 [2019-10-07 13:57:23,745 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 3791 [2019-10-07 13:57:26,413 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 3797 [2019-10-07 13:57:29,100 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 3803 [2019-10-07 13:57:31,788 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 3809 [2019-10-07 13:57:34,503 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 3815 [2019-10-07 13:57:37,243 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 3821 [2019-10-07 13:57:40,018 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 3827 [2019-10-07 13:57:42,823 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 3833 [2019-10-07 13:57:45,664 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 3839 [2019-10-07 13:57:48,542 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 3845 [2019-10-07 13:57:51,413 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 3851 [2019-10-07 13:57:54,320 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 3857 [2019-10-07 13:57:57,279 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 3863 [2019-10-07 13:58:00,272 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification that was a NOOP. DAG size: 3869 [2019-10-07 13:58:03,292 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 3875 [2019-10-07 13:58:06,354 WARN L191 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 3881 [2019-10-07 13:58:09,446 WARN L191 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 3887 [2019-10-07 13:58:12,548 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification that was a NOOP. DAG size: 3893 [2019-10-07 13:58:15,692 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 3899 [2019-10-07 13:58:18,849 WARN L191 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 3905 [2019-10-07 13:58:22,053 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 3911 [2019-10-07 13:58:25,251 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 3917 [2019-10-07 13:58:28,489 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification that was a NOOP. DAG size: 3923 [2019-10-07 13:58:31,762 WARN L191 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 3929 [2019-10-07 13:58:35,043 WARN L191 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 3935 [2019-10-07 13:58:38,350 WARN L191 SmtUtils]: Spent 3.05 s on a formula simplification that was a NOOP. DAG size: 3941 [2019-10-07 13:58:41,649 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification that was a NOOP. DAG size: 3947 [2019-10-07 13:58:45,021 WARN L191 SmtUtils]: Spent 3.11 s on a formula simplification that was a NOOP. DAG size: 3953 [2019-10-07 13:58:48,387 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification that was a NOOP. DAG size: 3959 [2019-10-07 13:58:51,787 WARN L191 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 3965 [2019-10-07 13:58:55,194 WARN L191 SmtUtils]: Spent 3.16 s on a formula simplification that was a NOOP. DAG size: 3971 [2019-10-07 13:58:58,683 WARN L191 SmtUtils]: Spent 3.23 s on a formula simplification that was a NOOP. DAG size: 3977 [2019-10-07 13:59:02,210 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification that was a NOOP. DAG size: 3983 [2019-10-07 13:59:05,745 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification that was a NOOP. DAG size: 3989 [2019-10-07 13:59:09,282 WARN L191 SmtUtils]: Spent 3.29 s on a formula simplification that was a NOOP. DAG size: 3995 [2019-10-07 13:59:12,854 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification that was a NOOP. DAG size: 4001 [2019-10-07 13:59:16,431 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification that was a NOOP. DAG size: 4007 [2019-10-07 13:59:20,036 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification that was a NOOP. DAG size: 4013 [2019-10-07 13:59:23,686 WARN L191 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 4019 [2019-10-07 13:59:27,363 WARN L191 SmtUtils]: Spent 3.42 s on a formula simplification that was a NOOP. DAG size: 4025 [2019-10-07 13:59:31,048 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification that was a NOOP. DAG size: 4031 [2019-10-07 13:59:34,807 WARN L191 SmtUtils]: Spent 3.50 s on a formula simplification that was a NOOP. DAG size: 4037 [2019-10-07 13:59:38,591 WARN L191 SmtUtils]: Spent 3.53 s on a formula simplification that was a NOOP. DAG size: 4043 [2019-10-07 13:59:42,402 WARN L191 SmtUtils]: Spent 3.56 s on a formula simplification that was a NOOP. DAG size: 4049 [2019-10-07 13:59:46,221 WARN L191 SmtUtils]: Spent 3.57 s on a formula simplification that was a NOOP. DAG size: 4055 [2019-10-07 13:59:50,099 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification that was a NOOP. DAG size: 4061 [2019-10-07 13:59:53,994 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification that was a NOOP. DAG size: 4067 [2019-10-07 13:59:57,978 WARN L191 SmtUtils]: Spent 3.70 s on a formula simplification that was a NOOP. DAG size: 4073 [2019-10-07 14:00:02,028 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification that was a NOOP. DAG size: 4079 [2019-10-07 14:00:06,042 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 4085 [2019-10-07 14:00:10,070 WARN L191 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 4091 [2019-10-07 14:00:14,106 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification that was a NOOP. DAG size: 4097 [2019-10-07 14:00:18,197 WARN L191 SmtUtils]: Spent 3.85 s on a formula simplification that was a NOOP. DAG size: 4103 [2019-10-07 14:00:22,292 WARN L191 SmtUtils]: Spent 3.85 s on a formula simplification that was a NOOP. DAG size: 4109 [2019-10-07 14:00:26,426 WARN L191 SmtUtils]: Spent 3.89 s on a formula simplification that was a NOOP. DAG size: 4115 [2019-10-07 14:00:30,603 WARN L191 SmtUtils]: Spent 3.93 s on a formula simplification that was a NOOP. DAG size: 4121 [2019-10-07 14:00:34,806 WARN L191 SmtUtils]: Spent 3.96 s on a formula simplification that was a NOOP. DAG size: 4127 [2019-10-07 14:00:39,022 WARN L191 SmtUtils]: Spent 3.97 s on a formula simplification that was a NOOP. DAG size: 4133 [2019-10-07 14:00:43,272 WARN L191 SmtUtils]: Spent 4.00 s on a formula simplification that was a NOOP. DAG size: 4139 [2019-10-07 14:00:47,599 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 4145 [2019-10-07 14:00:51,934 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 4151 [2019-10-07 14:00:56,265 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 4157 [2019-10-07 14:01:00,606 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 4163 [2019-10-07 14:01:05,017 WARN L191 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 4169 [2019-10-07 14:01:09,421 WARN L191 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 4175 [2019-10-07 14:01:14,440 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 4182 [2019-10-07 14:01:18,930 WARN L191 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 4188 [2019-10-07 14:01:23,459 WARN L191 SmtUtils]: Spent 4.28 s on a formula simplification that was a NOOP. DAG size: 4194 [2019-10-07 14:01:28,002 WARN L191 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 4200 [2019-10-07 14:01:32,580 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 4206 [2019-10-07 14:01:37,175 WARN L191 SmtUtils]: Spent 4.36 s on a formula simplification that was a NOOP. DAG size: 4212 [2019-10-07 14:01:41,828 WARN L191 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 4218 [2019-10-07 14:01:46,529 WARN L191 SmtUtils]: Spent 4.47 s on a formula simplification that was a NOOP. DAG size: 4224 [2019-10-07 14:01:47,663 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-07 14:01:52,151 WARN L191 SmtUtils]: Spent 4.48 s on a formula simplification that was a NOOP. DAG size: 4228 [2019-10-07 14:01:56,703 WARN L191 SmtUtils]: Spent 4.54 s on a formula simplification that was a NOOP. DAG size: 4228 [2019-10-07 14:02:01,244 WARN L191 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 4228 [2019-10-07 14:02:02,670 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 1755 [2019-10-07 14:02:13,869 WARN L191 SmtUtils]: Spent 11.19 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:02:25,166 WARN L191 SmtUtils]: Spent 11.23 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:02:36,465 WARN L191 SmtUtils]: Spent 11.29 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:02:37,911 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 1755 [2019-10-07 14:02:48,998 WARN L191 SmtUtils]: Spent 11.08 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:03:09,364 WARN L191 SmtUtils]: Spent 20.24 s on a formula simplification. DAG size of input: 5266 DAG size of output: 5264 [2019-10-07 14:03:20,967 WARN L191 SmtUtils]: Spent 11.59 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:03:22,583 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 1755 [2019-10-07 14:03:34,102 WARN L191 SmtUtils]: Spent 11.52 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:03:45,455 WARN L191 SmtUtils]: Spent 11.33 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:03:56,736 WARN L191 SmtUtils]: Spent 11.27 s on a formula simplification that was a NOOP. DAG size: 5264 [2019-10-07 14:03:58,156 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 1755