java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:38:23,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:38:23,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:38:23,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:38:23,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:38:23,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:38:23,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:38:23,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:38:23,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:38:23,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:38:23,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:38:23,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:38:23,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:38:23,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:38:23,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:38:23,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:38:23,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:38:23,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:38:23,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:38:23,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:38:23,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:38:23,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:38:23,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:38:23,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:38:23,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:38:23,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:38:23,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:38:23,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:38:23,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:38:23,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:38:23,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:38:23,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:38:23,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:38:23,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:38:23,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:38:23,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:38:23,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:38:23,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:38:23,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:38:23,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:38:23,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:38:23,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:38:23,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:38:23,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:38:23,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:38:23,511 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:38:23,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:38:23,512 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:38:23,512 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:38:23,513 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:38:23,513 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:38:23,513 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:38:23,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:38:23,514 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:38:23,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:38:23,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:38:23,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:38:23,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:38:23,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:38:23,515 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:38:23,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:38:23,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:38:23,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:38:23,516 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:38:23,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:38:23,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:23,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:38:23,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:38:23,517 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:38:23,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:38:23,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:38:23,518 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:38:23,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:38:23,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:38:23,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:38:23,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:38:23,573 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:38:23,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-10-03 02:38:23,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac92532d/6c6fdc39dd4d443db94c37dd26ed77af/FLAG754e29b7b [2019-10-03 02:38:24,544 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:38:24,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-10-03 02:38:24,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac92532d/6c6fdc39dd4d443db94c37dd26ed77af/FLAG754e29b7b [2019-10-03 02:38:24,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac92532d/6c6fdc39dd4d443db94c37dd26ed77af [2019-10-03 02:38:24,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:38:24,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:38:24,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:24,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:38:24,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:38:24,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:24" (1/1) ... [2019-10-03 02:38:24,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd5ecef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:24, skipping insertion in model container [2019-10-03 02:38:24,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:24" (1/1) ... [2019-10-03 02:38:24,964 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:38:25,143 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:38:27,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:27,421 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:38:27,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:28,187 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:38:28,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28 WrapperNode [2019-10-03 02:38:28,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:28,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:38:28,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:38:28,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:38:28,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... [2019-10-03 02:38:28,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:38:28,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:38:28,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:38:28,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:38:28,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:28,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:38:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:38:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-03 02:38:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-03 02:38:28,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~TO~VOID [2019-10-03 02:38:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-10-03 02:38:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlIntegerToUnicodeString [2019-10-03 02:38:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlUnicodeStringToInteger [2019-10-03 02:38:28,940 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2019-10-03 02:38:28,941 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAppendUnicodeStringToString [2019-10-03 02:38:28,941 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2019-10-03 02:38:28,941 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2019-10-03 02:38:28,942 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-03 02:38:28,943 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-03 02:38:28,943 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-10-03 02:38:28,944 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeDpc [2019-10-03 02:38:28,944 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInsertQueueDpc [2019-10-03 02:38:28,944 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2019-10-03 02:38:28,944 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2019-10-03 02:38:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireCancelSpinLock [2019-10-03 02:38:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-10-03 02:38:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2019-10-03 02:38:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2019-10-03 02:38:28,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IoInitializeRemoveLockEx [2019-10-03 02:38:28,946 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2019-10-03 02:38:28,946 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2019-10-03 02:38:28,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfReferenceObject [2019-10-03 02:38:28,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwQueryValueKey [2019-10-03 02:38:28,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwSetValueKey [2019-10-03 02:38:28,948 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-10-03 02:38:28,948 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:38:28,948 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2019-10-03 02:38:28,949 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2019-10-03 02:38:28,949 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2019-10-03 02:38:28,949 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2019-10-03 02:38:28,949 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2019-10-03 02:38:28,949 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2019-10-03 02:38:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpPptRemovalRelationsStruct [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2019-10-03 02:38:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2019-10-03 02:38:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2019-10-03 02:38:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2019-10-03 02:38:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2019-10-03 02:38:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2019-10-03 02:38:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2019-10-03 02:38:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2019-10-03 02:38:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2019-10-03 02:38:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2019-10-03 02:38:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2019-10-03 02:38:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2019-10-03 02:38:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2019-10-03 02:38:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2019-10-03 02:38:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2019-10-03 02:38:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2019-10-03 02:38:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2019-10-03 02:38:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2019-10-03 02:38:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2019-10-03 02:38:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2019-10-03 02:38:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2019-10-03 02:38:28,958 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2019-10-03 02:38:28,958 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2019-10-03 02:38:28,959 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpInitDispatchFunctionTable [2019-10-03 02:38:28,959 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpAddDevice [2019-10-03 02:38:28,959 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2019-10-03 02:38:28,959 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-03 02:38:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2019-10-03 02:38:28,961 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2019-10-03 02:38:28,962 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2019-10-03 02:38:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2019-10-03 02:38:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2019-10-03 02:38:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2019-10-03 02:38:28,963 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2019-10-03 02:38:28,964 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2019-10-03 02:38:28,964 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2019-10-03 02:38:28,964 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2019-10-03 02:38:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2019-10-03 02:38:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegInitDriverSettings [2019-10-03 02:38:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegGetDeviceParameterDword [2019-10-03 02:38:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegSetDeviceParameterDword [2019-10-03 02:38:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2019-10-03 02:38:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2019-10-03 02:38:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPreProcessIrp [2019-10-03 02:38:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPostProcessIrp [2019-10-03 02:38:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2019-10-03 02:38:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-03 02:38:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedRead [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedQueue [2019-10-03 02:38:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDisconnect [2019-10-03 02:38:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCancelRoutine [2019-10-03 02:38:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortDpc [2019-10-03 02:38:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePortAtInterruptLevel [2019-10-03 02:38:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortFromInterruptLevel [2019-10-03 02:38:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInterruptService [2019-10-03 02:38:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePort [2019-10-03 02:38:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTraversePortCheckList [2019-10-03 02:38:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2019-10-03 02:38:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure PptQueryNumWaiters [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildParallelPortDeviceName [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitializeDeviceExtension [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNumberFromLptName [2019-10-03 02:38:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildDeviceObject [2019-10-03 02:38:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2019-10-03 02:38:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2019-10-03 02:38:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiRegInfo [2019-10-03 02:38:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiDataBlock [2019-10-03 02:38:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-03 02:38:28,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-03 02:38:28,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-03 02:38:28,985 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:38:28,986 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-03 02:38:28,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-03 02:38:28,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-03 02:38:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-03 02:38:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-10-03 02:38:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2019-10-03 02:38:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 02:38:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-03 02:38:28,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-03 02:38:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:38:28,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-03 02:38:28,992 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure RtlIntegerToUnicodeString [2019-10-03 02:38:28,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlUnicodeStringToInteger [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-03 02:38:28,994 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAppendUnicodeStringToString [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-10-03 02:38:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeDpc [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeInsertQueueDpc [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-03 02:38:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-03 02:38:28,997 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:38:28,997 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-03 02:38:28,998 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-03 02:38:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2019-10-03 02:38:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-03 02:38:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-03 02:38:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-03 02:38:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-03 02:38:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-03 02:38:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-03 02:38:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-03 02:38:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-03 02:38:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireCancelSpinLock [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-10-03 02:38:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2019-10-03 02:38:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-03 02:38:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoInitializeRemoveLockEx [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2019-10-03 02:38:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:38:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ObfReferenceObject [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ZwQueryValueKey [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ZwSetValueKey [2019-10-03 02:38:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpInitDispatchFunctionTable [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpAddDevice [2019-10-03 02:38:29,013 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPreProcessIrp [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPostProcessIrp [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2019-10-03 02:38:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedRead [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedQueue [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDisconnect [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptCancelRoutine [2019-10-03 02:38:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortDpc [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePortAtInterruptLevel [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortFromInterruptLevel [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptInterruptService [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePort [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptTraversePortCheckList [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptQueryNumWaiters [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2019-10-03 02:38:29,016 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegInitDriverSettings [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2019-10-03 02:38:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2019-10-03 02:38:29,018 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2019-10-03 02:38:29,019 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegGetDeviceParameterDword [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegSetDeviceParameterDword [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildParallelPortDeviceName [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitializeDeviceExtension [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNumberFromLptName [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildDeviceObject [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2019-10-03 02:38:29,020 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2019-10-03 02:38:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:38:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-03 02:38:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpPptRemovalRelationsStruct [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2019-10-03 02:38:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2019-10-03 02:38:29,023 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2019-10-03 02:38:29,024 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2019-10-03 02:38:29,025 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2019-10-03 02:38:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2019-10-03 02:38:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2019-10-03 02:38:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2019-10-03 02:38:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2019-10-03 02:38:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-03 02:38:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2019-10-03 02:38:29,028 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~TO~VOID [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiRegInfo [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiDataBlock [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:38:29,029 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:38:29,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-03 02:38:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-03 02:38:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-03 02:38:29,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-03 02:38:30,332 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:30,388 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:30,388 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:30,602 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:41,999 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-10-03 02:38:42,000 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-10-03 02:38:42,041 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:47,822 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:38:47,823 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:38:47,823 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:47,843 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:47,843 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:47,945 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:47,990 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-03 02:38:47,991 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-03 02:38:47,991 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:48,002 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:48,003 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:48,280 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:48,312 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:48,312 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:48,504 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:48,573 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:38:48,573 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:38:48,858 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:51,076 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-03 02:38:51,077 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-03 02:38:51,077 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:51,105 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:38:51,105 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:38:51,136 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:51,149 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:38:51,150 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:38:51,416 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:58,303 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-10-03 02:38:58,303 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-10-03 02:39:00,469 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:00,478 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:00,478 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:00,614 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:00,614 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:06,720 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-03 02:39:06,720 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-10-03 02:39:06,721 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-03 02:39:06,721 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-10-03 02:39:07,007 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:07,016 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:07,016 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:11,971 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:11,989 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:11,989 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,570 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,581 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,582 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,582 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,598 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,598 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,635 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,645 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,645 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,645 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,655 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,655 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,655 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,666 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,666 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,898 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,914 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,914 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:12,931 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:12,942 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:12,943 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:13,079 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:13,088 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:13,089 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:13,112 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:13,122 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:13,122 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:13,813 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:13,822 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:13,822 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:13,836 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:18,805 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-03 02:39:18,805 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-03 02:39:18,819 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:18,926 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-10-03 02:39:18,927 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-10-03 02:39:19,467 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:19,486 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:19,487 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:19,553 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:19,637 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-03 02:39:19,637 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-03 02:39:19,744 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:29,911 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-03 02:39:29,911 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-03 02:39:29,988 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:35,018 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:39:35,018 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:39:35,019 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:35,054 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:39:35,054 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:39:37,203 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:37,220 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:39:37,221 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:39:39,590 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:39,600 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:39:39,600 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:39:39,860 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:39:45,069 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-03 02:39:45,070 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-03 02:39:45,128 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:45,128 INFO L283 CfgBuilder]: Removed 37 assume(true) statements. [2019-10-03 02:39:45,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:45 BoogieIcfgContainer [2019-10-03 02:39:45,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:45,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:45,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:45,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:45,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:38:24" (1/3) ... [2019-10-03 02:39:45,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5638c4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:45, skipping insertion in model container [2019-10-03 02:39:45,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:28" (2/3) ... [2019-10-03 02:39:45,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5638c4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:45, skipping insertion in model container [2019-10-03 02:39:45,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:45" (3/3) ... [2019-10-03 02:39:45,140 INFO L109 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2019-10-03 02:39:45,151 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:45,162 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:45,180 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:45,209 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:45,210 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:45,210 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:45,210 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:45,210 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:45,210 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:45,210 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:45,210 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states. [2019-10-03 02:39:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:39:45,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:45,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:45,281 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash 300354810, now seen corresponding path program 1 times [2019-10-03 02:39:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:45,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:45,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:45,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:45,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:45,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:45,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:46,017 INFO L87 Difference]: Start difference. First operand 2173 states. Second operand 3 states. [2019-10-03 02:39:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:46,423 INFO L93 Difference]: Finished difference Result 1923 states and 2768 transitions. [2019-10-03 02:39:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:46,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:39:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:46,467 INFO L225 Difference]: With dead ends: 1923 [2019-10-03 02:39:46,467 INFO L226 Difference]: Without dead ends: 1907 [2019-10-03 02:39:46,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2019-10-03 02:39:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1907. [2019-10-03 02:39:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-10-03 02:39:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2740 transitions. [2019-10-03 02:39:46,710 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2740 transitions. Word has length 20 [2019-10-03 02:39:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:46,711 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2740 transitions. [2019-10-03 02:39:46,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2740 transitions. [2019-10-03 02:39:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:39:46,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:46,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:46,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash -227578647, now seen corresponding path program 1 times [2019-10-03 02:39:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:46,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:46,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:46,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:46,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:46,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:39:46,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:46,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:39:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:39:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:46,943 INFO L87 Difference]: Start difference. First operand 1907 states and 2740 transitions. Second operand 3 states. [2019-10-03 02:39:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:47,504 INFO L93 Difference]: Finished difference Result 3582 states and 5203 transitions. [2019-10-03 02:39:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:39:47,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:39:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:47,536 INFO L225 Difference]: With dead ends: 3582 [2019-10-03 02:39:47,536 INFO L226 Difference]: Without dead ends: 3581 [2019-10-03 02:39:47,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:39:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-10-03 02:39:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3560. [2019-10-03 02:39:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-10-03 02:39:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5176 transitions. [2019-10-03 02:39:47,753 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5176 transitions. Word has length 30 [2019-10-03 02:39:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:47,754 INFO L475 AbstractCegarLoop]: Abstraction has 3560 states and 5176 transitions. [2019-10-03 02:39:47,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:39:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5176 transitions. [2019-10-03 02:39:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:39:47,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:47,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:47,766 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 833048032, now seen corresponding path program 1 times [2019-10-03 02:39:47,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:47,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:47,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:47,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:48,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-03 02:39:48,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:48,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:39:48,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:48,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:39:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:39:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:48,068 INFO L87 Difference]: Start difference. First operand 3560 states and 5176 transitions. Second operand 5 states. [2019-10-03 02:39:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:54,942 INFO L93 Difference]: Finished difference Result 4323 states and 6278 transitions. [2019-10-03 02:39:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:54,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-03 02:39:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:54,972 INFO L225 Difference]: With dead ends: 4323 [2019-10-03 02:39:54,972 INFO L226 Difference]: Without dead ends: 4323 [2019-10-03 02:39:54,973 INFO L640 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-03 02:39:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-10-03 02:39:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4292. [2019-10-03 02:39:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-03 02:39:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6241 transitions. [2019-10-03 02:39:55,158 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6241 transitions. Word has length 45 [2019-10-03 02:39:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:55,159 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6241 transitions. [2019-10-03 02:39:55,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:39:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6241 transitions. [2019-10-03 02:39:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:39:55,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:55,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:55,163 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:55,164 INFO L82 PathProgramCache]: Analyzing trace with hash -383328916, now seen corresponding path program 1 times [2019-10-03 02:39:55,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:39:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:39:55,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:55,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:39:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:39:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:39:55,428 INFO L87 Difference]: Start difference. First operand 4292 states and 6241 transitions. Second operand 5 states. [2019-10-03 02:40:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:01,724 INFO L93 Difference]: Finished difference Result 4317 states and 6269 transitions. [2019-10-03 02:40:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:40:01,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-03 02:40:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:01,756 INFO L225 Difference]: With dead ends: 4317 [2019-10-03 02:40:01,756 INFO L226 Difference]: Without dead ends: 4317 [2019-10-03 02:40:01,757 INFO L640 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-03 02:40:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-10-03 02:40:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4292. [2019-10-03 02:40:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-03 02:40:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6240 transitions. [2019-10-03 02:40:01,940 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6240 transitions. Word has length 46 [2019-10-03 02:40:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:01,942 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6240 transitions. [2019-10-03 02:40:01,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6240 transitions. [2019-10-03 02:40:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:40:01,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:01,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:01,947 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash 238606324, now seen corresponding path program 1 times [2019-10-03 02:40:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:01,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:02,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:02,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:02,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:02,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:02,214 INFO L87 Difference]: Start difference. First operand 4292 states and 6240 transitions. Second operand 3 states. [2019-10-03 02:40:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:02,357 INFO L93 Difference]: Finished difference Result 6722 states and 9779 transitions. [2019-10-03 02:40:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:02,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 02:40:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:02,400 INFO L225 Difference]: With dead ends: 6722 [2019-10-03 02:40:02,400 INFO L226 Difference]: Without dead ends: 6722 [2019-10-03 02:40:02,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-10-03 02:40:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 6660. [2019-10-03 02:40:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-10-03 02:40:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9703 transitions. [2019-10-03 02:40:02,740 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9703 transitions. Word has length 47 [2019-10-03 02:40:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:02,741 INFO L475 AbstractCegarLoop]: Abstraction has 6660 states and 9703 transitions. [2019-10-03 02:40:02,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9703 transitions. [2019-10-03 02:40:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:40:02,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:02,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:02,744 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash 732695703, now seen corresponding path program 1 times [2019-10-03 02:40:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:02,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:02,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:02,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:02,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:02,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:02,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:02,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:02,903 INFO L87 Difference]: Start difference. First operand 6660 states and 9703 transitions. Second operand 3 states. [2019-10-03 02:40:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:03,017 INFO L93 Difference]: Finished difference Result 6756 states and 9810 transitions. [2019-10-03 02:40:03,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:03,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 02:40:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:03,054 INFO L225 Difference]: With dead ends: 6756 [2019-10-03 02:40:03,054 INFO L226 Difference]: Without dead ends: 6756 [2019-10-03 02:40:03,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-10-03 02:40:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6689. [2019-10-03 02:40:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-10-03 02:40:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9734 transitions. [2019-10-03 02:40:03,393 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9734 transitions. Word has length 47 [2019-10-03 02:40:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:03,394 INFO L475 AbstractCegarLoop]: Abstraction has 6689 states and 9734 transitions. [2019-10-03 02:40:03,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9734 transitions. [2019-10-03 02:40:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:40:03,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:03,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:03,399 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1153041076, now seen corresponding path program 1 times [2019-10-03 02:40:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:03,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:03,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:03,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:03,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:03,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:03,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:03,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:03,639 INFO L87 Difference]: Start difference. First operand 6689 states and 9734 transitions. Second operand 5 states. [2019-10-03 02:40:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:03,725 INFO L93 Difference]: Finished difference Result 6696 states and 9744 transitions. [2019-10-03 02:40:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:03,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-03 02:40:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:03,758 INFO L225 Difference]: With dead ends: 6696 [2019-10-03 02:40:03,759 INFO L226 Difference]: Without dead ends: 6696 [2019-10-03 02:40:03,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-10-03 02:40:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6693. [2019-10-03 02:40:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2019-10-03 02:40:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9739 transitions. [2019-10-03 02:40:04,045 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9739 transitions. Word has length 64 [2019-10-03 02:40:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:04,045 INFO L475 AbstractCegarLoop]: Abstraction has 6693 states and 9739 transitions. [2019-10-03 02:40:04,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9739 transitions. [2019-10-03 02:40:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:40:04,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:04,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:04,048 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash 958249293, now seen corresponding path program 1 times [2019-10-03 02:40:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:04,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:04,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:04,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:04,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:04,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:04,412 INFO L87 Difference]: Start difference. First operand 6693 states and 9739 transitions. Second operand 8 states. [2019-10-03 02:40:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:06,639 INFO L93 Difference]: Finished difference Result 6535 states and 9467 transitions. [2019-10-03 02:40:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:06,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-10-03 02:40:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:06,680 INFO L225 Difference]: With dead ends: 6535 [2019-10-03 02:40:06,681 INFO L226 Difference]: Without dead ends: 6535 [2019-10-03 02:40:06,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2019-10-03 02:40:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6532. [2019-10-03 02:40:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-03 02:40:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9464 transitions. [2019-10-03 02:40:06,940 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9464 transitions. Word has length 64 [2019-10-03 02:40:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:06,940 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9464 transitions. [2019-10-03 02:40:06,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9464 transitions. [2019-10-03 02:40:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:40:06,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:06,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:06,943 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1147187110, now seen corresponding path program 1 times [2019-10-03 02:40:06,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:06,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:06,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:06,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:07,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:07,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:40:07,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:07,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:40:07,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:40:07,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:07,124 INFO L87 Difference]: Start difference. First operand 6532 states and 9464 transitions. Second operand 3 states. [2019-10-03 02:40:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:07,376 INFO L93 Difference]: Finished difference Result 6532 states and 9463 transitions. [2019-10-03 02:40:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:40:07,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 02:40:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:07,412 INFO L225 Difference]: With dead ends: 6532 [2019-10-03 02:40:07,412 INFO L226 Difference]: Without dead ends: 6532 [2019-10-03 02:40:07,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:40:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-10-03 02:40:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6532. [2019-10-03 02:40:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-03 02:40:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9463 transitions. [2019-10-03 02:40:07,759 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9463 transitions. Word has length 47 [2019-10-03 02:40:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:07,759 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9463 transitions. [2019-10-03 02:40:07,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:40:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9463 transitions. [2019-10-03 02:40:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:40:07,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:07,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:07,763 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:07,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1245298868, now seen corresponding path program 1 times [2019-10-03 02:40:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:07,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:07,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40: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-03 02:40:08,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:08,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:08,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:08,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:08,173 INFO L87 Difference]: Start difference. First operand 6532 states and 9463 transitions. Second operand 5 states. [2019-10-03 02:40:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:08,269 INFO L93 Difference]: Finished difference Result 6544 states and 9476 transitions. [2019-10-03 02:40:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:08,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 02:40:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:08,300 INFO L225 Difference]: With dead ends: 6544 [2019-10-03 02:40:08,300 INFO L226 Difference]: Without dead ends: 6506 [2019-10-03 02:40:08,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-10-03 02:40:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6506. [2019-10-03 02:40:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-10-03 02:40:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 9426 transitions. [2019-10-03 02:40:08,576 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 9426 transitions. Word has length 48 [2019-10-03 02:40:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:08,577 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 9426 transitions. [2019-10-03 02:40:08,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 9426 transitions. [2019-10-03 02:40:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:40:08,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:08,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:08,580 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1265177314, now seen corresponding path program 1 times [2019-10-03 02:40:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:08,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:08,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:08,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:08,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:08,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:08,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:08,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:08,829 INFO L87 Difference]: Start difference. First operand 6506 states and 9426 transitions. Second operand 8 states. [2019-10-03 02:40:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:09,030 INFO L93 Difference]: Finished difference Result 6506 states and 9425 transitions. [2019-10-03 02:40:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:09,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-10-03 02:40:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:09,064 INFO L225 Difference]: With dead ends: 6506 [2019-10-03 02:40:09,065 INFO L226 Difference]: Without dead ends: 6506 [2019-10-03 02:40:09,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:40:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-10-03 02:40:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6503. [2019-10-03 02:40:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-10-03 02:40:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9422 transitions. [2019-10-03 02:40:09,365 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9422 transitions. Word has length 48 [2019-10-03 02:40:09,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:09,367 INFO L475 AbstractCegarLoop]: Abstraction has 6503 states and 9422 transitions. [2019-10-03 02:40:09,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9422 transitions. [2019-10-03 02:40:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:40:09,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:09,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:09,370 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1055190255, now seen corresponding path program 1 times [2019-10-03 02:40:09,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:09,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:09,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:09,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:09,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:09,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:09,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:09,542 INFO L87 Difference]: Start difference. First operand 6503 states and 9422 transitions. Second operand 5 states. [2019-10-03 02:40:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:09,641 INFO L93 Difference]: Finished difference Result 6515 states and 9435 transitions. [2019-10-03 02:40:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:09,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-03 02:40:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:09,675 INFO L225 Difference]: With dead ends: 6515 [2019-10-03 02:40:09,676 INFO L226 Difference]: Without dead ends: 6501 [2019-10-03 02:40:09,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2019-10-03 02:40:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 6501. [2019-10-03 02:40:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-10-03 02:40:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9418 transitions. [2019-10-03 02:40:09,995 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9418 transitions. Word has length 52 [2019-10-03 02:40:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:09,995 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9418 transitions. [2019-10-03 02:40:09,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9418 transitions. [2019-10-03 02:40:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:40:09,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:09,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:09,998 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1500953186, now seen corresponding path program 1 times [2019-10-03 02:40:09,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:10,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:10,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:10,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:10,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:10,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:10,267 INFO L87 Difference]: Start difference. First operand 6501 states and 9418 transitions. Second operand 8 states. [2019-10-03 02:40:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:10,499 INFO L93 Difference]: Finished difference Result 6516 states and 9434 transitions. [2019-10-03 02:40:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:10,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-03 02:40:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:10,528 INFO L225 Difference]: With dead ends: 6516 [2019-10-03 02:40:10,528 INFO L226 Difference]: Without dead ends: 6499 [2019-10-03 02:40:10,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-10-03 02:40:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-10-03 02:40:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-10-03 02:40:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9413 transitions. [2019-10-03 02:40:10,773 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9413 transitions. Word has length 52 [2019-10-03 02:40:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:10,773 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9413 transitions. [2019-10-03 02:40:10,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9413 transitions. [2019-10-03 02:40:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:40:10,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:10,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:10,780 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1349184777, now seen corresponding path program 1 times [2019-10-03 02:40:10,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:10,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:11,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:11,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:11,080 INFO L87 Difference]: Start difference. First operand 6499 states and 9413 transitions. Second operand 8 states. [2019-10-03 02:40:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:13,306 INFO L93 Difference]: Finished difference Result 6499 states and 9412 transitions. [2019-10-03 02:40:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:13,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-03 02:40:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:13,336 INFO L225 Difference]: With dead ends: 6499 [2019-10-03 02:40:13,336 INFO L226 Difference]: Without dead ends: 6499 [2019-10-03 02:40:13,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-10-03 02:40:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-10-03 02:40:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-10-03 02:40:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9412 transitions. [2019-10-03 02:40:13,605 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9412 transitions. Word has length 55 [2019-10-03 02:40:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:13,605 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9412 transitions. [2019-10-03 02:40:13,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9412 transitions. [2019-10-03 02:40:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:40:13,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:13,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:13,613 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash -139491608, now seen corresponding path program 1 times [2019-10-03 02:40:13,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:13,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:13,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:13,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:13,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:13,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:13,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:13,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:13,865 INFO L87 Difference]: Start difference. First operand 6499 states and 9412 transitions. Second operand 8 states. [2019-10-03 02:40:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:14,022 INFO L93 Difference]: Finished difference Result 6534 states and 9457 transitions. [2019-10-03 02:40:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:14,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-03 02:40:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:14,052 INFO L225 Difference]: With dead ends: 6534 [2019-10-03 02:40:14,052 INFO L226 Difference]: Without dead ends: 6516 [2019-10-03 02:40:14,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2019-10-03 02:40:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6504. [2019-10-03 02:40:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2019-10-03 02:40:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9417 transitions. [2019-10-03 02:40:14,279 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9417 transitions. Word has length 51 [2019-10-03 02:40:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:14,279 INFO L475 AbstractCegarLoop]: Abstraction has 6504 states and 9417 transitions. [2019-10-03 02:40:14,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9417 transitions. [2019-10-03 02:40:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:40:14,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:14,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:14,282 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 971259367, now seen corresponding path program 1 times [2019-10-03 02:40:14,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:14,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:14,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:14,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:14,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:14,506 INFO L87 Difference]: Start difference. First operand 6504 states and 9417 transitions. Second operand 8 states. [2019-10-03 02:40:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:14,696 INFO L93 Difference]: Finished difference Result 6528 states and 9448 transitions. [2019-10-03 02:40:14,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:14,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-03 02:40:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:14,725 INFO L225 Difference]: With dead ends: 6528 [2019-10-03 02:40:14,725 INFO L226 Difference]: Without dead ends: 6510 [2019-10-03 02:40:14,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-10-03 02:40:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6493. [2019-10-03 02:40:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-10-03 02:40:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 9403 transitions. [2019-10-03 02:40:14,959 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 9403 transitions. Word has length 51 [2019-10-03 02:40:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:14,960 INFO L475 AbstractCegarLoop]: Abstraction has 6493 states and 9403 transitions. [2019-10-03 02:40:14,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 9403 transitions. [2019-10-03 02:40:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:40:14,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:14,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:14,965 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2145606927, now seen corresponding path program 1 times [2019-10-03 02:40:14,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:14,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:14,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:14,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:15,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:15,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:15,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:15,188 INFO L87 Difference]: Start difference. First operand 6493 states and 9403 transitions. Second operand 8 states. [2019-10-03 02:40:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:28,488 INFO L93 Difference]: Finished difference Result 6534 states and 9465 transitions. [2019-10-03 02:40:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:28,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-03 02:40:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:28,514 INFO L225 Difference]: With dead ends: 6534 [2019-10-03 02:40:28,514 INFO L226 Difference]: Without dead ends: 6534 [2019-10-03 02:40:28,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-10-03 02:40:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6501. [2019-10-03 02:40:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-10-03 02:40:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9414 transitions. [2019-10-03 02:40:28,781 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9414 transitions. Word has length 56 [2019-10-03 02:40:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:28,782 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9414 transitions. [2019-10-03 02:40:28,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9414 transitions. [2019-10-03 02:40:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:40:28,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:28,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:28,786 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:28,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1614623444, now seen corresponding path program 1 times [2019-10-03 02:40:28,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:28,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:28,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:28,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:29,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:29,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:40:29,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:29,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:40:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:40:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:29,656 INFO L87 Difference]: Start difference. First operand 6501 states and 9414 transitions. Second operand 5 states. [2019-10-03 02:40:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:29,763 INFO L93 Difference]: Finished difference Result 6513 states and 9427 transitions. [2019-10-03 02:40:29,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:40:29,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 02:40:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:29,792 INFO L225 Difference]: With dead ends: 6513 [2019-10-03 02:40:29,793 INFO L226 Difference]: Without dead ends: 6491 [2019-10-03 02:40:29,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:40:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-10-03 02:40:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 6491. [2019-10-03 02:40:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2019-10-03 02:40:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 9401 transitions. [2019-10-03 02:40:30,156 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 9401 transitions. Word has length 55 [2019-10-03 02:40:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:30,156 INFO L475 AbstractCegarLoop]: Abstraction has 6491 states and 9401 transitions. [2019-10-03 02:40:30,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:40:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 9401 transitions. [2019-10-03 02:40:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:40:30,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:30,159 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:30,160 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash 801916040, now seen corresponding path program 1 times [2019-10-03 02:40:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:30,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:30,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:30,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:40:30,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:30,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:40:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:40:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:40:30,356 INFO L87 Difference]: Start difference. First operand 6491 states and 9401 transitions. Second operand 7 states. [2019-10-03 02:40:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:34,501 INFO L93 Difference]: Finished difference Result 6496 states and 9406 transitions. [2019-10-03 02:40:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:40:34,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-10-03 02:40:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:34,523 INFO L225 Difference]: With dead ends: 6496 [2019-10-03 02:40:34,523 INFO L226 Difference]: Without dead ends: 6496 [2019-10-03 02:40:34,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:40:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-10-03 02:40:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-10-03 02:40:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-10-03 02:40:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 9406 transitions. [2019-10-03 02:40:34,780 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 9406 transitions. Word has length 61 [2019-10-03 02:40:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:34,781 INFO L475 AbstractCegarLoop]: Abstraction has 6496 states and 9406 transitions. [2019-10-03 02:40:34,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:40:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 9406 transitions. [2019-10-03 02:40:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:40:34,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:34,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:34,784 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1827408039, now seen corresponding path program 1 times [2019-10-03 02:40:34,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:40:34,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:34,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:40:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:40:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:40:34,989 INFO L87 Difference]: Start difference. First operand 6496 states and 9406 transitions. Second operand 6 states. [2019-10-03 02:40:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:39,154 INFO L93 Difference]: Finished difference Result 6511 states and 9422 transitions. [2019-10-03 02:40:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:40:39,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-03 02:40:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:39,175 INFO L225 Difference]: With dead ends: 6511 [2019-10-03 02:40:39,176 INFO L226 Difference]: Without dead ends: 6494 [2019-10-03 02:40:39,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:40:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states. [2019-10-03 02:40:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 6489. [2019-10-03 02:40:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6489 states. [2019-10-03 02:40:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 9397 transitions. [2019-10-03 02:40:39,402 INFO L78 Accepts]: Start accepts. Automaton has 6489 states and 9397 transitions. Word has length 61 [2019-10-03 02:40:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:39,402 INFO L475 AbstractCegarLoop]: Abstraction has 6489 states and 9397 transitions. [2019-10-03 02:40:39,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:40:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6489 states and 9397 transitions. [2019-10-03 02:40:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:40:39,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:39,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:39,407 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -372962380, now seen corresponding path program 1 times [2019-10-03 02:40:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:39,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:40:39,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:39,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:40:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:40:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:40:39,615 INFO L87 Difference]: Start difference. First operand 6489 states and 9397 transitions. Second operand 8 states. [2019-10-03 02:40:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:39,820 INFO L93 Difference]: Finished difference Result 6504 states and 9413 transitions. [2019-10-03 02:40:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:40:39,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-10-03 02:40:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:39,847 INFO L225 Difference]: With dead ends: 6504 [2019-10-03 02:40:39,847 INFO L226 Difference]: Without dead ends: 6482 [2019-10-03 02:40:39,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-10-03 02:40:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2019-10-03 02:40:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-10-03 02:40:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 9382 transitions. [2019-10-03 02:40:40,094 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 9382 transitions. Word has length 60 [2019-10-03 02:40:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:40,096 INFO L475 AbstractCegarLoop]: Abstraction has 6482 states and 9382 transitions. [2019-10-03 02:40:40,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:40:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 9382 transitions. [2019-10-03 02:40:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:40:40,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:40,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:40,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1233382885, now seen corresponding path program 1 times [2019-10-03 02:40:40,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:40,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:40,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:40,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:40,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:40:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:40:40,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:40:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:40:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:40:40,344 INFO L87 Difference]: Start difference. First operand 6482 states and 9382 transitions. Second operand 9 states. [2019-10-03 02:43:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:43,034 INFO L93 Difference]: Finished difference Result 7654 states and 11096 transitions. [2019-10-03 02:43:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:43:43,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-03 02:43:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:43,061 INFO L225 Difference]: With dead ends: 7654 [2019-10-03 02:43:43,062 INFO L226 Difference]: Without dead ends: 7654 [2019-10-03 02:43:43,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:43:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7654 states. [2019-10-03 02:43:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7654 to 6490. [2019-10-03 02:43:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-10-03 02:43:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 9388 transitions. [2019-10-03 02:43:43,395 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 9388 transitions. Word has length 61 [2019-10-03 02:43:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:43,396 INFO L475 AbstractCegarLoop]: Abstraction has 6490 states and 9388 transitions. [2019-10-03 02:43:43,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:43:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 9388 transitions. [2019-10-03 02:43:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:43:43,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:43,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:43,403 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash -351171645, now seen corresponding path program 1 times [2019-10-03 02:43:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:43,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:43,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:43,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:43:43,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:43,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:43:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:43:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:43:43,542 INFO L87 Difference]: Start difference. First operand 6490 states and 9388 transitions. Second operand 3 states. [2019-10-03 02:43:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:49,203 INFO L93 Difference]: Finished difference Result 6513 states and 9423 transitions. [2019-10-03 02:43:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:43:49,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-03 02:43:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:49,228 INFO L225 Difference]: With dead ends: 6513 [2019-10-03 02:43:49,228 INFO L226 Difference]: Without dead ends: 6513 [2019-10-03 02:43:49,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:43:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2019-10-03 02:43:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 6486. [2019-10-03 02:43:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2019-10-03 02:43:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 9380 transitions. [2019-10-03 02:43:49,425 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 9380 transitions. Word has length 64 [2019-10-03 02:43:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:49,426 INFO L475 AbstractCegarLoop]: Abstraction has 6486 states and 9380 transitions. [2019-10-03 02:43:49,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:43:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 9380 transitions. [2019-10-03 02:43:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 02:43:49,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:49,430 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:49,430 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2025557598, now seen corresponding path program 1 times [2019-10-03 02:43:49,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:49,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:49,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:49,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:49,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:43:49,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:49,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:43:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:43:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:49,631 INFO L87 Difference]: Start difference. First operand 6486 states and 9380 transitions. Second operand 8 states. [2019-10-03 02:43:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:56,235 INFO L93 Difference]: Finished difference Result 5666 states and 8155 transitions. [2019-10-03 02:43:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:43:56,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-10-03 02:43:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:56,255 INFO L225 Difference]: With dead ends: 5666 [2019-10-03 02:43:56,255 INFO L226 Difference]: Without dead ends: 5664 [2019-10-03 02:43:56,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2019-10-03 02:43:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5613. [2019-10-03 02:43:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-10-03 02:43:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 8089 transitions. [2019-10-03 02:43:56,461 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 8089 transitions. Word has length 78 [2019-10-03 02:43:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:56,462 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 8089 transitions. [2019-10-03 02:43:56,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:43:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 8089 transitions. [2019-10-03 02:43:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 02:43:56,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:56,471 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:56,471 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 308442726, now seen corresponding path program 1 times [2019-10-03 02:43:56,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:56,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:56,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:56,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:56,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:56,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:43:56,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:56,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:43:56,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:43:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:43:56,698 INFO L87 Difference]: Start difference. First operand 5613 states and 8089 transitions. Second operand 8 states. [2019-10-03 02:43:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:56,837 INFO L93 Difference]: Finished difference Result 5605 states and 8078 transitions. [2019-10-03 02:43:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:43:56,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-10-03 02:43:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:56,864 INFO L225 Difference]: With dead ends: 5605 [2019-10-03 02:43:56,864 INFO L226 Difference]: Without dead ends: 5603 [2019-10-03 02:43:56,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-10-03 02:43:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5603. [2019-10-03 02:43:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5603 states. [2019-10-03 02:43:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 8076 transitions. [2019-10-03 02:43:57,041 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 8076 transitions. Word has length 71 [2019-10-03 02:43:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:57,042 INFO L475 AbstractCegarLoop]: Abstraction has 5603 states and 8076 transitions. [2019-10-03 02:43:57,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:43:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 8076 transitions. [2019-10-03 02:43:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:43:57,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:57,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:57,048 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1562784128, now seen corresponding path program 1 times [2019-10-03 02:43:57,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:57,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:57,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:43:57,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:57,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:43:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:43:57,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:43:57,167 INFO L87 Difference]: Start difference. First operand 5603 states and 8076 transitions. Second operand 3 states. [2019-10-03 02:43:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:57,348 INFO L93 Difference]: Finished difference Result 6892 states and 9933 transitions. [2019-10-03 02:43:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:43:57,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-03 02:43:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:57,372 INFO L225 Difference]: With dead ends: 6892 [2019-10-03 02:43:57,373 INFO L226 Difference]: Without dead ends: 6892 [2019-10-03 02:43:57,373 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:43:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6892 states. [2019-10-03 02:43:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6892 to 5729. [2019-10-03 02:43:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-10-03 02:43:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8220 transitions. [2019-10-03 02:43:57,615 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8220 transitions. Word has length 63 [2019-10-03 02:43:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:57,615 INFO L475 AbstractCegarLoop]: Abstraction has 5729 states and 8220 transitions. [2019-10-03 02:43:57,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:43:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8220 transitions. [2019-10-03 02:43:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:43:57,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:57,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:57,621 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:57,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1295748992, now seen corresponding path program 1 times [2019-10-03 02:43:57,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:57,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:43:57,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:57,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:43:57,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:57,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:43:57,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:43:57,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:43:57,847 INFO L87 Difference]: Start difference. First operand 5729 states and 8220 transitions. Second operand 7 states. [2019-10-03 02:44:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:55,328 INFO L93 Difference]: Finished difference Result 5583 states and 8045 transitions. [2019-10-03 02:44:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:44:55,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-10-03 02:44:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:55,342 INFO L225 Difference]: With dead ends: 5583 [2019-10-03 02:44:55,343 INFO L226 Difference]: Without dead ends: 5583 [2019-10-03 02:44:55,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:44:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2019-10-03 02:44:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5569. [2019-10-03 02:44:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-10-03 02:44:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8030 transitions. [2019-10-03 02:44:55,490 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 8030 transitions. Word has length 63 [2019-10-03 02:44:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:55,490 INFO L475 AbstractCegarLoop]: Abstraction has 5569 states and 8030 transitions. [2019-10-03 02:44:55,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 8030 transitions. [2019-10-03 02:44:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 02:44:55,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:55,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:55,494 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 91646988, now seen corresponding path program 1 times [2019-10-03 02:44:55,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:55,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:55,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:55,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:55,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:44:55,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:55,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:44:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:44:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:44:55,788 INFO L87 Difference]: Start difference. First operand 5569 states and 8030 transitions. Second operand 11 states. [2019-10-03 02:44:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:58,051 INFO L93 Difference]: Finished difference Result 5585 states and 8047 transitions. [2019-10-03 02:44:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:44:58,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-10-03 02:44:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:58,066 INFO L225 Difference]: With dead ends: 5585 [2019-10-03 02:44:58,066 INFO L226 Difference]: Without dead ends: 5560 [2019-10-03 02:44:58,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:44:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2019-10-03 02:44:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5560. [2019-10-03 02:44:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5560 states. [2019-10-03 02:44:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 8019 transitions. [2019-10-03 02:44:58,187 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 8019 transitions. Word has length 73 [2019-10-03 02:44:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:58,187 INFO L475 AbstractCegarLoop]: Abstraction has 5560 states and 8019 transitions. [2019-10-03 02:44:58,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:44:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 8019 transitions. [2019-10-03 02:44:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:44:58,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:58,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:58,191 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:58,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1653205276, now seen corresponding path program 1 times [2019-10-03 02:44:58,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:58,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:58,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:58,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:44:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:58,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:44:58,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:58,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:44:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:44:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:44:58,384 INFO L87 Difference]: Start difference. First operand 5560 states and 8019 transitions. Second operand 9 states. [2019-10-03 02:45:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:00,878 INFO L93 Difference]: Finished difference Result 5576 states and 8037 transitions. [2019-10-03 02:45:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:45:00,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-10-03 02:45:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:00,897 INFO L225 Difference]: With dead ends: 5576 [2019-10-03 02:45:00,897 INFO L226 Difference]: Without dead ends: 5575 [2019-10-03 02:45:00,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:45:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2019-10-03 02:45:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 5571. [2019-10-03 02:45:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5571 states. [2019-10-03 02:45:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5571 states to 5571 states and 8032 transitions. [2019-10-03 02:45:01,023 INFO L78 Accepts]: Start accepts. Automaton has 5571 states and 8032 transitions. Word has length 64 [2019-10-03 02:45:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:01,023 INFO L475 AbstractCegarLoop]: Abstraction has 5571 states and 8032 transitions. [2019-10-03 02:45:01,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5571 states and 8032 transitions. [2019-10-03 02:45:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 02:45:01,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:01,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:01,027 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:01,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1652928446, now seen corresponding path program 1 times [2019-10-03 02:45:01,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:01,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:01,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:01,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:01,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:01,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:01,178 INFO L87 Difference]: Start difference. First operand 5571 states and 8032 transitions. Second operand 6 states. [2019-10-03 02:45:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:07,243 INFO L93 Difference]: Finished difference Result 6736 states and 9744 transitions. [2019-10-03 02:45:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:07,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-03 02:45:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:07,262 INFO L225 Difference]: With dead ends: 6736 [2019-10-03 02:45:07,263 INFO L226 Difference]: Without dead ends: 6719 [2019-10-03 02:45:07,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:45:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6719 states. [2019-10-03 02:45:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6719 to 5558. [2019-10-03 02:45:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-03 02:45:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8014 transitions. [2019-10-03 02:45:07,395 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8014 transitions. Word has length 64 [2019-10-03 02:45:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:07,395 INFO L475 AbstractCegarLoop]: Abstraction has 5558 states and 8014 transitions. [2019-10-03 02:45:07,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8014 transitions. [2019-10-03 02:45:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 02:45:07,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:07,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:07,399 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 610671469, now seen corresponding path program 1 times [2019-10-03 02:45:07,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:07,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:07,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:07,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:07,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:07,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:07,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:07,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:07,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:07,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:07,842 INFO L87 Difference]: Start difference. First operand 5558 states and 8014 transitions. Second operand 3 states. [2019-10-03 02:45:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:07,946 INFO L93 Difference]: Finished difference Result 5605 states and 8067 transitions. [2019-10-03 02:45:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:07,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-03 02:45:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:07,964 INFO L225 Difference]: With dead ends: 5605 [2019-10-03 02:45:07,965 INFO L226 Difference]: Without dead ends: 5605 [2019-10-03 02:45:07,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5605 states. [2019-10-03 02:45:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5605 to 5556. [2019-10-03 02:45:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2019-10-03 02:45:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 8010 transitions. [2019-10-03 02:45:08,133 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 8010 transitions. Word has length 70 [2019-10-03 02:45:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:08,133 INFO L475 AbstractCegarLoop]: Abstraction has 5556 states and 8010 transitions. [2019-10-03 02:45:08,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 8010 transitions. [2019-10-03 02:45:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:45:08,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:08,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:08,137 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:08,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1101022210, now seen corresponding path program 1 times [2019-10-03 02:45:08,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:08,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:08,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:08,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:45:08,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:08,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:45:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:45:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:08,353 INFO L87 Difference]: Start difference. First operand 5556 states and 8010 transitions. Second operand 9 states. [2019-10-03 02:45:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:11,158 INFO L93 Difference]: Finished difference Result 5566 states and 8021 transitions. [2019-10-03 02:45:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:45:11,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-10-03 02:45:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:11,173 INFO L225 Difference]: With dead ends: 5566 [2019-10-03 02:45:11,173 INFO L226 Difference]: Without dead ends: 5534 [2019-10-03 02:45:11,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:45:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2019-10-03 02:45:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5534. [2019-10-03 02:45:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5534 states. [2019-10-03 02:45:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7985 transitions. [2019-10-03 02:45:11,293 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7985 transitions. Word has length 65 [2019-10-03 02:45:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:11,293 INFO L475 AbstractCegarLoop]: Abstraction has 5534 states and 7985 transitions. [2019-10-03 02:45:11,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7985 transitions. [2019-10-03 02:45:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:45:11,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:11,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:11,297 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -841217434, now seen corresponding path program 1 times [2019-10-03 02:45:11,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:11,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:11,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:11,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:11,520 INFO L87 Difference]: Start difference. First operand 5534 states and 7985 transitions. Second operand 3 states. [2019-10-03 02:45:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:11,749 INFO L93 Difference]: Finished difference Result 8013 states and 11586 transitions. [2019-10-03 02:45:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:11,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 02:45:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:11,779 INFO L225 Difference]: With dead ends: 8013 [2019-10-03 02:45:11,779 INFO L226 Difference]: Without dead ends: 8013 [2019-10-03 02:45:11,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2019-10-03 02:45:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 5537. [2019-10-03 02:45:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5537 states. [2019-10-03 02:45:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 7985 transitions. [2019-10-03 02:45:12,032 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 7985 transitions. Word has length 72 [2019-10-03 02:45:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:12,032 INFO L475 AbstractCegarLoop]: Abstraction has 5537 states and 7985 transitions. [2019-10-03 02:45:12,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 7985 transitions. [2019-10-03 02:45:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 02:45:12,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:12,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:12,037 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1966852698, now seen corresponding path program 1 times [2019-10-03 02:45:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:12,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:45:12,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:12,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:45:12,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:45:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:45:12,317 INFO L87 Difference]: Start difference. First operand 5537 states and 7985 transitions. Second operand 11 states. [2019-10-03 02:45:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:12,553 INFO L93 Difference]: Finished difference Result 5549 states and 7998 transitions. [2019-10-03 02:45:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:45:12,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-10-03 02:45:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:12,571 INFO L225 Difference]: With dead ends: 5549 [2019-10-03 02:45:12,571 INFO L226 Difference]: Without dead ends: 5519 [2019-10-03 02:45:12,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:45:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-10-03 02:45:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-10-03 02:45:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-10-03 02:45:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 7963 transitions. [2019-10-03 02:45:12,695 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 7963 transitions. Word has length 75 [2019-10-03 02:45:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 5519 states and 7963 transitions. [2019-10-03 02:45:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:45:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 7963 transitions. [2019-10-03 02:45:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 02:45:12,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:12,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:12,699 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1373489922, now seen corresponding path program 1 times [2019-10-03 02:45:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:12,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:12,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:12,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:12,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:12,914 INFO L87 Difference]: Start difference. First operand 5519 states and 7963 transitions. Second operand 4 states. [2019-10-03 02:45:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:16,470 INFO L93 Difference]: Finished difference Result 3962 states and 5631 transitions. [2019-10-03 02:45:16,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:45:16,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-10-03 02:45:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:16,481 INFO L225 Difference]: With dead ends: 3962 [2019-10-03 02:45:16,481 INFO L226 Difference]: Without dead ends: 3962 [2019-10-03 02:45:16,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2019-10-03 02:45:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3845. [2019-10-03 02:45:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2019-10-03 02:45:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5496 transitions. [2019-10-03 02:45:16,556 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5496 transitions. Word has length 81 [2019-10-03 02:45:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:16,556 INFO L475 AbstractCegarLoop]: Abstraction has 3845 states and 5496 transitions. [2019-10-03 02:45:16,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5496 transitions. [2019-10-03 02:45:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 02:45:16,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:16,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:16,560 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -348379415, now seen corresponding path program 1 times [2019-10-03 02:45:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:16,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:16,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:16,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:16,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:16,743 INFO L87 Difference]: Start difference. First operand 3845 states and 5496 transitions. Second operand 3 states. [2019-10-03 02:45:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:16,812 INFO L93 Difference]: Finished difference Result 3923 states and 5582 transitions. [2019-10-03 02:45:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:16,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-03 02:45:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:16,825 INFO L225 Difference]: With dead ends: 3923 [2019-10-03 02:45:16,825 INFO L226 Difference]: Without dead ends: 3923 [2019-10-03 02:45:16,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2019-10-03 02:45:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 3840. [2019-10-03 02:45:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2019-10-03 02:45:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5486 transitions. [2019-10-03 02:45:16,956 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5486 transitions. Word has length 81 [2019-10-03 02:45:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:16,959 INFO L475 AbstractCegarLoop]: Abstraction has 3840 states and 5486 transitions. [2019-10-03 02:45:16,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5486 transitions. [2019-10-03 02:45:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:45:16,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:16,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:16,966 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1657295363, now seen corresponding path program 1 times [2019-10-03 02:45:16,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:16,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:16,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:16,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:16,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:17,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:17,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:45:17,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:17,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:45:17,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:45:17,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:45:17,168 INFO L87 Difference]: Start difference. First operand 3840 states and 5486 transitions. Second operand 7 states. [2019-10-03 02:45:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:25,834 INFO L93 Difference]: Finished difference Result 3875 states and 5534 transitions. [2019-10-03 02:45:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:45:25,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-03 02:45:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:25,843 INFO L225 Difference]: With dead ends: 3875 [2019-10-03 02:45:25,843 INFO L226 Difference]: Without dead ends: 3461 [2019-10-03 02:45:25,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2019-10-03 02:45:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3434. [2019-10-03 02:45:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-10-03 02:45:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4850 transitions. [2019-10-03 02:45:25,915 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4850 transitions. Word has length 84 [2019-10-03 02:45:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:25,915 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4850 transitions. [2019-10-03 02:45:25,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:45:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4850 transitions. [2019-10-03 02:45:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 02:45:25,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:25,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:25,919 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash -245192666, now seen corresponding path program 1 times [2019-10-03 02:45:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:25,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:25,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:26,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:26,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:26,098 INFO L87 Difference]: Start difference. First operand 3434 states and 4850 transitions. Second operand 6 states. [2019-10-03 02:45:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:28,250 INFO L93 Difference]: Finished difference Result 3441 states and 4856 transitions. [2019-10-03 02:45:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:45:28,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-03 02:45:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:28,261 INFO L225 Difference]: With dead ends: 3441 [2019-10-03 02:45:28,261 INFO L226 Difference]: Without dead ends: 3434 [2019-10-03 02:45:28,262 INFO L640 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-03 02:45:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2019-10-03 02:45:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2019-10-03 02:45:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-10-03 02:45:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4846 transitions. [2019-10-03 02:45:28,336 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4846 transitions. Word has length 78 [2019-10-03 02:45:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:28,337 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4846 transitions. [2019-10-03 02:45:28,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4846 transitions. [2019-10-03 02:45:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 02:45:28,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:28,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:28,339 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -219822743, now seen corresponding path program 1 times [2019-10-03 02:45:28,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:28,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:28,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:28,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:28,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:28,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:45:28,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:28,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:45:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:45:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:28,598 INFO L87 Difference]: Start difference. First operand 3434 states and 4846 transitions. Second operand 5 states. [2019-10-03 02:45:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:28,653 INFO L93 Difference]: Finished difference Result 3404 states and 4809 transitions. [2019-10-03 02:45:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:45:28,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-03 02:45:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:28,666 INFO L225 Difference]: With dead ends: 3404 [2019-10-03 02:45:28,666 INFO L226 Difference]: Without dead ends: 3404 [2019-10-03 02:45:28,666 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-10-03 02:45:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-10-03 02:45:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-03 02:45:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4809 transitions. [2019-10-03 02:45:28,764 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4809 transitions. Word has length 79 [2019-10-03 02:45:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:28,765 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4809 transitions. [2019-10-03 02:45:28,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:45:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4809 transitions. [2019-10-03 02:45:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 02:45:28,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:28,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:28,768 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1253594992, now seen corresponding path program 1 times [2019-10-03 02:45:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:28,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:28,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:28,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:28,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:28,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:28,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:28,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:28,949 INFO L87 Difference]: Start difference. First operand 3404 states and 4809 transitions. Second operand 6 states. [2019-10-03 02:45:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:31,109 INFO L93 Difference]: Finished difference Result 3410 states and 4814 transitions. [2019-10-03 02:45:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:31,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-03 02:45:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:31,117 INFO L225 Difference]: With dead ends: 3410 [2019-10-03 02:45:31,118 INFO L226 Difference]: Without dead ends: 3404 [2019-10-03 02:45:31,118 INFO L640 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-03 02:45:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-10-03 02:45:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-10-03 02:45:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-03 02:45:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4807 transitions. [2019-10-03 02:45:31,196 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4807 transitions. Word has length 79 [2019-10-03 02:45:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4807 transitions. [2019-10-03 02:45:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4807 transitions. [2019-10-03 02:45:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:45:31,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:31,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:31,200 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -56933927, now seen corresponding path program 1 times [2019-10-03 02:45:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:31,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:31,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:31,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-03 02:45:31,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:31,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:31,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:31,411 INFO L87 Difference]: Start difference. First operand 3404 states and 4807 transitions. Second operand 3 states. [2019-10-03 02:45:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:31,600 INFO L93 Difference]: Finished difference Result 3434 states and 4840 transitions. [2019-10-03 02:45:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:31,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-03 02:45:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:31,608 INFO L225 Difference]: With dead ends: 3434 [2019-10-03 02:45:31,609 INFO L226 Difference]: Without dead ends: 3406 [2019-10-03 02:45:31,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:31,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-10-03 02:45:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3404. [2019-10-03 02:45:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-03 02:45:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4806 transitions. [2019-10-03 02:45:31,668 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4806 transitions. Word has length 84 [2019-10-03 02:45:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:31,668 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4806 transitions. [2019-10-03 02:45:31,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4806 transitions. [2019-10-03 02:45:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:45:31,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:31,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:31,670 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:31,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:31,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1491366779, now seen corresponding path program 1 times [2019-10-03 02:45:31,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:31,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:31,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:31,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:31,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:31,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:31,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:31,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:31,845 INFO L87 Difference]: Start difference. First operand 3404 states and 4806 transitions. Second operand 3 states. [2019-10-03 02:45:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:31,892 INFO L93 Difference]: Finished difference Result 3417 states and 4824 transitions. [2019-10-03 02:45:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:31,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-03 02:45:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:31,903 INFO L225 Difference]: With dead ends: 3417 [2019-10-03 02:45:31,904 INFO L226 Difference]: Without dead ends: 3417 [2019-10-03 02:45:31,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-10-03 02:45:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3409. [2019-10-03 02:45:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-10-03 02:45:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4813 transitions. [2019-10-03 02:45:31,998 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4813 transitions. Word has length 85 [2019-10-03 02:45:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:31,998 INFO L475 AbstractCegarLoop]: Abstraction has 3409 states and 4813 transitions. [2019-10-03 02:45:31,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4813 transitions. [2019-10-03 02:45:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 02:45:32,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:32,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:32,000 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -986895225, now seen corresponding path program 1 times [2019-10-03 02:45:32,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:32,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:32,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:32,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:32,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:32,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:32,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:32,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:32,222 INFO L87 Difference]: Start difference. First operand 3409 states and 4813 transitions. Second operand 6 states. [2019-10-03 02:45:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:32,335 INFO L93 Difference]: Finished difference Result 3421 states and 4826 transitions. [2019-10-03 02:45:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:32,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-03 02:45:32,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:32,346 INFO L225 Difference]: With dead ends: 3421 [2019-10-03 02:45:32,346 INFO L226 Difference]: Without dead ends: 3403 [2019-10-03 02:45:32,347 INFO L640 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-03 02:45:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2019-10-03 02:45:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3398. [2019-10-03 02:45:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2019-10-03 02:45:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4797 transitions. [2019-10-03 02:45:32,425 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4797 transitions. Word has length 86 [2019-10-03 02:45:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:32,426 INFO L475 AbstractCegarLoop]: Abstraction has 3398 states and 4797 transitions. [2019-10-03 02:45:32,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4797 transitions. [2019-10-03 02:45:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 02:45:32,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:32,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:32,428 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash 198331322, now seen corresponding path program 1 times [2019-10-03 02:45:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:32,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:32,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:32,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:32,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:32,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:32,576 INFO L87 Difference]: Start difference. First operand 3398 states and 4797 transitions. Second operand 6 states. [2019-10-03 02:45:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:34,734 INFO L93 Difference]: Finished difference Result 3404 states and 4802 transitions. [2019-10-03 02:45:34,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:34,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 02:45:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:34,742 INFO L225 Difference]: With dead ends: 3404 [2019-10-03 02:45:34,742 INFO L226 Difference]: Without dead ends: 3398 [2019-10-03 02:45:34,742 INFO L640 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-03 02:45:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-10-03 02:45:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3398. [2019-10-03 02:45:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2019-10-03 02:45:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4796 transitions. [2019-10-03 02:45:34,798 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4796 transitions. Word has length 83 [2019-10-03 02:45:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:34,799 INFO L475 AbstractCegarLoop]: Abstraction has 3398 states and 4796 transitions. [2019-10-03 02:45:34,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4796 transitions. [2019-10-03 02:45:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 02:45:34,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:34,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:34,801 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1597447618, now seen corresponding path program 1 times [2019-10-03 02:45:34,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:34,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:34,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:34,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:34,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:34,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:34,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:34,964 INFO L87 Difference]: Start difference. First operand 3398 states and 4796 transitions. Second operand 3 states. [2019-10-03 02:45:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:35,140 INFO L93 Difference]: Finished difference Result 4590 states and 6543 transitions. [2019-10-03 02:45:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:35,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-03 02:45:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:35,152 INFO L225 Difference]: With dead ends: 4590 [2019-10-03 02:45:35,152 INFO L226 Difference]: Without dead ends: 4590 [2019-10-03 02:45:35,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2019-10-03 02:45:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3427. [2019-10-03 02:45:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-10-03 02:45:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4831 transitions. [2019-10-03 02:45:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4831 transitions. Word has length 84 [2019-10-03 02:45:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:35,232 INFO L475 AbstractCegarLoop]: Abstraction has 3427 states and 4831 transitions. [2019-10-03 02:45:35,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4831 transitions. [2019-10-03 02:45:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:45:35,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:35,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:35,235 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -242716219, now seen corresponding path program 1 times [2019-10-03 02:45:35,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:35,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:35,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:35,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:35,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:35,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:35,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:35,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:35,396 INFO L87 Difference]: Start difference. First operand 3427 states and 4831 transitions. Second operand 3 states. [2019-10-03 02:45:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:35,502 INFO L93 Difference]: Finished difference Result 3425 states and 4827 transitions. [2019-10-03 02:45:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:35,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-03 02:45:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:35,512 INFO L225 Difference]: With dead ends: 3425 [2019-10-03 02:45:35,513 INFO L226 Difference]: Without dead ends: 3425 [2019-10-03 02:45:35,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-10-03 02:45:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3425. [2019-10-03 02:45:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2019-10-03 02:45:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4827 transitions. [2019-10-03 02:45:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4827 transitions. Word has length 89 [2019-10-03 02:45:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:35,571 INFO L475 AbstractCegarLoop]: Abstraction has 3425 states and 4827 transitions. [2019-10-03 02:45:35,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4827 transitions. [2019-10-03 02:45:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:45:35,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:35,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:35,573 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 198612998, now seen corresponding path program 1 times [2019-10-03 02:45:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:35,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:35,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:35,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:35,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:35,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:35,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:45:35,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:35,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:45:35,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:45:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:35,716 INFO L87 Difference]: Start difference. First operand 3425 states and 4827 transitions. Second operand 4 states. [2019-10-03 02:45:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:37,803 INFO L93 Difference]: Finished difference Result 3388 states and 4771 transitions. [2019-10-03 02:45:37,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:37,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 02:45:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:37,814 INFO L225 Difference]: With dead ends: 3388 [2019-10-03 02:45:37,814 INFO L226 Difference]: Without dead ends: 3388 [2019-10-03 02:45:37,815 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:45:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-10-03 02:45:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2019-10-03 02:45:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-03 02:45:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4771 transitions. [2019-10-03 02:45:37,880 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4771 transitions. Word has length 85 [2019-10-03 02:45:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:37,880 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4771 transitions. [2019-10-03 02:45:37,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4771 transitions. [2019-10-03 02:45:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:45:37,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:37,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:37,883 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1824698338, now seen corresponding path program 1 times [2019-10-03 02:45:37,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:37,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:37,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:38,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:38,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:45:38,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:38,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:45:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:45:38,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:38,094 INFO L87 Difference]: Start difference. First operand 3388 states and 4771 transitions. Second operand 5 states. [2019-10-03 02:45:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:43,751 INFO L93 Difference]: Finished difference Result 4536 states and 6458 transitions. [2019-10-03 02:45:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:43,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-03 02:45:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:43,762 INFO L225 Difference]: With dead ends: 4536 [2019-10-03 02:45:43,763 INFO L226 Difference]: Without dead ends: 4536 [2019-10-03 02:45:43,763 INFO L640 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-03 02:45:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-03 02:45:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3388. [2019-10-03 02:45:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-03 02:45:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4770 transitions. [2019-10-03 02:45:43,846 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4770 transitions. Word has length 85 [2019-10-03 02:45:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:43,847 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4770 transitions. [2019-10-03 02:45:43,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:45:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4770 transitions. [2019-10-03 02:45:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:45:43,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:43,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:43,849 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -834588261, now seen corresponding path program 1 times [2019-10-03 02:45:43,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:43,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:43,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:44,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:44,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:44,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:44,015 INFO L87 Difference]: Start difference. First operand 3388 states and 4770 transitions. Second operand 6 states. [2019-10-03 02:45:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:46,176 INFO L93 Difference]: Finished difference Result 3399 states and 4780 transitions. [2019-10-03 02:45:46,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:46,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-03 02:45:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:46,185 INFO L225 Difference]: With dead ends: 3399 [2019-10-03 02:45:46,185 INFO L226 Difference]: Without dead ends: 3394 [2019-10-03 02:45:46,186 INFO L640 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-03 02:45:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2019-10-03 02:45:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3388. [2019-10-03 02:45:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-03 02:45:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4768 transitions. [2019-10-03 02:45:46,258 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4768 transitions. Word has length 85 [2019-10-03 02:45:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:46,259 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4768 transitions. [2019-10-03 02:45:46,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:45:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4768 transitions. [2019-10-03 02:45:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 02:45:46,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:46,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:46,262 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1629971384, now seen corresponding path program 1 times [2019-10-03 02:45:46,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:46,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:46,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:46,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:46,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:45:46,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:46,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:45:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:45:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:45:46,490 INFO L87 Difference]: Start difference. First operand 3388 states and 4768 transitions. Second operand 9 states. [2019-10-03 02:45:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:51,014 INFO L93 Difference]: Finished difference Result 3406 states and 4789 transitions. [2019-10-03 02:45:51,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:45:51,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-10-03 02:45:51,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:51,022 INFO L225 Difference]: With dead ends: 3406 [2019-10-03 02:45:51,022 INFO L226 Difference]: Without dead ends: 3405 [2019-10-03 02:45:51,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:45:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2019-10-03 02:45:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3401. [2019-10-03 02:45:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2019-10-03 02:45:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4784 transitions. [2019-10-03 02:45:51,084 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4784 transitions. Word has length 86 [2019-10-03 02:45:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:51,084 INFO L475 AbstractCegarLoop]: Abstraction has 3401 states and 4784 transitions. [2019-10-03 02:45:51,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:45:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4784 transitions. [2019-10-03 02:45:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 02:45:51,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:51,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:51,087 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1630248214, now seen corresponding path program 1 times [2019-10-03 02:45:51,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:51,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:51,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:51,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:51,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:45:51,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:51,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:45:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:45:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:51,262 INFO L87 Difference]: Start difference. First operand 3401 states and 4784 transitions. Second operand 5 states. [2019-10-03 02:45:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:56,876 INFO L93 Difference]: Finished difference Result 4549 states and 6470 transitions. [2019-10-03 02:45:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:56,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-03 02:45:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:56,889 INFO L225 Difference]: With dead ends: 4549 [2019-10-03 02:45:56,889 INFO L226 Difference]: Without dead ends: 4521 [2019-10-03 02:45:56,889 INFO L640 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-03 02:45:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2019-10-03 02:45:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 3373. [2019-10-03 02:45:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-10-03 02:45:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4749 transitions. [2019-10-03 02:45:56,974 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 4749 transitions. Word has length 86 [2019-10-03 02:45:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:56,974 INFO L475 AbstractCegarLoop]: Abstraction has 3373 states and 4749 transitions. [2019-10-03 02:45:56,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:45:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4749 transitions. [2019-10-03 02:45:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:45:56,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:56,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:56,977 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1559133655, now seen corresponding path program 1 times [2019-10-03 02:45:56,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:56,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:45:57,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:57,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:45:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:45:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:57,102 INFO L87 Difference]: Start difference. First operand 3373 states and 4749 transitions. Second operand 3 states. [2019-10-03 02:45:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:57,336 INFO L93 Difference]: Finished difference Result 4507 states and 6420 transitions. [2019-10-03 02:45:57,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:45:57,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-10-03 02:45:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:57,347 INFO L225 Difference]: With dead ends: 4507 [2019-10-03 02:45:57,348 INFO L226 Difference]: Without dead ends: 4507 [2019-10-03 02:45:57,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:45:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-10-03 02:45:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3377. [2019-10-03 02:45:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-10-03 02:45:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4755 transitions. [2019-10-03 02:45:57,421 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4755 transitions. Word has length 93 [2019-10-03 02:45:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:57,422 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 4755 transitions. [2019-10-03 02:45:57,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:45:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4755 transitions. [2019-10-03 02:45:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:45:57,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:57,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:57,424 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:57,424 INFO L82 PathProgramCache]: Analyzing trace with hash 402322031, now seen corresponding path program 1 times [2019-10-03 02:45:57,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:57,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:57,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:57,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:45:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:57,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:45:57,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:57,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:45:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:45:57,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:57,594 INFO L87 Difference]: Start difference. First operand 3377 states and 4755 transitions. Second operand 5 states. [2019-10-03 02:46:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:05,334 INFO L93 Difference]: Finished difference Result 5651 states and 8102 transitions. [2019-10-03 02:46:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:05,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-03 02:46:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:05,351 INFO L225 Difference]: With dead ends: 5651 [2019-10-03 02:46:05,351 INFO L226 Difference]: Without dead ends: 5651 [2019-10-03 02:46:05,351 INFO L640 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-03 02:46:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-10-03 02:46:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3391. [2019-10-03 02:46:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3391 states. [2019-10-03 02:46:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4772 transitions. [2019-10-03 02:46:05,451 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4772 transitions. Word has length 93 [2019-10-03 02:46:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:05,451 INFO L475 AbstractCegarLoop]: Abstraction has 3391 states and 4772 transitions. [2019-10-03 02:46:05,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:46:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4772 transitions. [2019-10-03 02:46:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:46:05,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:05,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:05,453 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash -515610206, now seen corresponding path program 1 times [2019-10-03 02:46:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:05,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:05,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:05,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:05,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:05,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:05,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:05,746 INFO L87 Difference]: Start difference. First operand 3391 states and 4772 transitions. Second operand 14 states. [2019-10-03 02:46:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:12,669 INFO L93 Difference]: Finished difference Result 3405 states and 4787 transitions. [2019-10-03 02:46:12,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:12,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-10-03 02:46:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:12,676 INFO L225 Difference]: With dead ends: 3405 [2019-10-03 02:46:12,677 INFO L226 Difference]: Without dead ends: 3384 [2019-10-03 02:46:12,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2019-10-03 02:46:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3384. [2019-10-03 02:46:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2019-10-03 02:46:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4763 transitions. [2019-10-03 02:46:12,735 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4763 transitions. Word has length 98 [2019-10-03 02:46:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:12,735 INFO L475 AbstractCegarLoop]: Abstraction has 3384 states and 4763 transitions. [2019-10-03 02:46:12,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4763 transitions. [2019-10-03 02:46:12,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:12,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:12,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:12,739 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1192745558, now seen corresponding path program 1 times [2019-10-03 02:46:12,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:12,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:13,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:13,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:13,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:13,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:13,051 INFO L87 Difference]: Start difference. First operand 3384 states and 4763 transitions. Second operand 14 states. [2019-10-03 02:46:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:19,203 INFO L93 Difference]: Finished difference Result 3398 states and 4778 transitions. [2019-10-03 02:46:19,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:19,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-10-03 02:46:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:19,212 INFO L225 Difference]: With dead ends: 3398 [2019-10-03 02:46:19,212 INFO L226 Difference]: Without dead ends: 3337 [2019-10-03 02:46:19,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2019-10-03 02:46:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3337. [2019-10-03 02:46:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3337 states. [2019-10-03 02:46:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4697 transitions. [2019-10-03 02:46:19,276 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4697 transitions. Word has length 97 [2019-10-03 02:46:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:19,276 INFO L475 AbstractCegarLoop]: Abstraction has 3337 states and 4697 transitions. [2019-10-03 02:46:19,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4697 transitions. [2019-10-03 02:46:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:46:19,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:19,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:19,278 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1319756638, now seen corresponding path program 1 times [2019-10-03 02:46:19,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:19,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:19,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:19,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:19,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:19,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:19,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:19,570 INFO L87 Difference]: Start difference. First operand 3337 states and 4697 transitions. Second operand 14 states. [2019-10-03 02:46:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:24,831 INFO L93 Difference]: Finished difference Result 3351 states and 4712 transitions. [2019-10-03 02:46:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:24,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-10-03 02:46:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:24,839 INFO L225 Difference]: With dead ends: 3351 [2019-10-03 02:46:24,839 INFO L226 Difference]: Without dead ends: 3328 [2019-10-03 02:46:24,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2019-10-03 02:46:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3328. [2019-10-03 02:46:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-10-03 02:46:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 4685 transitions. [2019-10-03 02:46:24,895 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 4685 transitions. Word has length 98 [2019-10-03 02:46:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:24,895 INFO L475 AbstractCegarLoop]: Abstraction has 3328 states and 4685 transitions. [2019-10-03 02:46:24,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 4685 transitions. [2019-10-03 02:46:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:46:24,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:24,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:24,898 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash -425043435, now seen corresponding path program 1 times [2019-10-03 02:46:24,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:24,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:24,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:24,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:24,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:25,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:25,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:25,145 INFO L87 Difference]: Start difference. First operand 3328 states and 4685 transitions. Second operand 14 states. [2019-10-03 02:46:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:31,751 INFO L93 Difference]: Finished difference Result 3342 states and 4700 transitions. [2019-10-03 02:46:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:31,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2019-10-03 02:46:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:31,759 INFO L225 Difference]: With dead ends: 3342 [2019-10-03 02:46:31,759 INFO L226 Difference]: Without dead ends: 3319 [2019-10-03 02:46:31,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2019-10-03 02:46:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3319. [2019-10-03 02:46:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-03 02:46:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4673 transitions. [2019-10-03 02:46:31,831 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4673 transitions. Word has length 101 [2019-10-03 02:46:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:31,831 INFO L475 AbstractCegarLoop]: Abstraction has 3319 states and 4673 transitions. [2019-10-03 02:46:31,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4673 transitions. [2019-10-03 02:46:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:31,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:31,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:31,833 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1507974481, now seen corresponding path program 1 times [2019-10-03 02:46:31,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:32,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:32,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:32,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:32,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:32,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:32,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:32,094 INFO L87 Difference]: Start difference. First operand 3319 states and 4673 transitions. Second operand 14 states. [2019-10-03 02:46:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:39,009 INFO L93 Difference]: Finished difference Result 3333 states and 4688 transitions. [2019-10-03 02:46:39,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:39,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-10-03 02:46:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:39,015 INFO L225 Difference]: With dead ends: 3333 [2019-10-03 02:46:39,015 INFO L226 Difference]: Without dead ends: 3312 [2019-10-03 02:46:39,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:39,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2019-10-03 02:46:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2019-10-03 02:46:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2019-10-03 02:46:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 4664 transitions. [2019-10-03 02:46:39,066 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 4664 transitions. Word has length 97 [2019-10-03 02:46:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:39,067 INFO L475 AbstractCegarLoop]: Abstraction has 3312 states and 4664 transitions. [2019-10-03 02:46:39,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 4664 transitions. [2019-10-03 02:46:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:46:39,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:39,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:39,069 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2042461425, now seen corresponding path program 1 times [2019-10-03 02:46:39,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:39,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:39,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:39,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:39,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:39,334 INFO L87 Difference]: Start difference. First operand 3312 states and 4664 transitions. Second operand 14 states. [2019-10-03 02:46:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:45,924 INFO L93 Difference]: Finished difference Result 3326 states and 4679 transitions. [2019-10-03 02:46:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:45,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-10-03 02:46:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:45,933 INFO L225 Difference]: With dead ends: 3326 [2019-10-03 02:46:45,933 INFO L226 Difference]: Without dead ends: 3310 [2019-10-03 02:46:45,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-10-03 02:46:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3310. [2019-10-03 02:46:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-10-03 02:46:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4660 transitions. [2019-10-03 02:46:45,997 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4660 transitions. Word has length 91 [2019-10-03 02:46:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:45,997 INFO L475 AbstractCegarLoop]: Abstraction has 3310 states and 4660 transitions. [2019-10-03 02:46:45,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4660 transitions. [2019-10-03 02:46:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:46:45,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:45,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:46,000 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1643656828, now seen corresponding path program 1 times [2019-10-03 02:46:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:46,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:46,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:46,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:46:46,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:46,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:46:46,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:46:46,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:46,293 INFO L87 Difference]: Start difference. First operand 3310 states and 4660 transitions. Second operand 14 states. [2019-10-03 02:46:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:52,663 INFO L93 Difference]: Finished difference Result 3324 states and 4675 transitions. [2019-10-03 02:46:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:46:52,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-10-03 02:46:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:52,670 INFO L225 Difference]: With dead ends: 3324 [2019-10-03 02:46:52,670 INFO L226 Difference]: Without dead ends: 3303 [2019-10-03 02:46:52,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:46:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2019-10-03 02:46:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3303. [2019-10-03 02:46:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2019-10-03 02:46:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4651 transitions. [2019-10-03 02:46:52,724 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4651 transitions. Word has length 90 [2019-10-03 02:46:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:52,725 INFO L475 AbstractCegarLoop]: Abstraction has 3303 states and 4651 transitions. [2019-10-03 02:46:52,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:46:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4651 transitions. [2019-10-03 02:46:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:46:52,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:52,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:52,727 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash -823465480, now seen corresponding path program 1 times [2019-10-03 02:46:52,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:52,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:52,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:52,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:52,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:52,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:52,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:52,867 INFO L87 Difference]: Start difference. First operand 3303 states and 4651 transitions. Second operand 6 states. [2019-10-03 02:46:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:55,007 INFO L93 Difference]: Finished difference Result 3317 states and 4664 transitions. [2019-10-03 02:46:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:55,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-10-03 02:46:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:55,015 INFO L225 Difference]: With dead ends: 3317 [2019-10-03 02:46:55,015 INFO L226 Difference]: Without dead ends: 3292 [2019-10-03 02:46:55,015 INFO L640 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-03 02:46:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-10-03 02:46:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3282. [2019-10-03 02:46:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-10-03 02:46:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4618 transitions. [2019-10-03 02:46:55,070 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4618 transitions. Word has length 89 [2019-10-03 02:46:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:55,070 INFO L475 AbstractCegarLoop]: Abstraction has 3282 states and 4618 transitions. [2019-10-03 02:46:55,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4618 transitions. [2019-10-03 02:46:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:46:55,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:55,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:55,072 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1688969787, now seen corresponding path program 1 times [2019-10-03 02:46:55,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:55,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:55,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:55,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:46:55,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:55,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:46:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:46:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:46:55,256 INFO L87 Difference]: Start difference. First operand 3282 states and 4618 transitions. Second operand 9 states. [2019-10-03 02:46:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:57,477 INFO L93 Difference]: Finished difference Result 3298 states and 4633 transitions. [2019-10-03 02:46:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:46:57,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-10-03 02:46:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:57,483 INFO L225 Difference]: With dead ends: 3298 [2019-10-03 02:46:57,483 INFO L226 Difference]: Without dead ends: 3288 [2019-10-03 02:46:57,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-10-03 02:46:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3282. [2019-10-03 02:46:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-10-03 02:46:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4617 transitions. [2019-10-03 02:46:57,558 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4617 transitions. Word has length 91 [2019-10-03 02:46:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:57,558 INFO L475 AbstractCegarLoop]: Abstraction has 3282 states and 4617 transitions. [2019-10-03 02:46:57,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:46:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4617 transitions. [2019-10-03 02:46:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:46:57,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:57,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:57,561 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash -645202431, now seen corresponding path program 1 times [2019-10-03 02:46:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:57,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:57,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:57,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:46:57,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:57,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:46:57,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:57,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:46:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:46:57,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:46:57,716 INFO L87 Difference]: Start difference. First operand 3282 states and 4617 transitions. Second operand 9 states. [2019-10-03 02:46:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:59,880 INFO L93 Difference]: Finished difference Result 3298 states and 4634 transitions. [2019-10-03 02:46:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:46:59,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-10-03 02:46:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:59,887 INFO L225 Difference]: With dead ends: 3298 [2019-10-03 02:46:59,887 INFO L226 Difference]: Without dead ends: 3255 [2019-10-03 02:46:59,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2019-10-03 02:46:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2019-10-03 02:46:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2019-10-03 02:46:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4589 transitions. [2019-10-03 02:46:59,950 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4589 transitions. Word has length 94 [2019-10-03 02:46:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:59,950 INFO L475 AbstractCegarLoop]: Abstraction has 3255 states and 4589 transitions. [2019-10-03 02:46:59,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:46:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4589 transitions. [2019-10-03 02:46:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:46:59,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:59,952 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:59,952 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1211368971, now seen corresponding path program 1 times [2019-10-03 02:46:59,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:59,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:59,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:47:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:00,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:47:00,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:00,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:47:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:47:00,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:00,091 INFO L87 Difference]: Start difference. First operand 3255 states and 4589 transitions. Second operand 8 states. [2019-10-03 02:47:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:02,259 INFO L93 Difference]: Finished difference Result 3261 states and 4594 transitions. [2019-10-03 02:47:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:47:02,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-10-03 02:47:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:02,267 INFO L225 Difference]: With dead ends: 3261 [2019-10-03 02:47:02,267 INFO L226 Difference]: Without dead ends: 3253 [2019-10-03 02:47:02,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-10-03 02:47:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 3253. [2019-10-03 02:47:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3253 states. [2019-10-03 02:47:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4585 transitions. [2019-10-03 02:47:02,317 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4585 transitions. Word has length 97 [2019-10-03 02:47:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:02,318 INFO L475 AbstractCegarLoop]: Abstraction has 3253 states and 4585 transitions. [2019-10-03 02:47:02,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:47:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4585 transitions. [2019-10-03 02:47:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:47:02,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:02,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:02,320 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1652788187, now seen corresponding path program 1 times [2019-10-03 02:47:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:02,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:02,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:02,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:02,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:02,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:02,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:02,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:02,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:02,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:02,426 INFO L87 Difference]: Start difference. First operand 3253 states and 4585 transitions. Second operand 3 states. [2019-10-03 02:47:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:02,456 INFO L93 Difference]: Finished difference Result 3269 states and 4603 transitions. [2019-10-03 02:47:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:02,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-03 02:47:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:02,462 INFO L225 Difference]: With dead ends: 3269 [2019-10-03 02:47:02,462 INFO L226 Difference]: Without dead ends: 3269 [2019-10-03 02:47:02,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-10-03 02:47:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3256. [2019-10-03 02:47:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2019-10-03 02:47:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4589 transitions. [2019-10-03 02:47:02,511 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4589 transitions. Word has length 99 [2019-10-03 02:47:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:02,511 INFO L475 AbstractCegarLoop]: Abstraction has 3256 states and 4589 transitions. [2019-10-03 02:47:02,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4589 transitions. [2019-10-03 02:47:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:47:02,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:02,513 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:02,513 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 46133904, now seen corresponding path program 1 times [2019-10-03 02:47:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:02,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:02,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:47:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:47:02,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:02,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:47:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:47:02,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:02,652 INFO L87 Difference]: Start difference. First operand 3256 states and 4589 transitions. Second operand 8 states. [2019-10-03 02:47:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:04,795 INFO L93 Difference]: Finished difference Result 3262 states and 4594 transitions. [2019-10-03 02:47:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:47:04,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-10-03 02:47:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:04,801 INFO L225 Difference]: With dead ends: 3262 [2019-10-03 02:47:04,802 INFO L226 Difference]: Without dead ends: 3254 [2019-10-03 02:47:04,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-10-03 02:47:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2019-10-03 02:47:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-10-03 02:47:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4585 transitions. [2019-10-03 02:47:04,850 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4585 transitions. Word has length 96 [2019-10-03 02:47:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:04,850 INFO L475 AbstractCegarLoop]: Abstraction has 3254 states and 4585 transitions. [2019-10-03 02:47:04,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:47:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4585 transitions. [2019-10-03 02:47:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:47:04,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:04,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:04,852 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1065982173, now seen corresponding path program 1 times [2019-10-03 02:47:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:04,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:04,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:47:04,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:04,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:47:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:47:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:47:04,994 INFO L87 Difference]: Start difference. First operand 3254 states and 4585 transitions. Second operand 5 states. [2019-10-03 02:47:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:09,955 INFO L93 Difference]: Finished difference Result 3263 states and 4588 transitions. [2019-10-03 02:47:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:09,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-03 02:47:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:09,966 INFO L225 Difference]: With dead ends: 3263 [2019-10-03 02:47:09,966 INFO L226 Difference]: Without dead ends: 3263 [2019-10-03 02:47:09,966 INFO L640 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-03 02:47:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2019-10-03 02:47:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 3251. [2019-10-03 02:47:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-10-03 02:47:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4578 transitions. [2019-10-03 02:47:10,024 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4578 transitions. Word has length 99 [2019-10-03 02:47:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,024 INFO L475 AbstractCegarLoop]: Abstraction has 3251 states and 4578 transitions. [2019-10-03 02:47:10,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:47:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4578 transitions. [2019-10-03 02:47:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:47:10,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:10,025 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1848029162, now seen corresponding path program 1 times [2019-10-03 02:47:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:10,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:10,144 INFO L87 Difference]: Start difference. First operand 3251 states and 4578 transitions. Second operand 3 states. [2019-10-03 02:47:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:10,185 INFO L93 Difference]: Finished difference Result 3267 states and 4596 transitions. [2019-10-03 02:47:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:10,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-03 02:47:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:10,194 INFO L225 Difference]: With dead ends: 3267 [2019-10-03 02:47:10,195 INFO L226 Difference]: Without dead ends: 3267 [2019-10-03 02:47:10,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2019-10-03 02:47:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 3251. [2019-10-03 02:47:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-10-03 02:47:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4578 transitions. [2019-10-03 02:47:10,278 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4578 transitions. Word has length 100 [2019-10-03 02:47:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,278 INFO L475 AbstractCegarLoop]: Abstraction has 3251 states and 4578 transitions. [2019-10-03 02:47:10,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4578 transitions. [2019-10-03 02:47:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:47:10,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:10,280 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -761387094, now seen corresponding path program 1 times [2019-10-03 02:47:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:10,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:10,591 INFO L87 Difference]: Start difference. First operand 3251 states and 4578 transitions. Second operand 3 states. [2019-10-03 02:47:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:10,789 INFO L93 Difference]: Finished difference Result 4437 states and 6300 transitions. [2019-10-03 02:47:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:10,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-03 02:47:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:10,804 INFO L225 Difference]: With dead ends: 4437 [2019-10-03 02:47:10,804 INFO L226 Difference]: Without dead ends: 4437 [2019-10-03 02:47:10,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2019-10-03 02:47:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 4380. [2019-10-03 02:47:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4380 states. [2019-10-03 02:47:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 6238 transitions. [2019-10-03 02:47:10,964 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 6238 transitions. Word has length 100 [2019-10-03 02:47:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,964 INFO L475 AbstractCegarLoop]: Abstraction has 4380 states and 6238 transitions. [2019-10-03 02:47:10,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 6238 transitions. [2019-10-03 02:47:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:47:10,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:10,967 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 738347308, now seen corresponding path program 1 times [2019-10-03 02:47:10,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:11,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:47:11,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:11,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:47:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:47:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:47:11,344 INFO L87 Difference]: Start difference. First operand 4380 states and 6238 transitions. Second operand 14 states. [2019-10-03 02:47:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:18,505 INFO L93 Difference]: Finished difference Result 4394 states and 6253 transitions. [2019-10-03 02:47:18,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:47:18,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-10-03 02:47:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:18,514 INFO L225 Difference]: With dead ends: 4394 [2019-10-03 02:47:18,514 INFO L226 Difference]: Without dead ends: 4371 [2019-10-03 02:47:18,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:47:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-10-03 02:47:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2019-10-03 02:47:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4371 states. [2019-10-03 02:47:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6226 transitions. [2019-10-03 02:47:18,601 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6226 transitions. Word has length 107 [2019-10-03 02:47:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:18,602 INFO L475 AbstractCegarLoop]: Abstraction has 4371 states and 6226 transitions. [2019-10-03 02:47:18,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:47:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6226 transitions. [2019-10-03 02:47:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:47:18,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:18,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:18,603 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2046190639, now seen corresponding path program 1 times [2019-10-03 02:47:18,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:18,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:47:18,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:18,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:47:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:47:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:47:18,875 INFO L87 Difference]: Start difference. First operand 4371 states and 6226 transitions. Second operand 15 states. [2019-10-03 02:47:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:25,572 INFO L93 Difference]: Finished difference Result 4385 states and 6241 transitions. [2019-10-03 02:47:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:47:25,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-10-03 02:47:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:25,582 INFO L225 Difference]: With dead ends: 4385 [2019-10-03 02:47:25,582 INFO L226 Difference]: Without dead ends: 4346 [2019-10-03 02:47:25,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:47:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-10-03 02:47:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2019-10-03 02:47:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2019-10-03 02:47:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6199 transitions. [2019-10-03 02:47:25,661 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6199 transitions. Word has length 97 [2019-10-03 02:47:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:25,661 INFO L475 AbstractCegarLoop]: Abstraction has 4346 states and 6199 transitions. [2019-10-03 02:47:25,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:47:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6199 transitions. [2019-10-03 02:47:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:47:25,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:25,662 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:25,663 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:25,663 INFO L82 PathProgramCache]: Analyzing trace with hash 765573323, now seen corresponding path program 1 times [2019-10-03 02:47:25,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:25,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:47:25,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:25,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:47:25,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:25,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:47:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:47:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:25,806 INFO L87 Difference]: Start difference. First operand 4346 states and 6199 transitions. Second operand 8 states. [2019-10-03 02:47:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:27,997 INFO L93 Difference]: Finished difference Result 4352 states and 6204 transitions. [2019-10-03 02:47:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:47:27,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-03 02:47:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:28,007 INFO L225 Difference]: With dead ends: 4352 [2019-10-03 02:47:28,007 INFO L226 Difference]: Without dead ends: 4343 [2019-10-03 02:47:28,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2019-10-03 02:47:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4343. [2019-10-03 02:47:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-10-03 02:47:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6194 transitions. [2019-10-03 02:47:28,086 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6194 transitions. Word has length 101 [2019-10-03 02:47:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:28,087 INFO L475 AbstractCegarLoop]: Abstraction has 4343 states and 6194 transitions. [2019-10-03 02:47:28,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:47:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6194 transitions. [2019-10-03 02:47:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:47:28,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:28,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:28,088 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1584193472, now seen corresponding path program 1 times [2019-10-03 02:47:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:28,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:47:28,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:28,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:47:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:47:28,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:28,332 INFO L87 Difference]: Start difference. First operand 4343 states and 6194 transitions. Second operand 9 states. [2019-10-03 02:47:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:32,840 INFO L93 Difference]: Finished difference Result 4346 states and 6196 transitions. [2019-10-03 02:47:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:47:32,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-03 02:47:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:32,850 INFO L225 Difference]: With dead ends: 4346 [2019-10-03 02:47:32,850 INFO L226 Difference]: Without dead ends: 4195 [2019-10-03 02:47:32,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:47:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-03 02:47:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-03 02:47:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-03 02:47:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6006 transitions. [2019-10-03 02:47:32,936 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6006 transitions. Word has length 99 [2019-10-03 02:47:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:32,936 INFO L475 AbstractCegarLoop]: Abstraction has 4195 states and 6006 transitions. [2019-10-03 02:47:32,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:47:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6006 transitions. [2019-10-03 02:47:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 02:47:32,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:32,937 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:32,938 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1255010522, now seen corresponding path program 1 times [2019-10-03 02:47:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:32,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:47:33,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:33,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:47:33,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:33,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:47:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:47:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:33,081 INFO L87 Difference]: Start difference. First operand 4195 states and 6006 transitions. Second operand 8 states. [2019-10-03 02:47:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:35,257 INFO L93 Difference]: Finished difference Result 4201 states and 6011 transitions. [2019-10-03 02:47:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:47:35,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-10-03 02:47:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:35,268 INFO L225 Difference]: With dead ends: 4201 [2019-10-03 02:47:35,268 INFO L226 Difference]: Without dead ends: 4192 [2019-10-03 02:47:35,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-10-03 02:47:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4192. [2019-10-03 02:47:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4192 states. [2019-10-03 02:47:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 6001 transitions. [2019-10-03 02:47:35,349 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 6001 transitions. Word has length 102 [2019-10-03 02:47:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:35,349 INFO L475 AbstractCegarLoop]: Abstraction has 4192 states and 6001 transitions. [2019-10-03 02:47:35,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:47:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 6001 transitions. [2019-10-03 02:47:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 02:47:35,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:35,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:35,351 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1737372550, now seen corresponding path program 1 times [2019-10-03 02:47:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:35,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:35,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:35,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:35,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:35,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:47:35,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:35,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:47:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:47:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:35,442 INFO L87 Difference]: Start difference. First operand 4192 states and 6001 transitions. Second operand 3 states. [2019-10-03 02:47:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:37,504 INFO L93 Difference]: Finished difference Result 4136 states and 5939 transitions. [2019-10-03 02:47:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:47:37,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-03 02:47:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:37,513 INFO L225 Difference]: With dead ends: 4136 [2019-10-03 02:47:37,513 INFO L226 Difference]: Without dead ends: 3897 [2019-10-03 02:47:37,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:47:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2019-10-03 02:47:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2019-10-03 02:47:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-10-03 02:47:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5589 transitions. [2019-10-03 02:47:37,590 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5589 transitions. Word has length 105 [2019-10-03 02:47:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:37,590 INFO L475 AbstractCegarLoop]: Abstraction has 3897 states and 5589 transitions. [2019-10-03 02:47:37,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:47:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5589 transitions. [2019-10-03 02:47:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 02:47:37,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:37,591 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:37,591 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1094519463, now seen corresponding path program 1 times [2019-10-03 02:47:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:37,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:37,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:47:37,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:37,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:47:37,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:37,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:47:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:47:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:47:37,782 INFO L87 Difference]: Start difference. First operand 3897 states and 5589 transitions. Second operand 11 states. [2019-10-03 02:47:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:39,989 INFO L93 Difference]: Finished difference Result 3898 states and 5588 transitions. [2019-10-03 02:47:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:47:39,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-10-03 02:47:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:39,998 INFO L225 Difference]: With dead ends: 3898 [2019-10-03 02:47:39,998 INFO L226 Difference]: Without dead ends: 3868 [2019-10-03 02:47:39,999 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:47:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-10-03 02:47:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2019-10-03 02:47:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2019-10-03 02:47:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5556 transitions. [2019-10-03 02:47:40,072 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5556 transitions. Word has length 105 [2019-10-03 02:47:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:40,072 INFO L475 AbstractCegarLoop]: Abstraction has 3868 states and 5556 transitions. [2019-10-03 02:47:40,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:47:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5556 transitions. [2019-10-03 02:47:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:47:40,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:40,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:40,073 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash -799423163, now seen corresponding path program 1 times [2019-10-03 02:47:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:40,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:40,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:40,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:40,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:40,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:40,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:40,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:40,222 INFO L87 Difference]: Start difference. First operand 3868 states and 5556 transitions. Second operand 6 states. [2019-10-03 02:47:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:42,344 INFO L93 Difference]: Finished difference Result 3898 states and 5592 transitions. [2019-10-03 02:47:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:42,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-10-03 02:47:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:42,352 INFO L225 Difference]: With dead ends: 3898 [2019-10-03 02:47:42,352 INFO L226 Difference]: Without dead ends: 3898 [2019-10-03 02:47:42,352 INFO L640 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-03 02:47:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2019-10-03 02:47:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3886. [2019-10-03 02:47:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-10-03 02:47:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5578 transitions. [2019-10-03 02:47:42,426 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5578 transitions. Word has length 111 [2019-10-03 02:47:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 3886 states and 5578 transitions. [2019-10-03 02:47:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5578 transitions. [2019-10-03 02:47:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:47:42,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:42,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:42,428 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2079286841, now seen corresponding path program 1 times [2019-10-03 02:47:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:47:42,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:42,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:47:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:47:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:42,624 INFO L87 Difference]: Start difference. First operand 3886 states and 5578 transitions. Second operand 9 states. [2019-10-03 02:47:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:44,857 INFO L93 Difference]: Finished difference Result 3946 states and 5673 transitions. [2019-10-03 02:47:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:47:44,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-03 02:47:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:44,866 INFO L225 Difference]: With dead ends: 3946 [2019-10-03 02:47:44,867 INFO L226 Difference]: Without dead ends: 3946 [2019-10-03 02:47:44,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:47:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-10-03 02:47:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3896. [2019-10-03 02:47:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-03 02:47:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 5590 transitions. [2019-10-03 02:47:44,943 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 5590 transitions. Word has length 111 [2019-10-03 02:47:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:44,943 INFO L475 AbstractCegarLoop]: Abstraction has 3896 states and 5590 transitions. [2019-10-03 02:47:44,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:47:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 5590 transitions. [2019-10-03 02:47:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:47:44,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:44,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:44,945 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1392010840, now seen corresponding path program 1 times [2019-10-03 02:47:44,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:44,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:44,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:45,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:45,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:45,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:47:45,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:45,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:47:45,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:47:45,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:47:45,168 INFO L87 Difference]: Start difference. First operand 3896 states and 5590 transitions. Second operand 9 states. [2019-10-03 02:47:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:47,412 INFO L93 Difference]: Finished difference Result 3910 states and 5606 transitions. [2019-10-03 02:47:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:47:47,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-03 02:47:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:47,423 INFO L225 Difference]: With dead ends: 3910 [2019-10-03 02:47:47,423 INFO L226 Difference]: Without dead ends: 3910 [2019-10-03 02:47:47,423 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:47:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2019-10-03 02:47:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3900. [2019-10-03 02:47:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-10-03 02:47:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5594 transitions. [2019-10-03 02:47:47,566 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5594 transitions. Word has length 111 [2019-10-03 02:47:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:47,566 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 5594 transitions. [2019-10-03 02:47:47,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:47:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5594 transitions. [2019-10-03 02:47:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:47:47,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:47,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:47,568 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1319118770, now seen corresponding path program 1 times [2019-10-03 02:47:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:47,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:47,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:47:47,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:47,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:47:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:47:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:47,787 INFO L87 Difference]: Start difference. First operand 3900 states and 5594 transitions. Second operand 8 states. [2019-10-03 02:50:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:29,507 INFO L93 Difference]: Finished difference Result 7817 states and 11251 transitions. [2019-10-03 02:50:29,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:50:29,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-10-03 02:50:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:29,529 INFO L225 Difference]: With dead ends: 7817 [2019-10-03 02:50:29,529 INFO L226 Difference]: Without dead ends: 7817 [2019-10-03 02:50:29,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7817 states. [2019-10-03 02:50:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7817 to 7626. [2019-10-03 02:50:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2019-10-03 02:50:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 11007 transitions. [2019-10-03 02:50:29,716 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 11007 transitions. Word has length 112 [2019-10-03 02:50:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:29,716 INFO L475 AbstractCegarLoop]: Abstraction has 7626 states and 11007 transitions. [2019-10-03 02:50:29,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:50:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 11007 transitions. [2019-10-03 02:50:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:50:29,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:29,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:29,718 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1695984848, now seen corresponding path program 1 times [2019-10-03 02:50:29,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:29,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:29,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:29,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:50:29,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:29,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:50:29,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:29,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:50:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:50:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:50:29,959 INFO L87 Difference]: Start difference. First operand 7626 states and 11007 transitions. Second operand 4 states. [2019-10-03 02:50:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:30,144 INFO L93 Difference]: Finished difference Result 7658 states and 11053 transitions. [2019-10-03 02:50:30,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:50:30,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 02:50:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:30,171 INFO L225 Difference]: With dead ends: 7658 [2019-10-03 02:50:30,172 INFO L226 Difference]: Without dead ends: 7652 [2019-10-03 02:50:30,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2019-10-03 02:50:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7652. [2019-10-03 02:50:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2019-10-03 02:50:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 11045 transitions. [2019-10-03 02:50:30,539 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 11045 transitions. Word has length 112 [2019-10-03 02:50:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:30,540 INFO L475 AbstractCegarLoop]: Abstraction has 7652 states and 11045 transitions. [2019-10-03 02:50:30,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:50:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 11045 transitions. [2019-10-03 02:50:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:50:30,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:30,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:30,545 INFO L418 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash -298592059, now seen corresponding path program 1 times [2019-10-03 02:50:30,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:30,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:50:30,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:30,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:50:30,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:30,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:50:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:50:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:50:30,775 INFO L87 Difference]: Start difference. First operand 7652 states and 11045 transitions. Second operand 4 states. [2019-10-03 02:50:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:30,935 INFO L93 Difference]: Finished difference Result 7694 states and 11099 transitions. [2019-10-03 02:50:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:50:30,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 02:50:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:30,960 INFO L225 Difference]: With dead ends: 7694 [2019-10-03 02:50:30,960 INFO L226 Difference]: Without dead ends: 7690 [2019-10-03 02:50:30,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7690 states. [2019-10-03 02:50:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7690 to 7660. [2019-10-03 02:50:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7660 states. [2019-10-03 02:50:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7660 states to 7660 states and 11059 transitions. [2019-10-03 02:50:31,306 INFO L78 Accepts]: Start accepts. Automaton has 7660 states and 11059 transitions. Word has length 113 [2019-10-03 02:50:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:31,306 INFO L475 AbstractCegarLoop]: Abstraction has 7660 states and 11059 transitions. [2019-10-03 02:50:31,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:50:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7660 states and 11059 transitions. [2019-10-03 02:50:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:50:31,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:31,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:31,308 INFO L418 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash -658667282, now seen corresponding path program 1 times [2019-10-03 02:50:31,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:31,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:31,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:50:31,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:50:31,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:50:31,510 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 02:50:31,513 INFO L207 CegarAbsIntRunner]: [763], [768], [855], [858], [861], [863], [879], [888], [891], [898], [906], [927], [928], [931], [932], [933], [936], [939], [946], [951], [956], [959], [1604], [1605], [2151], [2155], [2157], [2161], [2163], [2164], [2184], [2187], [2193], [2199], [2201], [2203], [2205], [2210], [2212], [2213], [2445], [2446], [2480], [2482], [2483], [2662], [3800], [3804], [3809], [3815], [3820], [3825], [3828], [3981], [3984], [3986], [4150], [4151], [4658], [4671], [4673], [4676], [4679], [4742], [4841], [4852], [4858], [4864], [4868], [4873], [4877], [4882], [4884], [4891], [4893], [4894], [4895], [4898], [4902], [5183], [5186], [5188], [5614], [5632], [5633], [5640], [5641], [5642], [5643], [5650], [5848], [5849], [5850], [5851], [5856], [5857], [5858], [5859], [5910], [5911], [6150], [6151], [6152], [6153], [6158], [6350], [6354], [6355], [6372], [6394], [6395], [6540], [6541], [6542] [2019-10-03 02:50:31,598 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:50:31,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:50:31,759 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:50:31,761 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 141 root evaluator evaluations with a maximum evaluation depth of 0. Performed 141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 238 variables. [2019-10-03 02:50:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:31,768 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:50:31,887 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:50:31,887 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:50:31,896 INFO L420 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2019-10-03 02:50:31,897 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:50:31,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:50:31,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-10-03 02:50:31,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:31,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:31,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:31,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:31,901 INFO L87 Difference]: Start difference. First operand 7660 states and 11059 transitions. Second operand 2 states. [2019-10-03 02:50:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:31,902 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:50:31,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:31,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 114 [2019-10-03 02:50:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:31,903 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:50:31,903 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:50:31,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:50:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:50:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:50:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:50:31,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2019-10-03 02:50:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:31,905 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:50:31,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:50:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:50:31,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:50:31 BoogieIcfgContainer [2019-10-03 02:50:31,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:50:31,917 INFO L168 Benchmark]: Toolchain (without parser) took 726967.56 ms. Allocated memory was 133.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 78.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 810.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,918 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,919 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3239.95 ms. Allocated memory was 133.7 MB in the beginning and 263.7 MB in the end (delta: 130.0 MB). Free memory was 77.7 MB in the beginning and 105.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,927 INFO L168 Benchmark]: Boogie Preprocessor took 656.48 ms. Allocated memory was 263.7 MB in the beginning and 271.1 MB in the end (delta: 7.3 MB). Free memory was 105.8 MB in the beginning and 171.7 MB in the end (delta: -66.0 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,928 INFO L168 Benchmark]: RCFGBuilder took 76285.35 ms. Allocated memory was 271.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 169.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,931 INFO L168 Benchmark]: TraceAbstraction took 646780.33 ms. Allocated memory was 1.7 GB in the beginning and 2.4 GB in the end (delta: 630.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -94.7 MB). Peak memory consumption was 535.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:50:31,941 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3239.95 ms. Allocated memory was 133.7 MB in the beginning and 263.7 MB in the end (delta: 130.0 MB). Free memory was 77.7 MB in the beginning and 105.8 MB in the end (delta: -28.0 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 656.48 ms. Allocated memory was 263.7 MB in the beginning and 271.1 MB in the end (delta: 7.3 MB). Free memory was 105.8 MB in the beginning and 171.7 MB in the end (delta: -66.0 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 76285.35 ms. Allocated memory was 271.1 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 169.6 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * TraceAbstraction took 646780.33 ms. Allocated memory was 1.7 GB in the beginning and 2.4 GB in the end (delta: 630.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -94.7 MB). Peak memory consumption was 535.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2407]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 221 procedures, 2448 locations, 1 error locations. SAFE Result, 646.7s OverallTime, 83 OverallIterations, 2 TraceHistogramMax, 614.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 219376 SDtfs, 77960 SDslu, 866114 SDs, 0 SdLazy, 57518 SolverSat, 22736 SolverUnsat, 191 SolverUnknown, 0 SolverNotchecked, 580.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 827 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7660occurred in iteration=82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 3.230088495575221 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 83 MinimizatonAttempts, 13899 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 6586 NumberOfCodeBlocks, 6586 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 6503 ConstructedInterpolants, 0 QuantifiedInterpolants, 792810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 83 InterpolantComputations, 82 PerfectInterpolantSequences, 25/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...