java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:43:34,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:43:34,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:43:34,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:43:34,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:43:34,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:43:34,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:43:34,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:43:34,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:43:34,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:43:34,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:43:34,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:43:34,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:43:34,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:43:34,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:43:34,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:43:34,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:43:34,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:43:34,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:43:34,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:43:34,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:43:34,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:43:34,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:43:34,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:43:34,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:43:34,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:43:34,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:43:34,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:43:34,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:43:34,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:43:34,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:43:34,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:43:34,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:43:34,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:43:34,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:43:34,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:43:34,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:43:34,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:43:34,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:43:34,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:43:34,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:43:34,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:43:34,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:43:34,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:43:34,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:43:34,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:43:34,813 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:43:34,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:43:34,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:43:34,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:43:34,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:43:34,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:43:34,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:43:34,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:43:34,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:43:34,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:43:34,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:43:34,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:43:34,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:43:34,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:43:34,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:43:34,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:43:34,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:43:34,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:43:34,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:43:34,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:43:34,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:43:34,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:43:34,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:43:34,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:43:34,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:43:34,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:43:34,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:43:34,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:43:34,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:43:34,876 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:43:34,877 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-02 11:43:34,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/867b55812/f031a9d15f85439a992ea5620e5fdffe/FLAGf6929340e [2019-10-02 11:43:35,833 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:43:35,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-10-02 11:43:35,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/867b55812/f031a9d15f85439a992ea5620e5fdffe/FLAGf6929340e [2019-10-02 11:43:36,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/867b55812/f031a9d15f85439a992ea5620e5fdffe [2019-10-02 11:43:36,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:43:36,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:43:36,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:43:36,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:43:36,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:43:36,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:43:36" (1/1) ... [2019-10-02 11:43:36,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c2fa46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:36, skipping insertion in model container [2019-10-02 11:43:36,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:43:36" (1/1) ... [2019-10-02 11:43:36,322 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:43:36,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:43:38,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:43:38,182 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:43:38,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:43:38,977 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:43:38,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38 WrapperNode [2019-10-02 11:43:38,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:43:38,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:43:38,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:43:38,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:43:38,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:38,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (1/1) ... [2019-10-02 11:43:39,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:43:39,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:43:39,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:43:39,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:43:39,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (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-02 11:43:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:43:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:43:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-02 11:43:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-02 11:43:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~TO~VOID [2019-10-02 11:43:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-10-02 11:43:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlIntegerToUnicodeString [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlUnicodeStringToInteger [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAppendUnicodeStringToString [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-02 11:43:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-02 11:43:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-10-02 11:43:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeDpc [2019-10-02 11:43:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInsertQueueDpc [2019-10-02 11:43:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2019-10-02 11:43:39,628 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2019-10-02 11:43:39,630 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireCancelSpinLock [2019-10-02 11:43:39,630 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-10-02 11:43:39,630 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2019-10-02 11:43:39,631 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2019-10-02 11:43:39,631 INFO L138 BoogieDeclarations]: Found implementation of procedure IoInitializeRemoveLockEx [2019-10-02 11:43:39,631 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2019-10-02 11:43:39,631 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2019-10-02 11:43:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-10-02 11:43:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-10-02 11:43:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-02 11:43:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2019-10-02 11:43:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2019-10-02 11:43:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2019-10-02 11:43:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfReferenceObject [2019-10-02 11:43:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwQueryValueKey [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwSetValueKey [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2019-10-02 11:43:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2019-10-02 11:43:39,635 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpPptRemovalRelationsStruct [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2019-10-02 11:43:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2019-10-02 11:43:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2019-10-02 11:43:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2019-10-02 11:43:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2019-10-02 11:43:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2019-10-02 11:43:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2019-10-02 11:43:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2019-10-02 11:43:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2019-10-02 11:43:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2019-10-02 11:43:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2019-10-02 11:43:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2019-10-02 11:43:39,642 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2019-10-02 11:43:39,642 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2019-10-02 11:43:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2019-10-02 11:43:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2019-10-02 11:43:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2019-10-02 11:43:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2019-10-02 11:43:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2019-10-02 11:43:39,644 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpInitDispatchFunctionTable [2019-10-02 11:43:39,644 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpAddDevice [2019-10-02 11:43:39,645 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2019-10-02 11:43:39,645 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2019-10-02 11:43:39,645 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-02 11:43:39,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2019-10-02 11:43:39,647 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2019-10-02 11:43:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2019-10-02 11:43:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2019-10-02 11:43:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2019-10-02 11:43:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2019-10-02 11:43:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2019-10-02 11:43:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2019-10-02 11:43:39,650 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2019-10-02 11:43:39,650 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2019-10-02 11:43:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegInitDriverSettings [2019-10-02 11:43:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegGetDeviceParameterDword [2019-10-02 11:43:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegSetDeviceParameterDword [2019-10-02 11:43:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2019-10-02 11:43:39,652 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPreProcessIrp [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPostProcessIrp [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2019-10-02 11:43:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2019-10-02 11:43:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2019-10-02 11:43:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2019-10-02 11:43:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedRead [2019-10-02 11:43:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedQueue [2019-10-02 11:43:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDisconnect [2019-10-02 11:43:39,655 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCancelRoutine [2019-10-02 11:43:39,655 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortDpc [2019-10-02 11:43:39,655 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePortAtInterruptLevel [2019-10-02 11:43:39,656 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortFromInterruptLevel [2019-10-02 11:43:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInterruptService [2019-10-02 11:43:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePort [2019-10-02 11:43:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTraversePortCheckList [2019-10-02 11:43:39,660 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure PptQueryNumWaiters [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildParallelPortDeviceName [2019-10-02 11:43:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitializeDeviceExtension [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNumberFromLptName [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildDeviceObject [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiRegInfo [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiDataBlock [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:43:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:43:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:43:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-02 11:43:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-02 11:43:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-02 11:43:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-02 11:43:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-02 11:43:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-02 11:43:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:43:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-02 11:43:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-02 11:43:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-02 11:43:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-02 11:43:39,674 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:43:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-02 11:43:39,676 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-02 11:43:39,676 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-02 11:43:39,676 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:43:39,677 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-02 11:43:39,677 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-02 11:43:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-10-02 11:43:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2019-10-02 11:43:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 11:43:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 11:43:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-02 11:43:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:43:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 11:43:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure RtlIntegerToUnicodeString [2019-10-02 11:43:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlUnicodeStringToInteger [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-02 11:43:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAppendUnicodeStringToString [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-10-02 11:43:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeDpc [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeInsertQueueDpc [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-02 11:43:39,684 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-02 11:43:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:43:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-02 11:43:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-02 11:43:39,686 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2019-10-02 11:43:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-02 11:43:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-02 11:43:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-02 11:43:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-02 11:43:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-02 11:43:39,692 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireCancelSpinLock [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:43:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:43:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:43:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:43:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:43:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2019-10-02 11:43:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-02 11:43:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoInitializeRemoveLockEx [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2019-10-02 11:43:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2019-10-02 11:43:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ObfReferenceObject [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ZwQueryValueKey [2019-10-02 11:43:39,698 INFO L130 BoogieDeclarations]: Found specification of procedure ZwSetValueKey [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpInitDispatchFunctionTable [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpAddDevice [2019-10-02 11:43:39,699 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPreProcessIrp [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPostProcessIrp [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2019-10-02 11:43:39,700 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedRead [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedQueue [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDisconnect [2019-10-02 11:43:39,701 INFO L130 BoogieDeclarations]: Found specification of procedure PptCancelRoutine [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortDpc [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePortAtInterruptLevel [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortFromInterruptLevel [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptInterruptService [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePort [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptTraversePortCheckList [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptQueryNumWaiters [2019-10-02 11:43:39,702 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegInitDriverSettings [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2019-10-02 11:43:39,703 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2019-10-02 11:43:39,704 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2019-10-02 11:43:39,705 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegGetDeviceParameterDword [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegSetDeviceParameterDword [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildParallelPortDeviceName [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitializeDeviceExtension [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNumberFromLptName [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildDeviceObject [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2019-10-02 11:43:39,706 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2019-10-02 11:43:39,707 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2019-10-02 11:43:39,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:43:39,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-02 11:43:39,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpPptRemovalRelationsStruct [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2019-10-02 11:43:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2019-10-02 11:43:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2019-10-02 11:43:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2019-10-02 11:43:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2019-10-02 11:43:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2019-10-02 11:43:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~TO~VOID [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiRegInfo [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiDataBlock [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:43:39,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 11:43:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 11:43:41,094 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:41,158 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:41,158 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:41,437 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:53,086 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-10-02 11:43:53,086 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-10-02 11:43:53,119 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:59,526 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:43:59,526 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:43:59,527 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:59,545 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:59,545 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:59,666 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:59,707 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 11:43:59,708 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 11:43:59,708 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:59,719 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:59,719 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:00,036 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:00,058 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:00,058 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:00,186 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:00,246 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:44:00,247 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:44:00,481 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:02,721 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-02 11:44:02,721 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-02 11:44:02,723 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:02,757 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:44:02,757 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:44:02,784 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:02,801 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:02,801 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:03,106 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:08,969 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-10-02 11:44:08,969 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-10-02 11:44:11,111 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:11,119 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:11,119 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:11,224 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:11,225 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:17,601 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 11:44:17,601 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-10-02 11:44:17,601 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 11:44:17,601 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-10-02 11:44:17,876 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:17,885 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:17,885 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:22,952 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:22,962 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:22,962 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,594 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,606 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,606 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,607 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,621 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,621 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,659 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,669 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,669 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,670 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,679 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,679 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,679 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,691 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,691 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,866 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,874 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,875 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,887 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:23,894 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:23,895 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:24,009 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:24,017 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:24,017 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:24,042 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:24,049 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:24,049 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:24,690 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:24,698 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:24,698 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:24,713 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:30,134 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-02 11:44:30,134 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-02 11:44:30,144 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:30,245 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-10-02 11:44:30,245 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-10-02 11:44:30,583 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:30,604 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:30,605 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:30,680 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:30,755 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-02 11:44:30,755 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-02 11:44:30,850 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:41,617 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-02 11:44:41,617 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-02 11:44:41,668 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:47,059 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:44:47,060 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:44:47,060 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:47,093 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:44:47,093 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:44:49,260 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:49,276 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:44:49,276 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:44:51,531 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:51,539 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:51,540 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:51,765 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:57,378 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-02 11:44:57,379 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-02 11:44:57,435 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:44:57,435 INFO L283 CfgBuilder]: Removed 37 assume(true) statements. [2019-10-02 11:44:57,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:57 BoogieIcfgContainer [2019-10-02 11:44:57,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:44:57,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:44:57,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:44:57,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:44:57,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:43:36" (1/3) ... [2019-10-02 11:44:57,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45758d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:57, skipping insertion in model container [2019-10-02 11:44:57,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:43:38" (2/3) ... [2019-10-02 11:44:57,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45758d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:57, skipping insertion in model container [2019-10-02 11:44:57,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:57" (3/3) ... [2019-10-02 11:44:57,446 INFO L109 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2019-10-02 11:44:57,463 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:44:57,473 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:44:57,494 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:44:57,550 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:44:57,551 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:44:57,551 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:44:57,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:44:57,551 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:44:57,551 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:44:57,552 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:44:57,552 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:44:57,552 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:44:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states. [2019-10-02 11:44:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:44:57,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:57,628 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-02 11:44:57,631 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 300354810, now seen corresponding path program 1 times [2019-10-02 11:44:57,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:57,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:57,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:58,280 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-02 11:44:58,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:58,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:58,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:58,304 INFO L87 Difference]: Start difference. First operand 2173 states. Second operand 3 states. [2019-10-02 11:44:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:58,753 INFO L93 Difference]: Finished difference Result 3713 states and 5641 transitions. [2019-10-02 11:44:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:58,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:44:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:58,873 INFO L225 Difference]: With dead ends: 3713 [2019-10-02 11:44:58,874 INFO L226 Difference]: Without dead ends: 1907 [2019-10-02 11:44:58,889 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-02 11:44:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2019-10-02 11:44:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1907. [2019-10-02 11:44:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-10-02 11:44:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2740 transitions. [2019-10-02 11:44:59,134 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2740 transitions. Word has length 20 [2019-10-02 11:44:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:59,134 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2740 transitions. [2019-10-02 11:44:59,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2740 transitions. [2019-10-02 11:44:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:44:59,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:59,140 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-02 11:44:59,140 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash -227578647, now seen corresponding path program 1 times [2019-10-02 11:44:59,140 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:59,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:59,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:59,384 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-02 11:44:59,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:59,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:59,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:59,392 INFO L87 Difference]: Start difference. First operand 1907 states and 2740 transitions. Second operand 3 states. [2019-10-02 11:44:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:59,955 INFO L93 Difference]: Finished difference Result 4830 states and 7033 transitions. [2019-10-02 11:44:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:59,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 11:44:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:59,982 INFO L225 Difference]: With dead ends: 4830 [2019-10-02 11:44:59,982 INFO L226 Difference]: Without dead ends: 3581 [2019-10-02 11:44:59,990 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-02 11:44:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-10-02 11:45:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3560. [2019-10-02 11:45:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-10-02 11:45:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5176 transitions. [2019-10-02 11:45:00,195 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5176 transitions. Word has length 30 [2019-10-02 11:45:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:00,195 INFO L475 AbstractCegarLoop]: Abstraction has 3560 states and 5176 transitions. [2019-10-02 11:45:00,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5176 transitions. [2019-10-02 11:45:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:45:00,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:00,201 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-02 11:45:00,202 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 833048032, now seen corresponding path program 1 times [2019-10-02 11:45:00,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:00,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:00,451 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-02 11:45:00,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:00,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:00,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:00,453 INFO L87 Difference]: Start difference. First operand 3560 states and 5176 transitions. Second operand 5 states. [2019-10-02 11:45:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:06,334 INFO L93 Difference]: Finished difference Result 4334 states and 6293 transitions. [2019-10-02 11:45:06,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:06,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 11:45:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:06,375 INFO L225 Difference]: With dead ends: 4334 [2019-10-02 11:45:06,375 INFO L226 Difference]: Without dead ends: 4323 [2019-10-02 11:45:06,380 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-02 11:45:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-10-02 11:45:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4292. [2019-10-02 11:45:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-02 11:45:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6241 transitions. [2019-10-02 11:45:06,795 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6241 transitions. Word has length 45 [2019-10-02 11:45:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:06,797 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6241 transitions. [2019-10-02 11:45:06,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6241 transitions. [2019-10-02 11:45:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:45:06,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:06,804 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-02 11:45:06,805 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash -383328916, now seen corresponding path program 1 times [2019-10-02 11:45:06,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:06,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:07,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-02 11:45:07,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:07,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:07,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:07,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:07,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:07,179 INFO L87 Difference]: Start difference. First operand 4292 states and 6241 transitions. Second operand 5 states. [2019-10-02 11:45:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:13,729 INFO L93 Difference]: Finished difference Result 4325 states and 6278 transitions. [2019-10-02 11:45:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:13,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-02 11:45:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:13,762 INFO L225 Difference]: With dead ends: 4325 [2019-10-02 11:45:13,762 INFO L226 Difference]: Without dead ends: 4317 [2019-10-02 11:45:13,766 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-02 11:45:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-10-02 11:45:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4292. [2019-10-02 11:45:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-10-02 11:45:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6240 transitions. [2019-10-02 11:45:14,014 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6240 transitions. Word has length 46 [2019-10-02 11:45:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:14,016 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6240 transitions. [2019-10-02 11:45:14,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6240 transitions. [2019-10-02 11:45:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:45:14,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:14,021 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-02 11:45:14,021 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash 238606324, now seen corresponding path program 1 times [2019-10-02 11:45:14,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:14,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:14,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:14,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:14,212 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-02 11:45:14,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:14,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:45:14,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:45:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:45:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:14,214 INFO L87 Difference]: Start difference. First operand 4292 states and 6240 transitions. Second operand 3 states. [2019-10-02 11:45:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:14,413 INFO L93 Difference]: Finished difference Result 7100 states and 10289 transitions. [2019-10-02 11:45:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:45:14,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 11:45:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:14,452 INFO L225 Difference]: With dead ends: 7100 [2019-10-02 11:45:14,453 INFO L226 Difference]: Without dead ends: 6722 [2019-10-02 11:45:14,460 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-02 11:45:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-10-02 11:45:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 6660. [2019-10-02 11:45:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-10-02 11:45:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9703 transitions. [2019-10-02 11:45:14,860 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9703 transitions. Word has length 47 [2019-10-02 11:45:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:14,861 INFO L475 AbstractCegarLoop]: Abstraction has 6660 states and 9703 transitions. [2019-10-02 11:45:14,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9703 transitions. [2019-10-02 11:45:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:45:14,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:14,864 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-02 11:45:14,864 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash 732695703, now seen corresponding path program 1 times [2019-10-02 11:45:14,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:14,999 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-02 11:45:15,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:15,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:45:15,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:45:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:45:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:15,004 INFO L87 Difference]: Start difference. First operand 6660 states and 9703 transitions. Second operand 3 states. [2019-10-02 11:45:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:15,224 INFO L93 Difference]: Finished difference Result 6785 states and 9852 transitions. [2019-10-02 11:45:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:45:15,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 11:45:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:15,272 INFO L225 Difference]: With dead ends: 6785 [2019-10-02 11:45:15,272 INFO L226 Difference]: Without dead ends: 6756 [2019-10-02 11:45:15,277 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-02 11:45:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-10-02 11:45:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6689. [2019-10-02 11:45:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-10-02 11:45:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9734 transitions. [2019-10-02 11:45:15,711 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9734 transitions. Word has length 47 [2019-10-02 11:45:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:15,711 INFO L475 AbstractCegarLoop]: Abstraction has 6689 states and 9734 transitions. [2019-10-02 11:45:15,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9734 transitions. [2019-10-02 11:45:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:45:15,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:15,716 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-02 11:45:15,717 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1153041076, now seen corresponding path program 1 times [2019-10-02 11:45:15,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:15,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:15,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:16,093 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-02 11:45:16,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:16,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:16,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:16,094 INFO L87 Difference]: Start difference. First operand 6689 states and 9734 transitions. Second operand 5 states. [2019-10-02 11:45:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:16,338 INFO L93 Difference]: Finished difference Result 12741 states and 18530 transitions. [2019-10-02 11:45:16,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:45:16,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-02 11:45:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:16,370 INFO L225 Difference]: With dead ends: 12741 [2019-10-02 11:45:16,370 INFO L226 Difference]: Without dead ends: 6696 [2019-10-02 11:45:16,395 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-02 11:45:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-10-02 11:45:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6693. [2019-10-02 11:45:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2019-10-02 11:45:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9739 transitions. [2019-10-02 11:45:16,815 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9739 transitions. Word has length 64 [2019-10-02 11:45:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:16,816 INFO L475 AbstractCegarLoop]: Abstraction has 6693 states and 9739 transitions. [2019-10-02 11:45:16,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9739 transitions. [2019-10-02 11:45:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:45:16,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:16,819 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-02 11:45:16,819 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 958249293, now seen corresponding path program 1 times [2019-10-02 11:45:16,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:16,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:16,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:17,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:17,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:17,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:17,100 INFO L87 Difference]: Start difference. First operand 6693 states and 9739 transitions. Second operand 8 states. [2019-10-02 11:45:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:19,475 INFO L93 Difference]: Finished difference Result 12140 states and 17617 transitions. [2019-10-02 11:45:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:19,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-10-02 11:45:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:19,517 INFO L225 Difference]: With dead ends: 12140 [2019-10-02 11:45:19,518 INFO L226 Difference]: Without dead ends: 6535 [2019-10-02 11:45:19,541 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-02 11:45:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2019-10-02 11:45:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6532. [2019-10-02 11:45:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-02 11:45:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9464 transitions. [2019-10-02 11:45:19,901 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9464 transitions. Word has length 64 [2019-10-02 11:45:19,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:19,902 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9464 transitions. [2019-10-02 11:45:19,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9464 transitions. [2019-10-02 11:45:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:45:19,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:19,905 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-02 11:45:19,905 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1147187110, now seen corresponding path program 1 times [2019-10-02 11:45:19,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:19,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:19,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:20,103 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-02 11:45:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:45:20,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:45:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:45:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:20,105 INFO L87 Difference]: Start difference. First operand 6532 states and 9464 transitions. Second operand 3 states. [2019-10-02 11:45:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:20,366 INFO L93 Difference]: Finished difference Result 6535 states and 9466 transitions. [2019-10-02 11:45:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:45:20,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 11:45:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:20,392 INFO L225 Difference]: With dead ends: 6535 [2019-10-02 11:45:20,392 INFO L226 Difference]: Without dead ends: 6532 [2019-10-02 11:45:20,396 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-02 11:45:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-10-02 11:45:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6532. [2019-10-02 11:45:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-10-02 11:45:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9463 transitions. [2019-10-02 11:45:20,778 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9463 transitions. Word has length 47 [2019-10-02 11:45:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:20,779 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9463 transitions. [2019-10-02 11:45:20,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9463 transitions. [2019-10-02 11:45:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:45:20,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:20,781 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-02 11:45:20,781 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1245298868, now seen corresponding path program 1 times [2019-10-02 11:45:20,781 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:20,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:20,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:20,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:20,951 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-02 11:45:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:20,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:20,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:20,953 INFO L87 Difference]: Start difference. First operand 6532 states and 9463 transitions. Second operand 5 states. [2019-10-02 11:45:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:21,164 INFO L93 Difference]: Finished difference Result 6547 states and 9479 transitions. [2019-10-02 11:45:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:45:21,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-02 11:45:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:21,196 INFO L225 Difference]: With dead ends: 6547 [2019-10-02 11:45:21,196 INFO L226 Difference]: Without dead ends: 6506 [2019-10-02 11:45:21,205 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-02 11:45:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-10-02 11:45:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6506. [2019-10-02 11:45:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-10-02 11:45:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 9426 transitions. [2019-10-02 11:45:21,630 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 9426 transitions. Word has length 48 [2019-10-02 11:45:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:21,631 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 9426 transitions. [2019-10-02 11:45:21,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 9426 transitions. [2019-10-02 11:45:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:45:21,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:21,633 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-02 11:45:21,633 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:21,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:21,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1265177314, now seen corresponding path program 1 times [2019-10-02 11:45:21,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:21,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:21,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:21,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:21,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:21,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:21,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:21,841 INFO L87 Difference]: Start difference. First operand 6506 states and 9426 transitions. Second operand 8 states. [2019-10-02 11:45:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:22,231 INFO L93 Difference]: Finished difference Result 6550 states and 9478 transitions. [2019-10-02 11:45:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:22,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-10-02 11:45:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:22,264 INFO L225 Difference]: With dead ends: 6550 [2019-10-02 11:45:22,264 INFO L226 Difference]: Without dead ends: 6506 [2019-10-02 11:45:22,272 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-02 11:45:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-10-02 11:45:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6503. [2019-10-02 11:45:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-10-02 11:45:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9422 transitions. [2019-10-02 11:45:22,626 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9422 transitions. Word has length 48 [2019-10-02 11:45:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:22,628 INFO L475 AbstractCegarLoop]: Abstraction has 6503 states and 9422 transitions. [2019-10-02 11:45:22,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9422 transitions. [2019-10-02 11:45:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:45:22,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:22,631 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-02 11:45:22,631 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1055190255, now seen corresponding path program 1 times [2019-10-02 11:45:22,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:22,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:22,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:22,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:22,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:22,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:22,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:22,776 INFO L87 Difference]: Start difference. First operand 6503 states and 9422 transitions. Second operand 5 states. [2019-10-02 11:45:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:22,959 INFO L93 Difference]: Finished difference Result 6518 states and 9438 transitions. [2019-10-02 11:45:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:45:22,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-02 11:45:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:22,985 INFO L225 Difference]: With dead ends: 6518 [2019-10-02 11:45:22,985 INFO L226 Difference]: Without dead ends: 6501 [2019-10-02 11:45:22,991 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-02 11:45:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2019-10-02 11:45:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 6501. [2019-10-02 11:45:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-10-02 11:45:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9418 transitions. [2019-10-02 11:45:23,339 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9418 transitions. Word has length 52 [2019-10-02 11:45:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:23,339 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9418 transitions. [2019-10-02 11:45:23,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9418 transitions. [2019-10-02 11:45:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:45:23,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:23,342 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-02 11:45:23,342 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1500953186, now seen corresponding path program 1 times [2019-10-02 11:45:23,342 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:23,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:23,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:23,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:23,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:23,571 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-02 11:45:23,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:23,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:23,573 INFO L87 Difference]: Start difference. First operand 6501 states and 9418 transitions. Second operand 8 states. [2019-10-02 11:45:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:23,872 INFO L93 Difference]: Finished difference Result 6519 states and 9437 transitions. [2019-10-02 11:45:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:23,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-02 11:45:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:23,899 INFO L225 Difference]: With dead ends: 6519 [2019-10-02 11:45:23,899 INFO L226 Difference]: Without dead ends: 6499 [2019-10-02 11:45:23,905 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-02 11:45:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-10-02 11:45:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-10-02 11:45:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-10-02 11:45:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9413 transitions. [2019-10-02 11:45:24,264 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9413 transitions. Word has length 52 [2019-10-02 11:45:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:24,264 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9413 transitions. [2019-10-02 11:45:24,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9413 transitions. [2019-10-02 11:45:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:45:24,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:24,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:24,270 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1349184777, now seen corresponding path program 1 times [2019-10-02 11:45:24,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:24,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:24,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:24,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:24,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:24,468 INFO L87 Difference]: Start difference. First operand 6499 states and 9413 transitions. Second operand 8 states. [2019-10-02 11:45:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:26,733 INFO L93 Difference]: Finished difference Result 6544 states and 9466 transitions. [2019-10-02 11:45:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:26,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-02 11:45:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:26,757 INFO L225 Difference]: With dead ends: 6544 [2019-10-02 11:45:26,757 INFO L226 Difference]: Without dead ends: 6499 [2019-10-02 11:45:26,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-10-02 11:45:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-10-02 11:45:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-10-02 11:45:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9412 transitions. [2019-10-02 11:45:27,090 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9412 transitions. Word has length 55 [2019-10-02 11:45:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:27,091 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9412 transitions. [2019-10-02 11:45:27,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9412 transitions. [2019-10-02 11:45:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:45:27,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:27,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:27,105 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -139491608, now seen corresponding path program 1 times [2019-10-02 11:45:27,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:27,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:27,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:27,300 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-02 11:45:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:27,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:27,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:27,302 INFO L87 Difference]: Start difference. First operand 6499 states and 9412 transitions. Second operand 8 states. [2019-10-02 11:45:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:27,544 INFO L93 Difference]: Finished difference Result 6537 states and 9460 transitions. [2019-10-02 11:45:27,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:27,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-02 11:45:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:27,581 INFO L225 Difference]: With dead ends: 6537 [2019-10-02 11:45:27,581 INFO L226 Difference]: Without dead ends: 6516 [2019-10-02 11:45:27,718 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-02 11:45:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2019-10-02 11:45:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6504. [2019-10-02 11:45:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2019-10-02 11:45:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9417 transitions. [2019-10-02 11:45:28,022 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9417 transitions. Word has length 51 [2019-10-02 11:45:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:28,023 INFO L475 AbstractCegarLoop]: Abstraction has 6504 states and 9417 transitions. [2019-10-02 11:45:28,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9417 transitions. [2019-10-02 11:45:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:45:28,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:28,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] [2019-10-02 11:45:28,025 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 971259367, now seen corresponding path program 1 times [2019-10-02 11:45:28,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:28,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:28,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-02 11:45:28,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:28,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:28,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:28,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:28,267 INFO L87 Difference]: Start difference. First operand 6504 states and 9417 transitions. Second operand 8 states. [2019-10-02 11:45:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:28,498 INFO L93 Difference]: Finished difference Result 6531 states and 9451 transitions. [2019-10-02 11:45:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:28,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-02 11:45:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:28,523 INFO L225 Difference]: With dead ends: 6531 [2019-10-02 11:45:28,523 INFO L226 Difference]: Without dead ends: 6510 [2019-10-02 11:45:28,528 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-02 11:45:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-10-02 11:45:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6493. [2019-10-02 11:45:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-10-02 11:45:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 9403 transitions. [2019-10-02 11:45:28,956 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 9403 transitions. Word has length 51 [2019-10-02 11:45:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:28,956 INFO L475 AbstractCegarLoop]: Abstraction has 6493 states and 9403 transitions. [2019-10-02 11:45:28,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 9403 transitions. [2019-10-02 11:45:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:45:28,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:28,961 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-02 11:45:28,961 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:28,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2145606927, now seen corresponding path program 1 times [2019-10-02 11:45:28,962 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:28,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:28,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:29,138 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-02 11:45:29,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:29,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:29,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:29,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:29,140 INFO L87 Difference]: Start difference. First operand 6493 states and 9403 transitions. Second operand 8 states. [2019-10-02 11:45:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:42,183 INFO L93 Difference]: Finished difference Result 6646 states and 9600 transitions. [2019-10-02 11:45:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:42,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-02 11:45:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:42,203 INFO L225 Difference]: With dead ends: 6646 [2019-10-02 11:45:42,203 INFO L226 Difference]: Without dead ends: 6534 [2019-10-02 11:45:42,209 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-02 11:45:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-10-02 11:45:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6501. [2019-10-02 11:45:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-10-02 11:45:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9414 transitions. [2019-10-02 11:45:42,548 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9414 transitions. Word has length 56 [2019-10-02 11:45:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:42,549 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9414 transitions. [2019-10-02 11:45:42,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9414 transitions. [2019-10-02 11:45:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:45:42,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:42,551 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-02 11:45:42,552 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1614623444, now seen corresponding path program 1 times [2019-10-02 11:45:42,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:42,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:42,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:42,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:42,689 INFO L87 Difference]: Start difference. First operand 6501 states and 9414 transitions. Second operand 5 states. [2019-10-02 11:45:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:42,854 INFO L93 Difference]: Finished difference Result 6516 states and 9430 transitions. [2019-10-02 11:45:42,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:45:42,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-02 11:45:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:42,876 INFO L225 Difference]: With dead ends: 6516 [2019-10-02 11:45:42,876 INFO L226 Difference]: Without dead ends: 6491 [2019-10-02 11:45:42,882 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-02 11:45:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-10-02 11:45:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 6491. [2019-10-02 11:45:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2019-10-02 11:45:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 9401 transitions. [2019-10-02 11:45:43,184 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 9401 transitions. Word has length 55 [2019-10-02 11:45:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:43,185 INFO L475 AbstractCegarLoop]: Abstraction has 6491 states and 9401 transitions. [2019-10-02 11:45:43,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 9401 transitions. [2019-10-02 11:45:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 11:45:43,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:43,188 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-02 11:45:43,188 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:43,188 INFO L82 PathProgramCache]: Analyzing trace with hash 801916040, now seen corresponding path program 1 times [2019-10-02 11:45:43,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:43,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:43,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:43,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:43,348 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-02 11:45:43,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:43,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:45:43,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:45:43,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:45:43,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:43,350 INFO L87 Difference]: Start difference. First operand 6491 states and 9401 transitions. Second operand 7 states. [2019-10-02 11:45:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:46,031 INFO L93 Difference]: Finished difference Result 6545 states and 9460 transitions. [2019-10-02 11:45:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:46,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-10-02 11:45:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:46,050 INFO L225 Difference]: With dead ends: 6545 [2019-10-02 11:45:46,050 INFO L226 Difference]: Without dead ends: 6496 [2019-10-02 11:45:46,054 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-02 11:45:46,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-10-02 11:45:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-10-02 11:45:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-10-02 11:45:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 9406 transitions. [2019-10-02 11:45:46,505 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 9406 transitions. Word has length 61 [2019-10-02 11:45:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:46,506 INFO L475 AbstractCegarLoop]: Abstraction has 6496 states and 9406 transitions. [2019-10-02 11:45:46,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:45:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 9406 transitions. [2019-10-02 11:45:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 11:45:46,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:46,509 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-02 11:45:46,509 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:46,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1827408039, now seen corresponding path program 1 times [2019-10-02 11:45:46,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:46,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:46,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:46,667 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-02 11:45:46,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:46,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:45:46,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:45:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:45:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:45:46,668 INFO L87 Difference]: Start difference. First operand 6496 states and 9406 transitions. Second operand 6 states. [2019-10-02 11:45:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:50,865 INFO L93 Difference]: Finished difference Result 6514 states and 9425 transitions. [2019-10-02 11:45:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:50,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-02 11:45:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:50,881 INFO L225 Difference]: With dead ends: 6514 [2019-10-02 11:45:50,882 INFO L226 Difference]: Without dead ends: 6494 [2019-10-02 11:45:50,885 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-02 11:45:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states. [2019-10-02 11:45:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 6489. [2019-10-02 11:45:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6489 states. [2019-10-02 11:45:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 9397 transitions. [2019-10-02 11:45:51,154 INFO L78 Accepts]: Start accepts. Automaton has 6489 states and 9397 transitions. Word has length 61 [2019-10-02 11:45:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:51,155 INFO L475 AbstractCegarLoop]: Abstraction has 6489 states and 9397 transitions. [2019-10-02 11:45:51,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:45:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6489 states and 9397 transitions. [2019-10-02 11:45:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 11:45:51,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:51,158 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-02 11:45:51,158 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -372962380, now seen corresponding path program 1 times [2019-10-02 11:45:51,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:51,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:51,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:51,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:51,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:51,354 INFO L87 Difference]: Start difference. First operand 6489 states and 9397 transitions. Second operand 8 states. [2019-10-02 11:45:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:51,741 INFO L93 Difference]: Finished difference Result 6507 states and 9416 transitions. [2019-10-02 11:45:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:51,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-10-02 11:45:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:51,773 INFO L225 Difference]: With dead ends: 6507 [2019-10-02 11:45:51,773 INFO L226 Difference]: Without dead ends: 6482 [2019-10-02 11:45:51,777 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-02 11:45:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-10-02 11:45:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2019-10-02 11:45:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-10-02 11:45:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 9382 transitions. [2019-10-02 11:45:52,080 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 9382 transitions. Word has length 60 [2019-10-02 11:45:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:52,080 INFO L475 AbstractCegarLoop]: Abstraction has 6482 states and 9382 transitions. [2019-10-02 11:45:52,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 9382 transitions. [2019-10-02 11:45:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 11:45:52,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:52,085 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-02 11:45:52,085 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1233382885, now seen corresponding path program 1 times [2019-10-02 11:45:52,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:52,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:52,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:52,288 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-02 11:45:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:45:52,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:45:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:45:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:52,290 INFO L87 Difference]: Start difference. First operand 6482 states and 9382 transitions. Second operand 9 states. [2019-10-02 11:48:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:39,518 INFO L93 Difference]: Finished difference Result 7777 states and 11241 transitions. [2019-10-02 11:48:39,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:48:39,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-02 11:48:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:39,545 INFO L225 Difference]: With dead ends: 7777 [2019-10-02 11:48:39,545 INFO L226 Difference]: Without dead ends: 7654 [2019-10-02 11:48:39,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:48:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7654 states. [2019-10-02 11:48:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7654 to 6490. [2019-10-02 11:48:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-10-02 11:48:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 9388 transitions. [2019-10-02 11:48:39,870 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 9388 transitions. Word has length 61 [2019-10-02 11:48:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:39,871 INFO L475 AbstractCegarLoop]: Abstraction has 6490 states and 9388 transitions. [2019-10-02 11:48:39,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:48:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 9388 transitions. [2019-10-02 11:48:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:48:39,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:39,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:39,875 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash -351171645, now seen corresponding path program 1 times [2019-10-02 11:48:39,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:39,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:48:39,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:39,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:48:39,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:48:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:48:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:48:39,986 INFO L87 Difference]: Start difference. First operand 6490 states and 9388 transitions. Second operand 3 states. [2019-10-02 11:48:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:45,420 INFO L93 Difference]: Finished difference Result 6592 states and 9517 transitions. [2019-10-02 11:48:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:48:45,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-02 11:48:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:45,436 INFO L225 Difference]: With dead ends: 6592 [2019-10-02 11:48:45,436 INFO L226 Difference]: Without dead ends: 6513 [2019-10-02 11:48:45,439 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-02 11:48:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2019-10-02 11:48:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 6486. [2019-10-02 11:48:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2019-10-02 11:48:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 9380 transitions. [2019-10-02 11:48:45,720 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 9380 transitions. Word has length 64 [2019-10-02 11:48:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:45,720 INFO L475 AbstractCegarLoop]: Abstraction has 6486 states and 9380 transitions. [2019-10-02 11:48:45,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:48:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 9380 transitions. [2019-10-02 11:48:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:48:45,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:45,725 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-02 11:48:45,725 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2025557598, now seen corresponding path program 1 times [2019-10-02 11:48:45,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:45,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:45,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:45,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:45,907 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-02 11:48:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:45,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:48:45,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:48:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:48:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:45,909 INFO L87 Difference]: Start difference. First operand 6486 states and 9380 transitions. Second operand 8 states. [2019-10-02 11:48:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:50,264 INFO L93 Difference]: Finished difference Result 6605 states and 9516 transitions. [2019-10-02 11:48:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:50,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-10-02 11:48:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:50,285 INFO L225 Difference]: With dead ends: 6605 [2019-10-02 11:48:50,286 INFO L226 Difference]: Without dead ends: 5664 [2019-10-02 11:48:50,292 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-02 11:48:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2019-10-02 11:48:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5613. [2019-10-02 11:48:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-10-02 11:48:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 8089 transitions. [2019-10-02 11:48:50,514 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 8089 transitions. Word has length 78 [2019-10-02 11:48:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:50,514 INFO L475 AbstractCegarLoop]: Abstraction has 5613 states and 8089 transitions. [2019-10-02 11:48:50,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:48:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 8089 transitions. [2019-10-02 11:48:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:48:50,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:50,518 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-02 11:48:50,518 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 308442726, now seen corresponding path program 1 times [2019-10-02 11:48:50,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:50,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:50,676 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-02 11:48:50,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:50,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:48:50,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:48:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:48:50,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:48:50,678 INFO L87 Difference]: Start difference. First operand 5613 states and 8089 transitions. Second operand 8 states. [2019-10-02 11:48:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:50,983 INFO L93 Difference]: Finished difference Result 5669 states and 8148 transitions. [2019-10-02 11:48:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:48:50,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-10-02 11:48:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:51,203 INFO L225 Difference]: With dead ends: 5669 [2019-10-02 11:48:51,205 INFO L226 Difference]: Without dead ends: 5603 [2019-10-02 11:48:51,207 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-02 11:48:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-10-02 11:48:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5603. [2019-10-02 11:48:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5603 states. [2019-10-02 11:48:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 8076 transitions. [2019-10-02 11:48:51,434 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 8076 transitions. Word has length 71 [2019-10-02 11:48:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:51,434 INFO L475 AbstractCegarLoop]: Abstraction has 5603 states and 8076 transitions. [2019-10-02 11:48:51,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:48:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 8076 transitions. [2019-10-02 11:48:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:48:51,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:51,438 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-02 11:48:51,438 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1562784128, now seen corresponding path program 1 times [2019-10-02 11:48:51,439 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:51,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:51,536 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-02 11:48:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:48:51,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:48:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:48:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:48:51,538 INFO L87 Difference]: Start difference. First operand 5603 states and 8076 transitions. Second operand 3 states. [2019-10-02 11:48:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:51,826 INFO L93 Difference]: Finished difference Result 6905 states and 9949 transitions. [2019-10-02 11:48:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:48:51,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-02 11:48:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:51,842 INFO L225 Difference]: With dead ends: 6905 [2019-10-02 11:48:51,842 INFO L226 Difference]: Without dead ends: 6892 [2019-10-02 11:48:51,846 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-02 11:48:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6892 states. [2019-10-02 11:48:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6892 to 5729. [2019-10-02 11:48:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-10-02 11:48:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8220 transitions. [2019-10-02 11:48:52,072 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8220 transitions. Word has length 63 [2019-10-02 11:48:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:52,072 INFO L475 AbstractCegarLoop]: Abstraction has 5729 states and 8220 transitions. [2019-10-02 11:48:52,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:48:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8220 transitions. [2019-10-02 11:48:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:48:52,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:52,080 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-02 11:48:52,080 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:52,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1295748992, now seen corresponding path program 1 times [2019-10-02 11:48:52,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:52,228 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-02 11:48:52,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:52,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:48:52,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:48:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:48:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:52,230 INFO L87 Difference]: Start difference. First operand 5729 states and 8220 transitions. Second operand 7 states. [2019-10-02 11:49:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:45,870 INFO L93 Difference]: Finished difference Result 5812 states and 8315 transitions. [2019-10-02 11:49:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:49:45,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-10-02 11:49:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:45,887 INFO L225 Difference]: With dead ends: 5812 [2019-10-02 11:49:45,887 INFO L226 Difference]: Without dead ends: 5583 [2019-10-02 11:49:45,889 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-02 11:49:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2019-10-02 11:49:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 5569. [2019-10-02 11:49:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-10-02 11:49:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 8030 transitions. [2019-10-02 11:49:46,087 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 8030 transitions. Word has length 63 [2019-10-02 11:49:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:46,087 INFO L475 AbstractCegarLoop]: Abstraction has 5569 states and 8030 transitions. [2019-10-02 11:49:46,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:49:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 8030 transitions. [2019-10-02 11:49:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:49:46,091 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:46,091 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-02 11:49:46,091 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash 91646988, now seen corresponding path program 1 times [2019-10-02 11:49:46,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:46,320 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-02 11:49:46,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:46,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:49:46,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:49:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:49:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:49:46,321 INFO L87 Difference]: Start difference. First operand 5569 states and 8030 transitions. Second operand 11 states. [2019-10-02 11:49:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:48,652 INFO L93 Difference]: Finished difference Result 5588 states and 8050 transitions. [2019-10-02 11:49:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:49:48,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-10-02 11:49:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:48,668 INFO L225 Difference]: With dead ends: 5588 [2019-10-02 11:49:48,668 INFO L226 Difference]: Without dead ends: 5560 [2019-10-02 11:49:48,670 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-02 11:49:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2019-10-02 11:49:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5560. [2019-10-02 11:49:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5560 states. [2019-10-02 11:49:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 8019 transitions. [2019-10-02 11:49:48,874 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 8019 transitions. Word has length 73 [2019-10-02 11:49:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:48,874 INFO L475 AbstractCegarLoop]: Abstraction has 5560 states and 8019 transitions. [2019-10-02 11:49:48,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:49:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 8019 transitions. [2019-10-02 11:49:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:49:48,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:48,877 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-02 11:49:48,878 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1653205276, now seen corresponding path program 1 times [2019-10-02 11:49:48,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:48,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:49,032 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-02 11:49:49,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:49,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:49,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:49,034 INFO L87 Difference]: Start difference. First operand 5560 states and 8019 transitions. Second operand 9 states. [2019-10-02 11:49:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:51,139 INFO L93 Difference]: Finished difference Result 5579 states and 8040 transitions. [2019-10-02 11:49:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:49:51,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-10-02 11:49:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:51,157 INFO L225 Difference]: With dead ends: 5579 [2019-10-02 11:49:51,157 INFO L226 Difference]: Without dead ends: 5575 [2019-10-02 11:49:51,160 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-02 11:49:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5575 states. [2019-10-02 11:49:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5575 to 5571. [2019-10-02 11:49:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5571 states. [2019-10-02 11:49:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5571 states to 5571 states and 8032 transitions. [2019-10-02 11:49:51,356 INFO L78 Accepts]: Start accepts. Automaton has 5571 states and 8032 transitions. Word has length 64 [2019-10-02 11:49:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:51,357 INFO L475 AbstractCegarLoop]: Abstraction has 5571 states and 8032 transitions. [2019-10-02 11:49:51,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5571 states and 8032 transitions. [2019-10-02 11:49:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:49:51,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:51,359 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-02 11:49:51,359 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1652928446, now seen corresponding path program 1 times [2019-10-02 11:49:51,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:51,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:49:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:49:51,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:49:51,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:49:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:49:51,491 INFO L87 Difference]: Start difference. First operand 5571 states and 8032 transitions. Second operand 6 states. [2019-10-02 11:49:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:56,043 INFO L93 Difference]: Finished difference Result 6740 states and 9749 transitions. [2019-10-02 11:49:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:49:56,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-02 11:49:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:56,060 INFO L225 Difference]: With dead ends: 6740 [2019-10-02 11:49:56,060 INFO L226 Difference]: Without dead ends: 6719 [2019-10-02 11:49:56,063 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-02 11:49:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6719 states. [2019-10-02 11:49:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6719 to 5558. [2019-10-02 11:49:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-02 11:49:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8014 transitions. [2019-10-02 11:49:56,278 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8014 transitions. Word has length 64 [2019-10-02 11:49:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:56,278 INFO L475 AbstractCegarLoop]: Abstraction has 5558 states and 8014 transitions. [2019-10-02 11:49:56,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:49:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8014 transitions. [2019-10-02 11:49:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:49:56,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:56,281 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-02 11:49:56,281 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 610671469, now seen corresponding path program 1 times [2019-10-02 11:49:56,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:56,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:49:56,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:56,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:49:56,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:49:56,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:49:56,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:49:56,610 INFO L87 Difference]: Start difference. First operand 5558 states and 8014 transitions. Second operand 3 states. [2019-10-02 11:49:56,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:56,795 INFO L93 Difference]: Finished difference Result 5609 states and 8072 transitions. [2019-10-02 11:49:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:49:56,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 11:49:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:56,807 INFO L225 Difference]: With dead ends: 5609 [2019-10-02 11:49:56,807 INFO L226 Difference]: Without dead ends: 5605 [2019-10-02 11:49:56,809 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-02 11:49:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5605 states. [2019-10-02 11:49:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5605 to 5556. [2019-10-02 11:49:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5556 states. [2019-10-02 11:49:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 8010 transitions. [2019-10-02 11:49:57,016 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 8010 transitions. Word has length 70 [2019-10-02 11:49:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:57,016 INFO L475 AbstractCegarLoop]: Abstraction has 5556 states and 8010 transitions. [2019-10-02 11:49:57,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:49:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 8010 transitions. [2019-10-02 11:49:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 11:49:57,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:57,018 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-02 11:49:57,018 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:57,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1101022210, now seen corresponding path program 1 times [2019-10-02 11:49:57,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:57,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:57,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:57,180 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-02 11:49:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:57,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:57,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:57,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:57,181 INFO L87 Difference]: Start difference. First operand 5556 states and 8010 transitions. Second operand 9 states. [2019-10-02 11:49:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:59,322 INFO L93 Difference]: Finished difference Result 5569 states and 8024 transitions. [2019-10-02 11:49:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:49:59,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-10-02 11:49:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:59,334 INFO L225 Difference]: With dead ends: 5569 [2019-10-02 11:49:59,335 INFO L226 Difference]: Without dead ends: 5534 [2019-10-02 11:49:59,337 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-02 11:49:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2019-10-02 11:49:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5534. [2019-10-02 11:49:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5534 states. [2019-10-02 11:49:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7985 transitions. [2019-10-02 11:49:59,539 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7985 transitions. Word has length 65 [2019-10-02 11:49:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:59,539 INFO L475 AbstractCegarLoop]: Abstraction has 5534 states and 7985 transitions. [2019-10-02 11:49:59,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:49:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7985 transitions. [2019-10-02 11:49:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 11:49:59,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:59,542 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-02 11:49:59,542 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash -841217434, now seen corresponding path program 1 times [2019-10-02 11:49:59,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:59,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:59,717 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-02 11:49:59,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:59,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:49:59,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:49:59,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:49:59,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:49:59,719 INFO L87 Difference]: Start difference. First operand 5534 states and 7985 transitions. Second operand 3 states. [2019-10-02 11:50:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:00,388 INFO L93 Difference]: Finished difference Result 8147 states and 11744 transitions. [2019-10-02 11:50:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:00,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 11:50:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:00,413 INFO L225 Difference]: With dead ends: 8147 [2019-10-02 11:50:00,413 INFO L226 Difference]: Without dead ends: 8013 [2019-10-02 11:50:00,417 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-02 11:50:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2019-10-02 11:50:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 5537. [2019-10-02 11:50:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5537 states. [2019-10-02 11:50:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 7985 transitions. [2019-10-02 11:50:00,684 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 7985 transitions. Word has length 72 [2019-10-02 11:50:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:00,684 INFO L475 AbstractCegarLoop]: Abstraction has 5537 states and 7985 transitions. [2019-10-02 11:50:00,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 7985 transitions. [2019-10-02 11:50:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 11:50:00,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:00,687 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-02 11:50:00,687 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1966852698, now seen corresponding path program 1 times [2019-10-02 11:50:00,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:00,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:00,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:00,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:00,905 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-02 11:50:00,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:00,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:50:00,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:50:00,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:50:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:50:00,908 INFO L87 Difference]: Start difference. First operand 5537 states and 7985 transitions. Second operand 11 states. [2019-10-02 11:50:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:01,207 INFO L93 Difference]: Finished difference Result 5552 states and 8001 transitions. [2019-10-02 11:50:01,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:50:01,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-10-02 11:50:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:01,225 INFO L225 Difference]: With dead ends: 5552 [2019-10-02 11:50:01,226 INFO L226 Difference]: Without dead ends: 5519 [2019-10-02 11:50:01,230 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-02 11:50:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-10-02 11:50:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-10-02 11:50:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-10-02 11:50:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 7963 transitions. [2019-10-02 11:50:01,614 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 7963 transitions. Word has length 75 [2019-10-02 11:50:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:01,614 INFO L475 AbstractCegarLoop]: Abstraction has 5519 states and 7963 transitions. [2019-10-02 11:50:01,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:50:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 7963 transitions. [2019-10-02 11:50:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:50:01,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:01,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:01,618 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 551390113, now seen corresponding path program 1 times [2019-10-02 11:50:01,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:01,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:01,851 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-02 11:50:01,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:01,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:01,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:01,852 INFO L87 Difference]: Start difference. First operand 5519 states and 7963 transitions. Second operand 5 states. [2019-10-02 11:50:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:05,366 INFO L93 Difference]: Finished difference Result 6389 states and 9169 transitions. [2019-10-02 11:50:05,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:05,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-02 11:50:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:05,379 INFO L225 Difference]: With dead ends: 6389 [2019-10-02 11:50:05,380 INFO L226 Difference]: Without dead ends: 3965 [2019-10-02 11:50:05,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:50:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2019-10-02 11:50:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3845. [2019-10-02 11:50:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2019-10-02 11:50:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5496 transitions. [2019-10-02 11:50:05,552 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5496 transitions. Word has length 80 [2019-10-02 11:50:05,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:05,553 INFO L475 AbstractCegarLoop]: Abstraction has 3845 states and 5496 transitions. [2019-10-02 11:50:05,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:50:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5496 transitions. [2019-10-02 11:50:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 11:50:05,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:05,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:05,556 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:05,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1576500620, now seen corresponding path program 1 times [2019-10-02 11:50:05,557 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:05,706 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-02 11:50:05,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:05,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:05,708 INFO L87 Difference]: Start difference. First operand 3845 states and 5496 transitions. Second operand 3 states. [2019-10-02 11:50:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:05,979 INFO L93 Difference]: Finished difference Result 6357 states and 9141 transitions. [2019-10-02 11:50:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:05,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-02 11:50:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:05,987 INFO L225 Difference]: With dead ends: 6357 [2019-10-02 11:50:05,987 INFO L226 Difference]: Without dead ends: 3923 [2019-10-02 11:50:05,993 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-02 11:50:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2019-10-02 11:50:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 3840. [2019-10-02 11:50:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2019-10-02 11:50:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 5486 transitions. [2019-10-02 11:50:06,140 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 5486 transitions. Word has length 80 [2019-10-02 11:50:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:06,140 INFO L475 AbstractCegarLoop]: Abstraction has 3840 states and 5486 transitions. [2019-10-02 11:50:06,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 5486 transitions. [2019-10-02 11:50:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:50:06,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:06,143 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-02 11:50:06,143 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash 549540455, now seen corresponding path program 1 times [2019-10-02 11:50:06,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:06,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:06,282 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-02 11:50:06,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:06,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:06,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:06,284 INFO L87 Difference]: Start difference. First operand 3840 states and 5486 transitions. Second operand 6 states. [2019-10-02 11:50:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:07,154 INFO L93 Difference]: Finished difference Result 3906 states and 5567 transitions. [2019-10-02 11:50:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:07,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-10-02 11:50:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:07,161 INFO L225 Difference]: With dead ends: 3906 [2019-10-02 11:50:07,161 INFO L226 Difference]: Without dead ends: 3461 [2019-10-02 11:50:07,163 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-02 11:50:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2019-10-02 11:50:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3434. [2019-10-02 11:50:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-10-02 11:50:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4850 transitions. [2019-10-02 11:50:07,298 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4850 transitions. Word has length 81 [2019-10-02 11:50:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:07,298 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4850 transitions. [2019-10-02 11:50:07,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4850 transitions. [2019-10-02 11:50:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:50:07,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:07,301 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-02 11:50:07,301 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash -245192666, now seen corresponding path program 1 times [2019-10-02 11:50:07,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:07,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:07,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-02 11:50:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:07,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:07,428 INFO L87 Difference]: Start difference. First operand 3434 states and 4850 transitions. Second operand 6 states. [2019-10-02 11:50:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:09,673 INFO L93 Difference]: Finished difference Result 3488 states and 4912 transitions. [2019-10-02 11:50:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:50:09,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-02 11:50:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:09,679 INFO L225 Difference]: With dead ends: 3488 [2019-10-02 11:50:09,679 INFO L226 Difference]: Without dead ends: 3434 [2019-10-02 11:50:09,681 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-02 11:50:09,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2019-10-02 11:50:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2019-10-02 11:50:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-10-02 11:50:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4846 transitions. [2019-10-02 11:50:09,808 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4846 transitions. Word has length 78 [2019-10-02 11:50:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:09,808 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4846 transitions. [2019-10-02 11:50:09,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4846 transitions. [2019-10-02 11:50:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:50:09,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:09,810 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-02 11:50:09,810 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -219822743, now seen corresponding path program 1 times [2019-10-02 11:50:09,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:09,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:09,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:09,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:10,010 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-02 11:50:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:10,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:10,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:10,012 INFO L87 Difference]: Start difference. First operand 3434 states and 4846 transitions. Second operand 5 states. [2019-10-02 11:50:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:10,155 INFO L93 Difference]: Finished difference Result 3521 states and 4946 transitions. [2019-10-02 11:50:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:50:10,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-02 11:50:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:10,162 INFO L225 Difference]: With dead ends: 3521 [2019-10-02 11:50:10,162 INFO L226 Difference]: Without dead ends: 3404 [2019-10-02 11:50:10,163 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-02 11:50:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-10-02 11:50:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-10-02 11:50:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-02 11:50:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4809 transitions. [2019-10-02 11:50:10,291 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4809 transitions. Word has length 79 [2019-10-02 11:50:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:10,292 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4809 transitions. [2019-10-02 11:50:10,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:50:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4809 transitions. [2019-10-02 11:50:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:50:10,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:10,294 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-02 11:50:10,294 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1253594992, now seen corresponding path program 1 times [2019-10-02 11:50:10,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:10,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:50:10,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:10,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:10,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:10,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:10,420 INFO L87 Difference]: Start difference. First operand 3404 states and 4809 transitions. Second operand 6 states. [2019-10-02 11:50:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:12,636 INFO L93 Difference]: Finished difference Result 3462 states and 4876 transitions. [2019-10-02 11:50:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:12,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-02 11:50:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:12,643 INFO L225 Difference]: With dead ends: 3462 [2019-10-02 11:50:12,643 INFO L226 Difference]: Without dead ends: 3404 [2019-10-02 11:50:12,644 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-02 11:50:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-10-02 11:50:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-10-02 11:50:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-02 11:50:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4807 transitions. [2019-10-02 11:50:12,785 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4807 transitions. Word has length 79 [2019-10-02 11:50:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:12,785 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4807 transitions. [2019-10-02 11:50:12,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4807 transitions. [2019-10-02 11:50:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 11:50:12,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:12,787 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-02 11:50:12,787 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash -56933927, now seen corresponding path program 1 times [2019-10-02 11:50:12,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:12,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:12,880 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-02 11:50:12,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:12,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:12,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:12,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:12,882 INFO L87 Difference]: Start difference. First operand 3404 states and 4807 transitions. Second operand 3 states. [2019-10-02 11:50:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:13,113 INFO L93 Difference]: Finished difference Result 3453 states and 4863 transitions. [2019-10-02 11:50:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:13,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 11:50:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:13,120 INFO L225 Difference]: With dead ends: 3453 [2019-10-02 11:50:13,120 INFO L226 Difference]: Without dead ends: 3406 [2019-10-02 11:50:13,121 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-02 11:50:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-10-02 11:50:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3404. [2019-10-02 11:50:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-02 11:50:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4806 transitions. [2019-10-02 11:50:13,363 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4806 transitions. Word has length 84 [2019-10-02 11:50:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:13,363 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4806 transitions. [2019-10-02 11:50:13,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4806 transitions. [2019-10-02 11:50:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:50:13,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:13,365 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-02 11:50:13,365 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 198331322, now seen corresponding path program 1 times [2019-10-02 11:50:13,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:13,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:13,486 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-02 11:50:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:13,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:13,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:13,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:13,488 INFO L87 Difference]: Start difference. First operand 3404 states and 4806 transitions. Second operand 6 states. [2019-10-02 11:50:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:15,723 INFO L93 Difference]: Finished difference Result 3462 states and 4873 transitions. [2019-10-02 11:50:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:15,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-02 11:50:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:15,730 INFO L225 Difference]: With dead ends: 3462 [2019-10-02 11:50:15,730 INFO L226 Difference]: Without dead ends: 3404 [2019-10-02 11:50:15,731 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-02 11:50:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-10-02 11:50:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-10-02 11:50:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-10-02 11:50:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4805 transitions. [2019-10-02 11:50:15,857 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4805 transitions. Word has length 83 [2019-10-02 11:50:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:15,857 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4805 transitions. [2019-10-02 11:50:15,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4805 transitions. [2019-10-02 11:50:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 11:50:15,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:15,859 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-02 11:50:15,859 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1491366779, now seen corresponding path program 1 times [2019-10-02 11:50:15,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:15,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:15,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:15,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-02 11:50:15,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:15,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:15,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:15,995 INFO L87 Difference]: Start difference. First operand 3404 states and 4805 transitions. Second operand 3 states. [2019-10-02 11:50:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:16,170 INFO L93 Difference]: Finished difference Result 3474 states and 4885 transitions. [2019-10-02 11:50:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:16,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-02 11:50:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:16,177 INFO L225 Difference]: With dead ends: 3474 [2019-10-02 11:50:16,177 INFO L226 Difference]: Without dead ends: 3417 [2019-10-02 11:50:16,178 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-02 11:50:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-10-02 11:50:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3409. [2019-10-02 11:50:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-10-02 11:50:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4812 transitions. [2019-10-02 11:50:16,320 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4812 transitions. Word has length 85 [2019-10-02 11:50:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:16,321 INFO L475 AbstractCegarLoop]: Abstraction has 3409 states and 4812 transitions. [2019-10-02 11:50:16,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4812 transitions. [2019-10-02 11:50:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:50:16,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:16,323 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-02 11:50:16,323 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash -986895225, now seen corresponding path program 1 times [2019-10-02 11:50:16,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:16,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:16,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:16,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:16,494 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-02 11:50:16,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:16,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:16,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:16,495 INFO L87 Difference]: Start difference. First operand 3409 states and 4812 transitions. Second operand 6 states. [2019-10-02 11:50:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:16,668 INFO L93 Difference]: Finished difference Result 3424 states and 4828 transitions. [2019-10-02 11:50:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:16,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-02 11:50:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:16,675 INFO L225 Difference]: With dead ends: 3424 [2019-10-02 11:50:16,675 INFO L226 Difference]: Without dead ends: 3403 [2019-10-02 11:50:16,676 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-02 11:50:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2019-10-02 11:50:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3398. [2019-10-02 11:50:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2019-10-02 11:50:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4796 transitions. [2019-10-02 11:50:16,819 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4796 transitions. Word has length 86 [2019-10-02 11:50:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:16,820 INFO L475 AbstractCegarLoop]: Abstraction has 3398 states and 4796 transitions. [2019-10-02 11:50:16,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4796 transitions. [2019-10-02 11:50:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 11:50:16,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:16,822 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-02 11:50:16,823 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:16,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1597447618, now seen corresponding path program 1 times [2019-10-02 11:50:16,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:16,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:16,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:16,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-02 11:50:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:16,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:16,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:16,941 INFO L87 Difference]: Start difference. First operand 3398 states and 4796 transitions. Second operand 3 states. [2019-10-02 11:50:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:17,170 INFO L93 Difference]: Finished difference Result 4598 states and 6552 transitions. [2019-10-02 11:50:17,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:17,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 11:50:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:17,180 INFO L225 Difference]: With dead ends: 4598 [2019-10-02 11:50:17,180 INFO L226 Difference]: Without dead ends: 4590 [2019-10-02 11:50:17,182 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-02 11:50:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2019-10-02 11:50:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3427. [2019-10-02 11:50:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-10-02 11:50:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4831 transitions. [2019-10-02 11:50:17,335 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4831 transitions. Word has length 84 [2019-10-02 11:50:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:17,335 INFO L475 AbstractCegarLoop]: Abstraction has 3427 states and 4831 transitions. [2019-10-02 11:50:17,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4831 transitions. [2019-10-02 11:50:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 11:50:17,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:17,337 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-02 11:50:17,337 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash -242716219, now seen corresponding path program 1 times [2019-10-02 11:50:17,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:17,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:17,460 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-02 11:50:17,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:17,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:17,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:17,461 INFO L87 Difference]: Start difference. First operand 3427 states and 4831 transitions. Second operand 3 states. [2019-10-02 11:50:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:17,639 INFO L93 Difference]: Finished difference Result 5786 states and 8286 transitions. [2019-10-02 11:50:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:17,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-02 11:50:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:17,646 INFO L225 Difference]: With dead ends: 5786 [2019-10-02 11:50:17,646 INFO L226 Difference]: Without dead ends: 3425 [2019-10-02 11:50:17,652 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-02 11:50:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-10-02 11:50:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3425. [2019-10-02 11:50:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2019-10-02 11:50:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 4827 transitions. [2019-10-02 11:50:17,783 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 4827 transitions. Word has length 89 [2019-10-02 11:50:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:17,784 INFO L475 AbstractCegarLoop]: Abstraction has 3425 states and 4827 transitions. [2019-10-02 11:50:17,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 4827 transitions. [2019-10-02 11:50:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 11:50:17,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:17,786 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 198612998, now seen corresponding path program 1 times [2019-10-02 11:50:17,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:17,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:17,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:17,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-02 11:50:17,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:17,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:50:17,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:50:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:50:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:50:17,994 INFO L87 Difference]: Start difference. First operand 3425 states and 4827 transitions. Second operand 4 states. [2019-10-02 11:50:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:19,958 INFO L93 Difference]: Finished difference Result 4772 states and 6764 transitions. [2019-10-02 11:50:19,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:19,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 11:50:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:19,967 INFO L225 Difference]: With dead ends: 4772 [2019-10-02 11:50:19,967 INFO L226 Difference]: Without dead ends: 3388 [2019-10-02 11:50:19,971 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-02 11:50:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-10-02 11:50:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2019-10-02 11:50:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-02 11:50:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4771 transitions. [2019-10-02 11:50:20,113 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4771 transitions. Word has length 85 [2019-10-02 11:50:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:20,113 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4771 transitions. [2019-10-02 11:50:20,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:50:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4771 transitions. [2019-10-02 11:50:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 11:50:20,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:20,115 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-02 11:50:20,115 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1824698338, now seen corresponding path program 1 times [2019-10-02 11:50:20,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:20,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:20,273 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-02 11:50:20,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:20,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:20,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:20,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:20,275 INFO L87 Difference]: Start difference. First operand 3388 states and 4771 transitions. Second operand 5 states. [2019-10-02 11:50:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:24,855 INFO L93 Difference]: Finished difference Result 4542 states and 6464 transitions. [2019-10-02 11:50:24,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:24,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-02 11:50:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:24,867 INFO L225 Difference]: With dead ends: 4542 [2019-10-02 11:50:24,867 INFO L226 Difference]: Without dead ends: 4536 [2019-10-02 11:50:24,868 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-02 11:50:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-02 11:50:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3388. [2019-10-02 11:50:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-02 11:50:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4770 transitions. [2019-10-02 11:50:25,029 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4770 transitions. Word has length 85 [2019-10-02 11:50:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:25,029 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4770 transitions. [2019-10-02 11:50:25,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:50:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4770 transitions. [2019-10-02 11:50:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 11:50:25,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:25,031 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-02 11:50:25,031 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash -834588261, now seen corresponding path program 1 times [2019-10-02 11:50:25,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:25,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:25,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:25,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:25,140 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-02 11:50:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:50:25,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:50:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:50:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:50:25,142 INFO L87 Difference]: Start difference. First operand 3388 states and 4770 transitions. Second operand 6 states. [2019-10-02 11:50:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:27,462 INFO L93 Difference]: Finished difference Result 3446 states and 4836 transitions. [2019-10-02 11:50:27,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:27,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-02 11:50:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:27,472 INFO L225 Difference]: With dead ends: 3446 [2019-10-02 11:50:27,473 INFO L226 Difference]: Without dead ends: 3394 [2019-10-02 11:50:27,475 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-02 11:50:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2019-10-02 11:50:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3388. [2019-10-02 11:50:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-10-02 11:50:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4768 transitions. [2019-10-02 11:50:27,802 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4768 transitions. Word has length 85 [2019-10-02 11:50:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:27,802 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4768 transitions. [2019-10-02 11:50:27,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:50:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4768 transitions. [2019-10-02 11:50:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:50:27,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:27,804 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-02 11:50:27,804 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:27,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1629971384, now seen corresponding path program 1 times [2019-10-02 11:50:27,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:27,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:50:27,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:50:27,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:50:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:50:27,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:50:27,976 INFO L87 Difference]: Start difference. First operand 3388 states and 4768 transitions. Second operand 9 states. [2019-10-02 11:50:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:30,681 INFO L93 Difference]: Finished difference Result 3409 states and 4792 transitions. [2019-10-02 11:50:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:50:30,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-10-02 11:50:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:30,688 INFO L225 Difference]: With dead ends: 3409 [2019-10-02 11:50:30,688 INFO L226 Difference]: Without dead ends: 3405 [2019-10-02 11:50:30,689 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-02 11:50:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2019-10-02 11:50:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3401. [2019-10-02 11:50:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2019-10-02 11:50:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4784 transitions. [2019-10-02 11:50:30,831 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4784 transitions. Word has length 86 [2019-10-02 11:50:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:30,831 INFO L475 AbstractCegarLoop]: Abstraction has 3401 states and 4784 transitions. [2019-10-02 11:50:30,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:50:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4784 transitions. [2019-10-02 11:50:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 11:50:30,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:30,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] [2019-10-02 11:50:30,833 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1630248214, now seen corresponding path program 1 times [2019-10-02 11:50:30,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:30,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:30,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:30,976 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-02 11:50:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:30,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:30,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:30,977 INFO L87 Difference]: Start difference. First operand 3401 states and 4784 transitions. Second operand 5 states. [2019-10-02 11:50:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:35,506 INFO L93 Difference]: Finished difference Result 4553 states and 6475 transitions. [2019-10-02 11:50:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:35,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-02 11:50:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:35,517 INFO L225 Difference]: With dead ends: 4553 [2019-10-02 11:50:35,518 INFO L226 Difference]: Without dead ends: 4521 [2019-10-02 11:50:35,519 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-02 11:50:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2019-10-02 11:50:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 3373. [2019-10-02 11:50:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-10-02 11:50:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4749 transitions. [2019-10-02 11:50:35,694 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 4749 transitions. Word has length 86 [2019-10-02 11:50:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:35,694 INFO L475 AbstractCegarLoop]: Abstraction has 3373 states and 4749 transitions. [2019-10-02 11:50:35,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:50:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4749 transitions. [2019-10-02 11:50:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:50:35,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:35,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:35,697 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1226245044, now seen corresponding path program 1 times [2019-10-02 11:50:35,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:35,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:35,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:35,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:35,802 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-02 11:50:35,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:50:35,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:50:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:50:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:50:35,803 INFO L87 Difference]: Start difference. First operand 3373 states and 4749 transitions. Second operand 3 states. [2019-10-02 11:50:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:36,192 INFO L93 Difference]: Finished difference Result 4510 states and 6424 transitions. [2019-10-02 11:50:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:50:36,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-02 11:50:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:36,202 INFO L225 Difference]: With dead ends: 4510 [2019-10-02 11:50:36,202 INFO L226 Difference]: Without dead ends: 4507 [2019-10-02 11:50:36,204 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-02 11:50:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-10-02 11:50:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3377. [2019-10-02 11:50:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-10-02 11:50:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4755 transitions. [2019-10-02 11:50:36,456 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4755 transitions. Word has length 92 [2019-10-02 11:50:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:36,456 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 4755 transitions. [2019-10-02 11:50:36,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:50:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4755 transitions. [2019-10-02 11:50:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:50:36,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:36,458 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-02 11:50:36,458 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1327290318, now seen corresponding path program 1 times [2019-10-02 11:50:36,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:36,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:36,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-02 11:50:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:36,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:50:36,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:50:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:50:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:50:36,598 INFO L87 Difference]: Start difference. First operand 3377 states and 4755 transitions. Second operand 5 states. [2019-10-02 11:50:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:42,965 INFO L93 Difference]: Finished difference Result 7973 states and 11504 transitions. [2019-10-02 11:50:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:50:42,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-10-02 11:50:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:42,981 INFO L225 Difference]: With dead ends: 7973 [2019-10-02 11:50:42,981 INFO L226 Difference]: Without dead ends: 5651 [2019-10-02 11:50:42,989 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-02 11:50:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-10-02 11:50:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3391. [2019-10-02 11:50:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3391 states. [2019-10-02 11:50:43,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4772 transitions. [2019-10-02 11:50:43,188 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4772 transitions. Word has length 94 [2019-10-02 11:50:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:43,188 INFO L475 AbstractCegarLoop]: Abstraction has 3391 states and 4772 transitions. [2019-10-02 11:50:43,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:50:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4772 transitions. [2019-10-02 11:50:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:50:43,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:43,191 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1192745558, now seen corresponding path program 1 times [2019-10-02 11:50:43,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:43,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:50:43,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:43,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:50:43,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:50:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:50:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:50:43,442 INFO L87 Difference]: Start difference. First operand 3391 states and 4772 transitions. Second operand 14 states. [2019-10-02 11:50:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:48,959 INFO L93 Difference]: Finished difference Result 3408 states and 4790 transitions. [2019-10-02 11:50:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:50:49,522 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-10-02 11:50:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:49,535 INFO L225 Difference]: With dead ends: 3408 [2019-10-02 11:50:49,535 INFO L226 Difference]: Without dead ends: 3344 [2019-10-02 11:50:49,536 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-02 11:50:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2019-10-02 11:50:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 3344. [2019-10-02 11:50:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3344 states. [2019-10-02 11:50:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4706 transitions. [2019-10-02 11:50:49,696 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4706 transitions. Word has length 97 [2019-10-02 11:50:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:49,696 INFO L475 AbstractCegarLoop]: Abstraction has 3344 states and 4706 transitions. [2019-10-02 11:50:49,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:50:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4706 transitions. [2019-10-02 11:50:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:50:49,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:50:49,698 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2042461425, now seen corresponding path program 1 times [2019-10-02 11:50:49,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:49,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:49,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:49,938 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-02 11:50:49,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:49,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:50:49,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:50:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:50:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:50:49,939 INFO L87 Difference]: Start difference. First operand 3344 states and 4706 transitions. Second operand 14 states. [2019-10-02 11:50:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:55,269 INFO L93 Difference]: Finished difference Result 3361 states and 4724 transitions. [2019-10-02 11:50:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:50:55,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-10-02 11:50:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:55,276 INFO L225 Difference]: With dead ends: 3361 [2019-10-02 11:50:55,276 INFO L226 Difference]: Without dead ends: 3342 [2019-10-02 11:50:55,277 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-02 11:50:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2019-10-02 11:50:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3342. [2019-10-02 11:50:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3342 states. [2019-10-02 11:50:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 4702 transitions. [2019-10-02 11:50:55,440 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 4702 transitions. Word has length 91 [2019-10-02 11:50:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:55,440 INFO L475 AbstractCegarLoop]: Abstraction has 3342 states and 4702 transitions. [2019-10-02 11:50:55,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:50:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 4702 transitions. [2019-10-02 11:50:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:50:55,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:55,442 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-02 11:50:55,443 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash -425043435, now seen corresponding path program 1 times [2019-10-02 11:50:55,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:55,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:55,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:55,678 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-02 11:50:55,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:55,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:50:55,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:50:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:50:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:50:55,679 INFO L87 Difference]: Start difference. First operand 3342 states and 4702 transitions. Second operand 14 states. [2019-10-02 11:51:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:01,359 INFO L93 Difference]: Finished difference Result 3359 states and 4720 transitions. [2019-10-02 11:51:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:01,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2019-10-02 11:51:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:01,367 INFO L225 Difference]: With dead ends: 3359 [2019-10-02 11:51:01,367 INFO L226 Difference]: Without dead ends: 3333 [2019-10-02 11:51:01,368 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-02 11:51:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2019-10-02 11:51:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3333. [2019-10-02 11:51:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2019-10-02 11:51:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4690 transitions. [2019-10-02 11:51:01,527 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4690 transitions. Word has length 101 [2019-10-02 11:51:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:01,527 INFO L475 AbstractCegarLoop]: Abstraction has 3333 states and 4690 transitions. [2019-10-02 11:51:01,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4690 transitions. [2019-10-02 11:51:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:51:01,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:01,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:51:01,530 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1643656828, now seen corresponding path program 1 times [2019-10-02 11:51:01,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:01,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:01,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:01,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:01,793 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-02 11:51:01,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:01,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:01,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:01,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:01,794 INFO L87 Difference]: Start difference. First operand 3333 states and 4690 transitions. Second operand 14 states. [2019-10-02 11:51:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:07,264 INFO L93 Difference]: Finished difference Result 3350 states and 4708 transitions. [2019-10-02 11:51:07,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:07,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-10-02 11:51:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:07,271 INFO L225 Difference]: With dead ends: 3350 [2019-10-02 11:51:07,271 INFO L226 Difference]: Without dead ends: 3326 [2019-10-02 11:51:07,272 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-02 11:51:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-10-02 11:51:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3326. [2019-10-02 11:51:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2019-10-02 11:51:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4681 transitions. [2019-10-02 11:51:07,448 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4681 transitions. Word has length 90 [2019-10-02 11:51:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:07,448 INFO L475 AbstractCegarLoop]: Abstraction has 3326 states and 4681 transitions. [2019-10-02 11:51:07,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4681 transitions. [2019-10-02 11:51:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 11:51:07,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:07,450 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-02 11:51:07,450 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash -823465480, now seen corresponding path program 1 times [2019-10-02 11:51:07,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:07,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:07,554 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-02 11:51:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:51:07,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:51:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:51:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:51:07,555 INFO L87 Difference]: Start difference. First operand 3326 states and 4681 transitions. Second operand 6 states. [2019-10-02 11:51:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:09,806 INFO L93 Difference]: Finished difference Result 3385 states and 4747 transitions. [2019-10-02 11:51:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:51:09,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-10-02 11:51:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:09,813 INFO L225 Difference]: With dead ends: 3385 [2019-10-02 11:51:09,813 INFO L226 Difference]: Without dead ends: 3315 [2019-10-02 11:51:09,814 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-02 11:51:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2019-10-02 11:51:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3305. [2019-10-02 11:51:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2019-10-02 11:51:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4648 transitions. [2019-10-02 11:51:10,035 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4648 transitions. Word has length 89 [2019-10-02 11:51:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:10,035 INFO L475 AbstractCegarLoop]: Abstraction has 3305 states and 4648 transitions. [2019-10-02 11:51:10,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:51:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4648 transitions. [2019-10-02 11:51:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:51:10,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:10,037 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-02 11:51:10,037 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1688969787, now seen corresponding path program 1 times [2019-10-02 11:51:10,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:10,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:10,188 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-02 11:51:10,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:10,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:10,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:10,189 INFO L87 Difference]: Start difference. First operand 3305 states and 4648 transitions. Second operand 9 states. [2019-10-02 11:51:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:12,511 INFO L93 Difference]: Finished difference Result 3371 states and 4722 transitions. [2019-10-02 11:51:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:51:12,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-10-02 11:51:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:12,518 INFO L225 Difference]: With dead ends: 3371 [2019-10-02 11:51:12,518 INFO L226 Difference]: Without dead ends: 3311 [2019-10-02 11:51:12,519 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-02 11:51:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2019-10-02 11:51:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3305. [2019-10-02 11:51:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2019-10-02 11:51:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4647 transitions. [2019-10-02 11:51:12,678 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4647 transitions. Word has length 91 [2019-10-02 11:51:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:12,678 INFO L475 AbstractCegarLoop]: Abstraction has 3305 states and 4647 transitions. [2019-10-02 11:51:12,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4647 transitions. [2019-10-02 11:51:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:51:12,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:12,680 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-02 11:51:12,680 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash -645202431, now seen corresponding path program 1 times [2019-10-02 11:51:12,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:12,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:12,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:12,834 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-02 11:51:12,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:12,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:12,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:12,835 INFO L87 Difference]: Start difference. First operand 3305 states and 4647 transitions. Second operand 9 states. [2019-10-02 11:51:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:15,125 INFO L93 Difference]: Finished difference Result 3324 states and 4667 transitions. [2019-10-02 11:51:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:51:15,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-10-02 11:51:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:15,132 INFO L225 Difference]: With dead ends: 3324 [2019-10-02 11:51:15,132 INFO L226 Difference]: Without dead ends: 3278 [2019-10-02 11:51:15,133 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-02 11:51:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2019-10-02 11:51:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3278. [2019-10-02 11:51:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2019-10-02 11:51:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4619 transitions. [2019-10-02 11:51:15,293 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4619 transitions. Word has length 94 [2019-10-02 11:51:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:15,294 INFO L475 AbstractCegarLoop]: Abstraction has 3278 states and 4619 transitions. [2019-10-02 11:51:15,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:15,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4619 transitions. [2019-10-02 11:51:15,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:51:15,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:51:15,296 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1652788187, now seen corresponding path program 1 times [2019-10-02 11:51:15,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:15,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:15,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:15,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:15,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-02 11:51:15,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:15,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:51:15,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:51:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:51:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:51:15,410 INFO L87 Difference]: Start difference. First operand 3278 states and 4619 transitions. Second operand 3 states. [2019-10-02 11:51:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:15,562 INFO L93 Difference]: Finished difference Result 5625 states and 8050 transitions. [2019-10-02 11:51:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:51:15,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-02 11:51:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:15,569 INFO L225 Difference]: With dead ends: 5625 [2019-10-02 11:51:15,569 INFO L226 Difference]: Without dead ends: 3294 [2019-10-02 11:51:15,575 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-02 11:51:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-10-02 11:51:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3281. [2019-10-02 11:51:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-10-02 11:51:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4623 transitions. [2019-10-02 11:51:15,734 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4623 transitions. Word has length 99 [2019-10-02 11:51:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:15,734 INFO L475 AbstractCegarLoop]: Abstraction has 3281 states and 4623 transitions. [2019-10-02 11:51:15,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:51:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4623 transitions. [2019-10-02 11:51:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:51:15,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:15,736 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-02 11:51:15,736 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2146095008, now seen corresponding path program 1 times [2019-10-02 11:51:15,736 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:15,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:15,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:15,908 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-02 11:51:15,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:15,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:51:15,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:51:15,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:51:15,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:15,909 INFO L87 Difference]: Start difference. First operand 3281 states and 4623 transitions. Second operand 5 states. [2019-10-02 11:51:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:20,186 INFO L93 Difference]: Finished difference Result 4483 states and 6362 transitions. [2019-10-02 11:51:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:51:20,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 11:51:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:20,194 INFO L225 Difference]: With dead ends: 4483 [2019-10-02 11:51:20,194 INFO L226 Difference]: Without dead ends: 3290 [2019-10-02 11:51:20,197 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-02 11:51:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2019-10-02 11:51:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 3278. [2019-10-02 11:51:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2019-10-02 11:51:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4616 transitions. [2019-10-02 11:51:20,386 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4616 transitions. Word has length 100 [2019-10-02 11:51:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:20,386 INFO L475 AbstractCegarLoop]: Abstraction has 3278 states and 4616 transitions. [2019-10-02 11:51:20,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:51:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4616 transitions. [2019-10-02 11:51:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:51:20,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:20,389 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-02 11:51:20,389 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash 46133904, now seen corresponding path program 1 times [2019-10-02 11:51:20,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:20,530 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-02 11:51:20,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:20,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:51:20,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:51:20,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:51:20,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:51:20,531 INFO L87 Difference]: Start difference. First operand 3278 states and 4616 transitions. Second operand 8 states. [2019-10-02 11:51:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:22,797 INFO L93 Difference]: Finished difference Result 3334 states and 4680 transitions. [2019-10-02 11:51:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:51:22,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-10-02 11:51:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:22,803 INFO L225 Difference]: With dead ends: 3334 [2019-10-02 11:51:22,804 INFO L226 Difference]: Without dead ends: 3276 [2019-10-02 11:51:22,805 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-02 11:51:22,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-10-02 11:51:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2019-10-02 11:51:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-10-02 11:51:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4612 transitions. [2019-10-02 11:51:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4612 transitions. Word has length 96 [2019-10-02 11:51:22,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:22,969 INFO L475 AbstractCegarLoop]: Abstraction has 3276 states and 4612 transitions. [2019-10-02 11:51:22,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:51:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4612 transitions. [2019-10-02 11:51:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:51:22,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:22,971 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-02 11:51:22,971 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1057884359, now seen corresponding path program 1 times [2019-10-02 11:51:22,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:22,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:22,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:22,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:22,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:23,074 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-02 11:51:23,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:23,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:51:23,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:51:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:51:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:51:23,076 INFO L87 Difference]: Start difference. First operand 3276 states and 4612 transitions. Second operand 3 states. [2019-10-02 11:51:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:23,234 INFO L93 Difference]: Finished difference Result 5623 states and 8043 transitions. [2019-10-02 11:51:23,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:51:23,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 11:51:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:23,241 INFO L225 Difference]: With dead ends: 5623 [2019-10-02 11:51:23,241 INFO L226 Difference]: Without dead ends: 3292 [2019-10-02 11:51:23,245 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-02 11:51:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-10-02 11:51:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3276. [2019-10-02 11:51:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2019-10-02 11:51:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4612 transitions. [2019-10-02 11:51:23,411 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4612 transitions. Word has length 101 [2019-10-02 11:51:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:23,411 INFO L475 AbstractCegarLoop]: Abstraction has 3276 states and 4612 transitions. [2019-10-02 11:51:23,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:51:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4612 transitions. [2019-10-02 11:51:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:51:23,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:23,413 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-02 11:51:23,413 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:23,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:23,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1211368971, now seen corresponding path program 1 times [2019-10-02 11:51:23,414 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:23,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:23,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:23,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:23,540 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-02 11:51:23,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:23,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:51:23,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:51:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:51:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:51:23,542 INFO L87 Difference]: Start difference. First operand 3276 states and 4612 transitions. Second operand 8 states. [2019-10-02 11:51:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:25,821 INFO L93 Difference]: Finished difference Result 3332 states and 4676 transitions. [2019-10-02 11:51:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:51:25,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-10-02 11:51:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:25,827 INFO L225 Difference]: With dead ends: 3332 [2019-10-02 11:51:25,827 INFO L226 Difference]: Without dead ends: 3274 [2019-10-02 11:51:25,828 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-02 11:51:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2019-10-02 11:51:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3274. [2019-10-02 11:51:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2019-10-02 11:51:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4608 transitions. [2019-10-02 11:51:25,993 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4608 transitions. Word has length 97 [2019-10-02 11:51:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:25,994 INFO L475 AbstractCegarLoop]: Abstraction has 3274 states and 4608 transitions. [2019-10-02 11:51:25,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:51:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4608 transitions. [2019-10-02 11:51:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:51:25,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:25,995 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-02 11:51:25,995 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1551531897, now seen corresponding path program 1 times [2019-10-02 11:51:25,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:25,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:26,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:26,108 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-02 11:51:26,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:26,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:51:26,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:51:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:51:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:51:26,110 INFO L87 Difference]: Start difference. First operand 3274 states and 4608 transitions. Second operand 3 states. [2019-10-02 11:51:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:26,386 INFO L93 Difference]: Finished difference Result 6781 states and 9730 transitions. [2019-10-02 11:51:26,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:51:26,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 11:51:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:26,396 INFO L225 Difference]: With dead ends: 6781 [2019-10-02 11:51:26,396 INFO L226 Difference]: Without dead ends: 4460 [2019-10-02 11:51:26,401 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-02 11:51:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-10-02 11:51:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4403. [2019-10-02 11:51:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4403 states. [2019-10-02 11:51:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 6268 transitions. [2019-10-02 11:51:26,714 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 6268 transitions. Word has length 101 [2019-10-02 11:51:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:26,714 INFO L475 AbstractCegarLoop]: Abstraction has 4403 states and 6268 transitions. [2019-10-02 11:51:26,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:51:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 6268 transitions. [2019-10-02 11:51:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:51:26,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:26,716 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-02 11:51:26,716 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1319756638, now seen corresponding path program 1 times [2019-10-02 11:51:26,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:26,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:26,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:26,984 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-02 11:51:26,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:26,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:26,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:26,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:26,985 INFO L87 Difference]: Start difference. First operand 4403 states and 6268 transitions. Second operand 14 states. [2019-10-02 11:51:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:30,982 INFO L93 Difference]: Finished difference Result 4420 states and 6286 transitions. [2019-10-02 11:51:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:30,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-10-02 11:51:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:30,991 INFO L225 Difference]: With dead ends: 4420 [2019-10-02 11:51:30,991 INFO L226 Difference]: Without dead ends: 4394 [2019-10-02 11:51:30,993 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-02 11:51:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2019-10-02 11:51:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4394. [2019-10-02 11:51:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4394 states. [2019-10-02 11:51:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 6256 transitions. [2019-10-02 11:51:31,224 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 6256 transitions. Word has length 98 [2019-10-02 11:51:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:31,224 INFO L475 AbstractCegarLoop]: Abstraction has 4394 states and 6256 transitions. [2019-10-02 11:51:31,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 6256 transitions. [2019-10-02 11:51:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:51:31,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:31,226 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-02 11:51:31,226 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:31,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -515610206, now seen corresponding path program 1 times [2019-10-02 11:51:31,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:31,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:31,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:31,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:31,457 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-02 11:51:31,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:31,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:31,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:31,459 INFO L87 Difference]: Start difference. First operand 4394 states and 6256 transitions. Second operand 14 states. [2019-10-02 11:51:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:36,884 INFO L93 Difference]: Finished difference Result 4411 states and 6274 transitions. [2019-10-02 11:51:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:36,884 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-10-02 11:51:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:36,893 INFO L225 Difference]: With dead ends: 4411 [2019-10-02 11:51:36,894 INFO L226 Difference]: Without dead ends: 4387 [2019-10-02 11:51:36,895 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-02 11:51:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2019-10-02 11:51:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 4387. [2019-10-02 11:51:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4387 states. [2019-10-02 11:51:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4387 states to 4387 states and 6247 transitions. [2019-10-02 11:51:37,129 INFO L78 Accepts]: Start accepts. Automaton has 4387 states and 6247 transitions. Word has length 98 [2019-10-02 11:51:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:37,129 INFO L475 AbstractCegarLoop]: Abstraction has 4387 states and 6247 transitions. [2019-10-02 11:51:37,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4387 states and 6247 transitions. [2019-10-02 11:51:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:51:37,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:37,130 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-02 11:51:37,131 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1507974481, now seen corresponding path program 1 times [2019-10-02 11:51:37,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:37,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:51:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:37,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:37,369 INFO L87 Difference]: Start difference. First operand 4387 states and 6247 transitions. Second operand 14 states. [2019-10-02 11:51:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:42,057 INFO L93 Difference]: Finished difference Result 4404 states and 6265 transitions. [2019-10-02 11:51:42,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:42,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-10-02 11:51:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:42,067 INFO L225 Difference]: With dead ends: 4404 [2019-10-02 11:51:42,067 INFO L226 Difference]: Without dead ends: 4380 [2019-10-02 11:51:42,068 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-02 11:51:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2019-10-02 11:51:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4380. [2019-10-02 11:51:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4380 states. [2019-10-02 11:51:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 6238 transitions. [2019-10-02 11:51:42,299 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 6238 transitions. Word has length 97 [2019-10-02 11:51:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:42,299 INFO L475 AbstractCegarLoop]: Abstraction has 4380 states and 6238 transitions. [2019-10-02 11:51:42,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 6238 transitions. [2019-10-02 11:51:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 11:51:42,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:42,301 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-02 11:51:42,301 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:42,301 INFO L82 PathProgramCache]: Analyzing trace with hash 738347308, now seen corresponding path program 1 times [2019-10-02 11:51:42,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:42,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:42,536 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-02 11:51:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:42,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:42,537 INFO L87 Difference]: Start difference. First operand 4380 states and 6238 transitions. Second operand 14 states. [2019-10-02 11:51:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:48,348 INFO L93 Difference]: Finished difference Result 4397 states and 6256 transitions. [2019-10-02 11:51:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:48,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-10-02 11:51:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:48,357 INFO L225 Difference]: With dead ends: 4397 [2019-10-02 11:51:48,357 INFO L226 Difference]: Without dead ends: 4371 [2019-10-02 11:51:48,358 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-02 11:51:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-10-02 11:51:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2019-10-02 11:51:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4371 states. [2019-10-02 11:51:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6226 transitions. [2019-10-02 11:51:48,585 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6226 transitions. Word has length 107 [2019-10-02 11:51:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:48,586 INFO L475 AbstractCegarLoop]: Abstraction has 4371 states and 6226 transitions. [2019-10-02 11:51:48,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:51:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6226 transitions. [2019-10-02 11:51:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:51:48,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:48,587 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-02 11:51:48,587 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2046190639, now seen corresponding path program 1 times [2019-10-02 11:51:48,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:48,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:48,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:48,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:48,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:51:48,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:48,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:51:48,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:51:48,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:51:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:51:48,839 INFO L87 Difference]: Start difference. First operand 4371 states and 6226 transitions. Second operand 15 states. [2019-10-02 11:51:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:55,134 INFO L93 Difference]: Finished difference Result 4388 states and 6244 transitions. [2019-10-02 11:51:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:51:55,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-10-02 11:51:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:55,143 INFO L225 Difference]: With dead ends: 4388 [2019-10-02 11:51:55,143 INFO L226 Difference]: Without dead ends: 4346 [2019-10-02 11:51:55,144 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-02 11:51:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-10-02 11:51:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2019-10-02 11:51:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2019-10-02 11:51:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6199 transitions. [2019-10-02 11:51:55,372 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6199 transitions. Word has length 97 [2019-10-02 11:51:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:55,372 INFO L475 AbstractCegarLoop]: Abstraction has 4346 states and 6199 transitions. [2019-10-02 11:51:55,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:51:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6199 transitions. [2019-10-02 11:51:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:51:55,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:55,373 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-02 11:51:55,374 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 765573323, now seen corresponding path program 1 times [2019-10-02 11:51:55,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:55,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:55,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:55,496 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-02 11:51:55,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:55,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:51:55,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:51:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:51:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:51:55,497 INFO L87 Difference]: Start difference. First operand 4346 states and 6199 transitions. Second operand 8 states. [2019-10-02 11:51:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:57,848 INFO L93 Difference]: Finished difference Result 4402 states and 6263 transitions. [2019-10-02 11:51:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:51:57,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-02 11:51:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:57,857 INFO L225 Difference]: With dead ends: 4402 [2019-10-02 11:51:57,857 INFO L226 Difference]: Without dead ends: 4343 [2019-10-02 11:51:57,858 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-02 11:51:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2019-10-02 11:51:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4343. [2019-10-02 11:51:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-10-02 11:51:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6194 transitions. [2019-10-02 11:51:58,087 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6194 transitions. Word has length 101 [2019-10-02 11:51:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:58,088 INFO L475 AbstractCegarLoop]: Abstraction has 4343 states and 6194 transitions. [2019-10-02 11:51:58,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:51:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6194 transitions. [2019-10-02 11:51:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:51:58,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:58,089 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-02 11:51:58,089 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1584193472, now seen corresponding path program 1 times [2019-10-02 11:51:58,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:58,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:58,310 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-02 11:51:58,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:58,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:51:58,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:51:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:51:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:51:58,311 INFO L87 Difference]: Start difference. First operand 4343 states and 6194 transitions. Second operand 9 states. [2019-10-02 11:52:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:02,218 INFO L93 Difference]: Finished difference Result 4349 states and 6199 transitions. [2019-10-02 11:52:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:02,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-02 11:52:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:02,226 INFO L225 Difference]: With dead ends: 4349 [2019-10-02 11:52:02,226 INFO L226 Difference]: Without dead ends: 4195 [2019-10-02 11:52:02,228 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-02 11:52:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-02 11:52:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-02 11:52:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-02 11:52:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6006 transitions. [2019-10-02 11:52:02,450 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6006 transitions. Word has length 99 [2019-10-02 11:52:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:02,450 INFO L475 AbstractCegarLoop]: Abstraction has 4195 states and 6006 transitions. [2019-10-02 11:52:02,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6006 transitions. [2019-10-02 11:52:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:52:02,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:02,452 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-02 11:52:02,452 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1255010522, now seen corresponding path program 1 times [2019-10-02 11:52:02,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:02,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:02,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:02,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:02,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:02,674 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-02 11:52:02,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:52:02,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:02,675 INFO L87 Difference]: Start difference. First operand 4195 states and 6006 transitions. Second operand 8 states. [2019-10-02 11:52:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:05,022 INFO L93 Difference]: Finished difference Result 4251 states and 6070 transitions. [2019-10-02 11:52:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:52:05,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-10-02 11:52:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:05,031 INFO L225 Difference]: With dead ends: 4251 [2019-10-02 11:52:05,031 INFO L226 Difference]: Without dead ends: 4192 [2019-10-02 11:52:05,032 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-02 11:52:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-10-02 11:52:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4192. [2019-10-02 11:52:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4192 states. [2019-10-02 11:52:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 6001 transitions. [2019-10-02 11:52:05,255 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 6001 transitions. Word has length 102 [2019-10-02 11:52:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:05,256 INFO L475 AbstractCegarLoop]: Abstraction has 4192 states and 6001 transitions. [2019-10-02 11:52:05,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:52:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 6001 transitions. [2019-10-02 11:52:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 11:52:05,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:05,257 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-02 11:52:05,257 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1737372550, now seen corresponding path program 1 times [2019-10-02 11:52:05,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:05,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:05,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:05,340 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-02 11:52:05,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:05,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:52:05,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:52:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:52:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:52:05,341 INFO L87 Difference]: Start difference. First operand 4192 states and 6001 transitions. Second operand 3 states. [2019-10-02 11:52:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:07,568 INFO L93 Difference]: Finished difference Result 4194 states and 6002 transitions. [2019-10-02 11:52:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:52:07,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-02 11:52:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:07,576 INFO L225 Difference]: With dead ends: 4194 [2019-10-02 11:52:07,577 INFO L226 Difference]: Without dead ends: 3897 [2019-10-02 11:52:07,578 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-02 11:52:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2019-10-02 11:52:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2019-10-02 11:52:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-10-02 11:52:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5589 transitions. [2019-10-02 11:52:07,791 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5589 transitions. Word has length 105 [2019-10-02 11:52:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:07,792 INFO L475 AbstractCegarLoop]: Abstraction has 3897 states and 5589 transitions. [2019-10-02 11:52:07,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:52:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5589 transitions. [2019-10-02 11:52:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 11:52:07,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:07,793 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-02 11:52:07,793 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:07,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1094519463, now seen corresponding path program 1 times [2019-10-02 11:52:07,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:07,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:07,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:07,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:07,982 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-02 11:52:07,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:07,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:52:07,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:52:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:52:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:52:07,983 INFO L87 Difference]: Start difference. First operand 3897 states and 5589 transitions. Second operand 11 states. [2019-10-02 11:52:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:10,335 INFO L93 Difference]: Finished difference Result 3948 states and 5647 transitions. [2019-10-02 11:52:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:52:10,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-10-02 11:52:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:10,347 INFO L225 Difference]: With dead ends: 3948 [2019-10-02 11:52:10,347 INFO L226 Difference]: Without dead ends: 3868 [2019-10-02 11:52:10,349 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-02 11:52:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-10-02 11:52:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2019-10-02 11:52:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2019-10-02 11:52:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5556 transitions. [2019-10-02 11:52:10,563 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5556 transitions. Word has length 105 [2019-10-02 11:52:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:10,563 INFO L475 AbstractCegarLoop]: Abstraction has 3868 states and 5556 transitions. [2019-10-02 11:52:10,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:52:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5556 transitions. [2019-10-02 11:52:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 11:52:10,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:10,564 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-02 11:52:10,564 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash -799423163, now seen corresponding path program 1 times [2019-10-02 11:52:10,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:10,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:10,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:10,697 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-02 11:52:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:52:10,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:52:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:52:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:52:10,698 INFO L87 Difference]: Start difference. First operand 3868 states and 5556 transitions. Second operand 6 states. [2019-10-02 11:52:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:12,983 INFO L93 Difference]: Finished difference Result 6202 states and 8970 transitions. [2019-10-02 11:52:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:52:12,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-10-02 11:52:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:12,993 INFO L225 Difference]: With dead ends: 6202 [2019-10-02 11:52:12,993 INFO L226 Difference]: Without dead ends: 3898 [2019-10-02 11:52:12,998 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-02 11:52:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2019-10-02 11:52:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3886. [2019-10-02 11:52:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-10-02 11:52:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5578 transitions. [2019-10-02 11:52:13,215 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5578 transitions. Word has length 111 [2019-10-02 11:52:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:13,215 INFO L475 AbstractCegarLoop]: Abstraction has 3886 states and 5578 transitions. [2019-10-02 11:52:13,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:52:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5578 transitions. [2019-10-02 11:52:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 11:52:13,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:13,216 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-02 11:52:13,217 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2079286841, now seen corresponding path program 1 times [2019-10-02 11:52:13,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:13,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:52:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:13,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:52:13,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:13,400 INFO L87 Difference]: Start difference. First operand 3886 states and 5578 transitions. Second operand 9 states. [2019-10-02 11:52:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:15,848 INFO L93 Difference]: Finished difference Result 4217 states and 6019 transitions. [2019-10-02 11:52:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:15,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-02 11:52:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:15,856 INFO L225 Difference]: With dead ends: 4217 [2019-10-02 11:52:15,857 INFO L226 Difference]: Without dead ends: 3946 [2019-10-02 11:52:15,858 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-02 11:52:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-10-02 11:52:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3896. [2019-10-02 11:52:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-02 11:52:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 5590 transitions. [2019-10-02 11:52:16,073 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 5590 transitions. Word has length 111 [2019-10-02 11:52:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:16,073 INFO L475 AbstractCegarLoop]: Abstraction has 3896 states and 5590 transitions. [2019-10-02 11:52:16,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 5590 transitions. [2019-10-02 11:52:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 11:52:16,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:16,074 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-02 11:52:16,075 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1392010840, now seen corresponding path program 1 times [2019-10-02 11:52:16,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:16,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:16,273 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-02 11:52:16,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:16,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:52:16,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:52:16,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:52:16,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:52:16,274 INFO L87 Difference]: Start difference. First operand 3896 states and 5590 transitions. Second operand 9 states. [2019-10-02 11:52:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:18,656 INFO L93 Difference]: Finished difference Result 5999 states and 8696 transitions. [2019-10-02 11:52:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:52:18,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-02 11:52:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:18,665 INFO L225 Difference]: With dead ends: 5999 [2019-10-02 11:52:18,665 INFO L226 Difference]: Without dead ends: 3910 [2019-10-02 11:52:18,669 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-02 11:52:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2019-10-02 11:52:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3900. [2019-10-02 11:52:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-10-02 11:52:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5594 transitions. [2019-10-02 11:52:18,893 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5594 transitions. Word has length 111 [2019-10-02 11:52:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:18,893 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 5594 transitions. [2019-10-02 11:52:18,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:52:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5594 transitions. [2019-10-02 11:52:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 11:52:18,894 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:18,895 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-02 11:52:18,895 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1319118770, now seen corresponding path program 1 times [2019-10-02 11:52:18,895 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:18,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:19,070 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-02 11:52:19,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:19,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:52:19,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:19,071 INFO L87 Difference]: Start difference. First operand 3900 states and 5594 transitions. Second operand 8 states. [2019-10-02 11:54:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:54,140 INFO L93 Difference]: Finished difference Result 8199 states and 11742 transitions. [2019-10-02 11:54:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:54:54,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-10-02 11:54:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:54,158 INFO L225 Difference]: With dead ends: 8199 [2019-10-02 11:54:54,158 INFO L226 Difference]: Without dead ends: 7817 [2019-10-02 11:54:54,162 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-02 11:54:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7817 states. [2019-10-02 11:54:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7817 to 7626. [2019-10-02 11:54:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2019-10-02 11:54:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 11007 transitions. [2019-10-02 11:54:54,629 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 11007 transitions. Word has length 112 [2019-10-02 11:54:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:54,629 INFO L475 AbstractCegarLoop]: Abstraction has 7626 states and 11007 transitions. [2019-10-02 11:54:54,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:54:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 11007 transitions. [2019-10-02 11:54:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 11:54:54,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:54,631 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-02 11:54:54,631 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1695984848, now seen corresponding path program 1 times [2019-10-02 11:54:54,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:54,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:54,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:54,751 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-02 11:54:54,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:54,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:54,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:54,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:54,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:54,752 INFO L87 Difference]: Start difference. First operand 7626 states and 11007 transitions. Second operand 4 states. [2019-10-02 11:54:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:55,240 INFO L93 Difference]: Finished difference Result 14708 states and 21392 transitions. [2019-10-02 11:54:55,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:55,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-02 11:54:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:55,258 INFO L225 Difference]: With dead ends: 14708 [2019-10-02 11:54:55,258 INFO L226 Difference]: Without dead ends: 7652 [2019-10-02 11:54:55,272 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-02 11:54:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2019-10-02 11:54:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7652. [2019-10-02 11:54:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2019-10-02 11:54:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 11045 transitions. [2019-10-02 11:54:55,850 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 11045 transitions. Word has length 112 [2019-10-02 11:54:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:55,851 INFO L475 AbstractCegarLoop]: Abstraction has 7652 states and 11045 transitions. [2019-10-02 11:54:55,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 11045 transitions. [2019-10-02 11:54:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 11:54:55,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:55,853 INFO L418 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -298592059, now seen corresponding path program 1 times [2019-10-02 11:54:55,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:55,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:55,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:55,999 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-02 11:54:55,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:55,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:55,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:56,000 INFO L87 Difference]: Start difference. First operand 7652 states and 11045 transitions. Second operand 4 states. [2019-10-02 11:54:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:56,435 INFO L93 Difference]: Finished difference Result 14768 states and 21474 transitions. [2019-10-02 11:54:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:56,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-02 11:54:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:56,453 INFO L225 Difference]: With dead ends: 14768 [2019-10-02 11:54:56,453 INFO L226 Difference]: Without dead ends: 7690 [2019-10-02 11:54:56,468 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-02 11:54:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7690 states. [2019-10-02 11:54:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7690 to 7660. [2019-10-02 11:54:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7660 states. [2019-10-02 11:54:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7660 states to 7660 states and 11059 transitions. [2019-10-02 11:54:56,984 INFO L78 Accepts]: Start accepts. Automaton has 7660 states and 11059 transitions. Word has length 113 [2019-10-02 11:54:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:56,984 INFO L475 AbstractCegarLoop]: Abstraction has 7660 states and 11059 transitions. [2019-10-02 11:54:56,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7660 states and 11059 transitions. [2019-10-02 11:54:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 11:54:56,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:56,986 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-02 11:54:56,986 INFO L418 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash -658667282, now seen corresponding path program 1 times [2019-10-02 11:54:56,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:56,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:56,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:57,142 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-02 11:54:57,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:57,143 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:58,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:58,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 2291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:54:58,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:58,532 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-02 11:54:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:54:58,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 11:54:58,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:54:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:54:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:54:58,554 INFO L87 Difference]: Start difference. First operand 7660 states and 11059 transitions. Second operand 8 states. [2019-10-02 11:55:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:00,075 INFO L93 Difference]: Finished difference Result 14846 states and 21592 transitions. [2019-10-02 11:55:00,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:55:00,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-10-02 11:55:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:00,115 INFO L225 Difference]: With dead ends: 14846 [2019-10-02 11:55:00,115 INFO L226 Difference]: Without dead ends: 7754 [2019-10-02 11:55:00,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:55:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7754 states. [2019-10-02 11:55:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7754 to 7676. [2019-10-02 11:55:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7676 states. [2019-10-02 11:55:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7676 states to 7676 states and 11087 transitions. [2019-10-02 11:55:01,314 INFO L78 Accepts]: Start accepts. Automaton has 7676 states and 11087 transitions. Word has length 114 [2019-10-02 11:55:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:01,315 INFO L475 AbstractCegarLoop]: Abstraction has 7676 states and 11087 transitions. [2019-10-02 11:55:01,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:55:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7676 states and 11087 transitions. [2019-10-02 11:55:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:55:01,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:01,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:01,319 INFO L418 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1495806416, now seen corresponding path program 2 times [2019-10-02 11:55:01,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:01,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:55:01,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:01,557 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:55:02,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:55:02,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:55:02,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:55:02,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 11:55:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:55:02,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:55:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:55:02,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:55:02,822 INFO L87 Difference]: Start difference. First operand 7676 states and 11087 transitions. Second operand 9 states. [2019-10-02 11:55:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:03,627 INFO L93 Difference]: Finished difference Result 14928 states and 21724 transitions. [2019-10-02 11:55:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:55:03,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-10-02 11:55:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:03,660 INFO L225 Difference]: With dead ends: 14928 [2019-10-02 11:55:03,660 INFO L226 Difference]: Without dead ends: 7796 [2019-10-02 11:55:03,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7796 states. [2019-10-02 11:55:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7796 to 7724. [2019-10-02 11:55:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-10-02 11:55:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 11159 transitions. [2019-10-02 11:55:04,648 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 11159 transitions. Word has length 116 [2019-10-02 11:55:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:04,648 INFO L475 AbstractCegarLoop]: Abstraction has 7724 states and 11159 transitions. [2019-10-02 11:55:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 11159 transitions. [2019-10-02 11:55:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 11:55:04,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:04,654 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:04,656 INFO L418 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:04,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:04,656 INFO L82 PathProgramCache]: Analyzing trace with hash 882452874, now seen corresponding path program 1 times [2019-10-02 11:55:04,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:04,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:04,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:55:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:55:04,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:04,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:55:04,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:55:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:55:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:55:04,987 INFO L87 Difference]: Start difference. First operand 7724 states and 11159 transitions. Second operand 5 states. [2019-10-02 11:55:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:08,140 INFO L93 Difference]: Finished difference Result 12375 states and 18004 transitions. [2019-10-02 11:55:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:55:08,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-02 11:55:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:08,169 INFO L225 Difference]: With dead ends: 12375 [2019-10-02 11:55:08,170 INFO L226 Difference]: Without dead ends: 7668 [2019-10-02 11:55:08,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7668 states. [2019-10-02 11:55:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7668 to 7668. [2019-10-02 11:55:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7668 states. [2019-10-02 11:55:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7668 states to 7668 states and 11085 transitions. [2019-10-02 11:55:09,041 INFO L78 Accepts]: Start accepts. Automaton has 7668 states and 11085 transitions. Word has length 121 [2019-10-02 11:55:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:09,041 INFO L475 AbstractCegarLoop]: Abstraction has 7668 states and 11085 transitions. [2019-10-02 11:55:09,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:55:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7668 states and 11085 transitions. [2019-10-02 11:55:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 11:55:09,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:09,044 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:09,044 INFO L418 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:09,044 INFO L82 PathProgramCache]: Analyzing trace with hash 163834893, now seen corresponding path program 1 times [2019-10-02 11:55:09,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:09,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:55:09,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:09,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:55:09,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:55:09,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:55:09,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:55:09,248 INFO L87 Difference]: Start difference. First operand 7668 states and 11085 transitions. Second operand 10 states. [2019-10-02 11:55:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:11,821 INFO L93 Difference]: Finished difference Result 7780 states and 11206 transitions. [2019-10-02 11:55:11,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:55:11,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2019-10-02 11:55:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:11,840 INFO L225 Difference]: With dead ends: 7780 [2019-10-02 11:55:11,840 INFO L226 Difference]: Without dead ends: 7694 [2019-10-02 11:55:11,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7694 states. [2019-10-02 11:55:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7694 to 7664. [2019-10-02 11:55:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7664 states. [2019-10-02 11:55:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7664 states to 7664 states and 11075 transitions. [2019-10-02 11:55:12,842 INFO L78 Accepts]: Start accepts. Automaton has 7664 states and 11075 transitions. Word has length 119 [2019-10-02 11:55:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:12,844 INFO L475 AbstractCegarLoop]: Abstraction has 7664 states and 11075 transitions. [2019-10-02 11:55:12,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:55:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7664 states and 11075 transitions. [2019-10-02 11:55:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 11:55:12,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:12,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:12,848 INFO L418 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1519357897, now seen corresponding path program 1 times [2019-10-02 11:55:12,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:12,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:12,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:12,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:12,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:13,236 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-02 11:55:13,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:55:13,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:55:13,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:55:13,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:13,243 INFO L87 Difference]: Start difference. First operand 7664 states and 11075 transitions. Second operand 12 states. [2019-10-02 11:55:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:19,162 INFO L93 Difference]: Finished difference Result 7670 states and 11080 transitions. [2019-10-02 11:55:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:55:19,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-10-02 11:55:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:19,186 INFO L225 Difference]: With dead ends: 7670 [2019-10-02 11:55:19,187 INFO L226 Difference]: Without dead ends: 7520 [2019-10-02 11:55:19,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:55:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7520 states. [2019-10-02 11:55:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7520 to 7520. [2019-10-02 11:55:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7520 states. [2019-10-02 11:55:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 10900 transitions. [2019-10-02 11:55:20,118 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 10900 transitions. Word has length 117 [2019-10-02 11:55:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:20,118 INFO L475 AbstractCegarLoop]: Abstraction has 7520 states and 10900 transitions. [2019-10-02 11:55:20,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:55:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 10900 transitions. [2019-10-02 11:55:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 11:55:20,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:20,122 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:20,123 INFO L418 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash -625436603, now seen corresponding path program 1 times [2019-10-02 11:55:20,123 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:20,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:55:20,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:20,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:55:20,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:55:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:55:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:55:20,410 INFO L87 Difference]: Start difference. First operand 7520 states and 10900 transitions. Second operand 6 states. [2019-10-02 11:55:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:54,163 INFO L93 Difference]: Finished difference Result 9881 states and 14362 transitions. [2019-10-02 11:55:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:55:54,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 11:55:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:54,178 INFO L225 Difference]: With dead ends: 9881 [2019-10-02 11:55:54,179 INFO L226 Difference]: Without dead ends: 5234 [2019-10-02 11:55:54,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2019-10-02 11:55:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 2945. [2019-10-02 11:55:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2019-10-02 11:55:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4133 transitions. [2019-10-02 11:55:54,447 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4133 transitions. Word has length 123 [2019-10-02 11:55:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:54,448 INFO L475 AbstractCegarLoop]: Abstraction has 2945 states and 4133 transitions. [2019-10-02 11:55:54,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:55:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4133 transitions. [2019-10-02 11:55:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:55:54,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:54,450 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:54,450 INFO L418 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1916151773, now seen corresponding path program 1 times [2019-10-02 11:55:54,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:54,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:54,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:54,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:55:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:54,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:55:54,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:55:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:55:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:55:54,707 INFO L87 Difference]: Start difference. First operand 2945 states and 4133 transitions. Second operand 10 states. [2019-10-02 11:55:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:56,136 INFO L93 Difference]: Finished difference Result 3005 states and 4200 transitions. [2019-10-02 11:55:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:55:56,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-10-02 11:55:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:56,141 INFO L225 Difference]: With dead ends: 3005 [2019-10-02 11:55:56,141 INFO L226 Difference]: Without dead ends: 2855 [2019-10-02 11:55:56,141 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:55:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2019-10-02 11:55:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2845. [2019-10-02 11:55:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-10-02 11:55:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4011 transitions. [2019-10-02 11:55:56,454 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4011 transitions. Word has length 124 [2019-10-02 11:55:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:56,455 INFO L475 AbstractCegarLoop]: Abstraction has 2845 states and 4011 transitions. [2019-10-02 11:55:56,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:55:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4011 transitions. [2019-10-02 11:55:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 11:55:56,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:56,458 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:56,459 INFO L418 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:56,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash 766842637, now seen corresponding path program 1 times [2019-10-02 11:55:56,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:56,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:56,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-02 11:55:56,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:56,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:55:56,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:55:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:55:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:56,700 INFO L87 Difference]: Start difference. First operand 2845 states and 4011 transitions. Second operand 7 states. [2019-10-02 11:55:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:58,965 INFO L93 Difference]: Finished difference Result 2905 states and 4078 transitions. [2019-10-02 11:55:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:55:58,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-10-02 11:55:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:58,973 INFO L225 Difference]: With dead ends: 2905 [2019-10-02 11:55:58,973 INFO L226 Difference]: Without dead ends: 2845 [2019-10-02 11:55:58,974 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-02 11:55:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2019-10-02 11:55:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2841. [2019-10-02 11:55:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2019-10-02 11:55:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 4003 transitions. [2019-10-02 11:55:59,247 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 4003 transitions. Word has length 146 [2019-10-02 11:55:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:59,247 INFO L475 AbstractCegarLoop]: Abstraction has 2841 states and 4003 transitions. [2019-10-02 11:55:59,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:55:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 4003 transitions. [2019-10-02 11:55:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:55:59,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:59,249 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:59,249 INFO L418 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash 153626585, now seen corresponding path program 1 times [2019-10-02 11:55:59,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-02 11:55:59,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:59,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:55:59,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:55:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:55:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:59,419 INFO L87 Difference]: Start difference. First operand 2841 states and 4003 transitions. Second operand 7 states. [2019-10-02 11:56:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:01,630 INFO L93 Difference]: Finished difference Result 2851 states and 4012 transitions. [2019-10-02 11:56:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:56:01,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-02 11:56:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:01,636 INFO L225 Difference]: With dead ends: 2851 [2019-10-02 11:56:01,636 INFO L226 Difference]: Without dead ends: 2635 [2019-10-02 11:56:01,637 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-02 11:56:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2019-10-02 11:56:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2631. [2019-10-02 11:56:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2019-10-02 11:56:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3753 transitions. [2019-10-02 11:56:01,790 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3753 transitions. Word has length 147 [2019-10-02 11:56:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:01,790 INFO L475 AbstractCegarLoop]: Abstraction has 2631 states and 3753 transitions. [2019-10-02 11:56:01,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:56:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3753 transitions. [2019-10-02 11:56:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:56:01,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:01,792 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:01,792 INFO L418 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2068049456, now seen corresponding path program 1 times [2019-10-02 11:56:01,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:01,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:01,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:01,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:56:01,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:56:01,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:56:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:56:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:56:01,981 INFO L87 Difference]: Start difference. First operand 2631 states and 3753 transitions. Second operand 7 states. [2019-10-02 11:56:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:47,676 INFO L93 Difference]: Finished difference Result 5010 states and 7235 transitions. [2019-10-02 11:56:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:56:47,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-02 11:56:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:47,687 INFO L225 Difference]: With dead ends: 5010 [2019-10-02 11:56:47,687 INFO L226 Difference]: Without dead ends: 2631 [2019-10-02 11:56:47,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:56:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-10-02 11:56:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2019-10-02 11:56:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2019-10-02 11:56:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3751 transitions. [2019-10-02 11:56:47,987 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3751 transitions. Word has length 153 [2019-10-02 11:56:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:47,987 INFO L475 AbstractCegarLoop]: Abstraction has 2631 states and 3751 transitions. [2019-10-02 11:56:47,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:56:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3751 transitions. [2019-10-02 11:56:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:56:47,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:47,990 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:47,990 INFO L418 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1983867825, now seen corresponding path program 1 times [2019-10-02 11:56:47,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:47,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:48,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:56:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:48,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:56:48,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:56:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:56:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:56:48,428 INFO L87 Difference]: Start difference. First operand 2631 states and 3751 transitions. Second operand 9 states. [2019-10-02 11:56:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:50,734 INFO L93 Difference]: Finished difference Result 2692 states and 3846 transitions. [2019-10-02 11:56:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:56:50,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-10-02 11:56:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:50,739 INFO L225 Difference]: With dead ends: 2692 [2019-10-02 11:56:50,739 INFO L226 Difference]: Without dead ends: 2629 [2019-10-02 11:56:50,740 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:56:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-10-02 11:56:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2625. [2019-10-02 11:56:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-10-02 11:56:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3741 transitions. [2019-10-02 11:56:50,904 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3741 transitions. Word has length 153 [2019-10-02 11:56:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:50,904 INFO L475 AbstractCegarLoop]: Abstraction has 2625 states and 3741 transitions. [2019-10-02 11:56:50,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:56:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3741 transitions. [2019-10-02 11:56:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:56:50,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:50,906 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:50,906 INFO L418 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1233705557, now seen corresponding path program 1 times [2019-10-02 11:56:50,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:50,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:50,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 11:56:51,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:56:51,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:56:51,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:56:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:56:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:56:51,168 INFO L87 Difference]: Start difference. First operand 2625 states and 3741 transitions. Second operand 10 states.