java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:34:55,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:34:55,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:34:55,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:34:55,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:34:55,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:34:55,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:34:55,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:34:55,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:34:55,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:34:55,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:34:55,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:34:55,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:34:55,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:34:55,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:34:55,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:34:55,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:34:55,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:34:55,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:34:55,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:34:55,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:34:55,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:34:55,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:34:55,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:34:55,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:34:55,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:34:55,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:34:55,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:34:55,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:34:55,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:34:55,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:34:55,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:34:55,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:34:55,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:34:55,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:34:55,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:34:55,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:34:55,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:34:55,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:34:55,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:34:55,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:34:55,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:34:55,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:34:55,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:34:55,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:34:55,842 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:34:55,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:34:55,842 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:34:55,843 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:34:55,843 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:34:55,844 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:34:55,844 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:34:55,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:34:55,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:34:55,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:34:55,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:34:55,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:34:55,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:34:55,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:34:55,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:34:55,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:34:55,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:34:55,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:34:55,847 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:34:55,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:34:55,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:34:55,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:34:55,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:34:55,848 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:34:55,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:34:55,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:34:55,849 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:34:55,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:34:55,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:34:55,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:34:55,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:34:55,921 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:34:55,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-09-10 02:34:55,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c8e074a/e9f32764572341c0ad2dc2a36fc2937a/FLAGebeb8363d [2019-09-10 02:34:56,560 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:34:56,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-09-10 02:34:56,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c8e074a/e9f32764572341c0ad2dc2a36fc2937a/FLAGebeb8363d [2019-09-10 02:34:56,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c8e074a/e9f32764572341c0ad2dc2a36fc2937a [2019-09-10 02:34:56,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:34:56,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:34:56,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:34:56,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:34:56,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:34:56,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:34:56" (1/1) ... [2019-09-10 02:34:56,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6e7385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:56, skipping insertion in model container [2019-09-10 02:34:56,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:34:56" (1/1) ... [2019-09-10 02:34:56,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:34:56,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:34:57,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:34:57,621 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:34:57,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:34:57,852 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:34:57,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57 WrapperNode [2019-09-10 02:34:57,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:34:57,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:34:57,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:34:57,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:34:57,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:57,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:57,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:57,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:57,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:58,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:58,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (1/1) ... [2019-09-10 02:34:58,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:34:58,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:34:58,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:34:58,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:34:58,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (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-09-10 02:34:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:34:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:34:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:34:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:34:58,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:34:58,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:34:58,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:34:58,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:34:58,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:34:58,139 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:34:58,139 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:34:58,139 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:34:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:34:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:34:58,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:34:58,142 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:34:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:34:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:34:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:34:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:34:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:34:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:34:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:34:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:34:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:34:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:34:58,148 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:34:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:34:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:34:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:34:58,149 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:34:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:34:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:34:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:34:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:34:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:34:58,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:34:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:34:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:34:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:34:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:34:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:34:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:34:58,154 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:34:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:34:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:34:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:34:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:34:58,155 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:34:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:34:58,156 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:34:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:34:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:34:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:34:58,157 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:34:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:34:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:34:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:34:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:34:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:34:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:34:58,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:34:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:34:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:34:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:34:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:34:58,161 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:34:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:34:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:34:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:34:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:34:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:34:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:34:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:34:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:34:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:34:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:34:58,164 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:34:58,165 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:34:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:34:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:34:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:34:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:34:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:34:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:34:58,167 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:34:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:34:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:34:58,175 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:34:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:34:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:34:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:34:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:34:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:34:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:34:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:34:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:34:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:35:00,343 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:35:00,344 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:35:00,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:00 BoogieIcfgContainer [2019-09-10 02:35:00,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:35:00,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:35:00,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:35:00,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:35:00,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:34:56" (1/3) ... [2019-09-10 02:35:00,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fee745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:00, skipping insertion in model container [2019-09-10 02:35:00,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:57" (2/3) ... [2019-09-10 02:35:00,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fee745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:00, skipping insertion in model container [2019-09-10 02:35:00,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:00" (3/3) ... [2019-09-10 02:35:00,354 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2019-09-10 02:35:00,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:35:00,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:35:00,392 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:35:00,427 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:35:00,427 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:35:00,428 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:35:00,428 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:35:00,428 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:35:00,428 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:35:00,428 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:35:00,428 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:35:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-09-10 02:35:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 02:35:00,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:00,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:00,516 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1728086077, now seen corresponding path program 1 times [2019-09-10 02:35:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:00,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:00,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:01,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:01,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:01,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:01,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:01,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:01,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:01,189 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-09-10 02:35:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:01,329 INFO L93 Difference]: Finished difference Result 600 states and 957 transitions. [2019-09-10 02:35:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:01,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 02:35:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:01,363 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:35:01,363 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:35:01,369 INFO L628 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-09-10 02:35:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:35:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:35:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:35:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-09-10 02:35:01,483 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 109 [2019-09-10 02:35:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:01,484 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-09-10 02:35:01,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-09-10 02:35:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:35:01,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:01,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:01,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1757589142, now seen corresponding path program 1 times [2019-09-10 02:35:01,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:01,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:01,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:01,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:01,660 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-09-10 02:35:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:01,739 INFO L93 Difference]: Finished difference Result 591 states and 946 transitions. [2019-09-10 02:35:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:01,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 02:35:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:01,747 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:35:01,747 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:35:01,748 INFO L628 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-09-10 02:35:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:35:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:35:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:35:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-09-10 02:35:01,797 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 112 [2019-09-10 02:35:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:01,800 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-09-10 02:35:01,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-09-10 02:35:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:35:01,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:01,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:01,811 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1080658030, now seen corresponding path program 1 times [2019-09-10 02:35:01,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:02,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:02,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:02,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:02,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:02,029 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-09-10 02:35:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:02,097 INFO L93 Difference]: Finished difference Result 591 states and 945 transitions. [2019-09-10 02:35:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:02,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 02:35:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:02,102 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:35:02,102 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:35:02,102 INFO L628 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-09-10 02:35:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:35:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:35:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:35:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-09-10 02:35:02,168 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 113 [2019-09-10 02:35:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:02,168 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-09-10 02:35:02,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-09-10 02:35:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:35:02,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:02,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:02,176 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:02,177 INFO L82 PathProgramCache]: Analyzing trace with hash -714374894, now seen corresponding path program 1 times [2019-09-10 02:35:02,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:02,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:02,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-09-10 02:35:02,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:02,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:02,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:02,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:02,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:02,350 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-09-10 02:35:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:02,410 INFO L93 Difference]: Finished difference Result 591 states and 944 transitions. [2019-09-10 02:35:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:02,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 02:35:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:02,415 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:35:02,415 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:35:02,415 INFO L628 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-09-10 02:35:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:35:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:35:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:35:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-09-10 02:35:02,435 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-09-10 02:35:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:02,436 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-09-10 02:35:02,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-09-10 02:35:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:35:02,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:02,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:02,440 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1484141674, now seen corresponding path program 1 times [2019-09-10 02:35:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:02,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:02,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:02,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:02,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:02,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:02,540 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-09-10 02:35:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:02,583 INFO L93 Difference]: Finished difference Result 591 states and 943 transitions. [2019-09-10 02:35:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:02,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-10 02:35:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:02,587 INFO L225 Difference]: With dead ends: 591 [2019-09-10 02:35:02,587 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 02:35:02,588 INFO L628 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-09-10 02:35:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 02:35:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-10 02:35:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-10 02:35:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-09-10 02:35:02,604 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 115 [2019-09-10 02:35:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:02,605 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-09-10 02:35:02,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-09-10 02:35:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:35:02,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:02,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:02,608 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1366326386, now seen corresponding path program 1 times [2019-09-10 02:35:02,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:02,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:02,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:02,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:02,823 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-09-10 02:35:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:03,092 INFO L93 Difference]: Finished difference Result 598 states and 952 transitions. [2019-09-10 02:35:03,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:35:03,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-09-10 02:35:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:03,105 INFO L225 Difference]: With dead ends: 598 [2019-09-10 02:35:03,105 INFO L226 Difference]: Without dead ends: 598 [2019-09-10 02:35:03,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-10 02:35:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-09-10 02:35:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-10 02:35:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-09-10 02:35:03,134 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 116 [2019-09-10 02:35:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:03,136 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-09-10 02:35:03,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-09-10 02:35:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:35:03,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:03,143 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:03,143 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1937577619, now seen corresponding path program 1 times [2019-09-10 02:35:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:03,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:03,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:03,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:03,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:03,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:03,251 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-09-10 02:35:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:03,294 INFO L93 Difference]: Finished difference Result 594 states and 945 transitions. [2019-09-10 02:35:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:03,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 02:35:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:03,299 INFO L225 Difference]: With dead ends: 594 [2019-09-10 02:35:03,299 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:35:03,300 INFO L628 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-09-10 02:35:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:35:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:35:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:35:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-09-10 02:35:03,324 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 116 [2019-09-10 02:35:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:03,325 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-09-10 02:35:03,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-09-10 02:35:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:35:03,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:03,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:03,329 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash 13298972, now seen corresponding path program 1 times [2019-09-10 02:35:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:03,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-09-10 02:35:03,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:03,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:03,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:03,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:03,453 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-09-10 02:35:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:03,658 INFO L93 Difference]: Finished difference Result 586 states and 930 transitions. [2019-09-10 02:35:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:03,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-10 02:35:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:03,663 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:35:03,663 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:35:03,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:35:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:35:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:35:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-09-10 02:35:03,681 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 117 [2019-09-10 02:35:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:03,682 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-09-10 02:35:03,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-09-10 02:35:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:35:03,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:03,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:03,686 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash -65631567, now seen corresponding path program 1 times [2019-09-10 02:35:03,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:03,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:03,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:03,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:03,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:03,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:03,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:03,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:03,859 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-09-10 02:35:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:04,043 INFO L93 Difference]: Finished difference Result 586 states and 926 transitions. [2019-09-10 02:35:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:04,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 02:35:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:04,048 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:35:04,049 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:35:04,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:35:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:35:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:35:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-09-10 02:35:04,069 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 118 [2019-09-10 02:35:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:04,069 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-09-10 02:35:04,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-09-10 02:35:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:35:04,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:04,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:04,074 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1299849921, now seen corresponding path program 1 times [2019-09-10 02:35:04,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:04,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:04,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:04,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:04,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:04,207 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-09-10 02:35:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:04,376 INFO L93 Difference]: Finished difference Result 586 states and 922 transitions. [2019-09-10 02:35:04,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:04,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 02:35:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:04,381 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:35:04,381 INFO L226 Difference]: Without dead ends: 583 [2019-09-10 02:35:04,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-10 02:35:04,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-10 02:35:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-10 02:35:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-09-10 02:35:04,399 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 119 [2019-09-10 02:35:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:04,399 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-09-10 02:35:04,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-09-10 02:35:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:35:04,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:04,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:04,403 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash 333553473, now seen corresponding path program 1 times [2019-09-10 02:35:04,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:04,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:04,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:04,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:04,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:04,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:04,526 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-09-10 02:35:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:04,607 INFO L93 Difference]: Finished difference Result 586 states and 918 transitions. [2019-09-10 02:35:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:04,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-10 02:35:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:04,613 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:35:04,613 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:35:04,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:35:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:35:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:35:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-09-10 02:35:04,635 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 119 [2019-09-10 02:35:04,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:04,635 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-09-10 02:35:04,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-09-10 02:35:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:35:04,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:04,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:04,640 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 197463990, now seen corresponding path program 1 times [2019-09-10 02:35:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:04,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:04,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:04,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:04,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:04,817 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-09-10 02:35:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:04,904 INFO L93 Difference]: Finished difference Result 565 states and 884 transitions. [2019-09-10 02:35:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:04,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-10 02:35:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:04,908 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:35:04,909 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:35:04,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:35:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:35:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:35:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-09-10 02:35:04,928 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 120 [2019-09-10 02:35:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:04,928 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-09-10 02:35:04,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-09-10 02:35:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:35:04,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:04,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:04,932 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -99400602, now seen corresponding path program 1 times [2019-09-10 02:35:04,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:04,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:05,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:05,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:05,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:05,047 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-09-10 02:35:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:05,127 INFO L93 Difference]: Finished difference Result 565 states and 883 transitions. [2019-09-10 02:35:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:05,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-10 02:35:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:05,132 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:35:05,132 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:35:05,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:35:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:35:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:35:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-09-10 02:35:05,149 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 121 [2019-09-10 02:35:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:05,150 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-09-10 02:35:05,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-09-10 02:35:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:35:05,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:05,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:05,154 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1189017277, now seen corresponding path program 1 times [2019-09-10 02:35:05,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:05,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:05,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:05,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:05,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:05,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:05,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:05,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:05,257 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 4 states. [2019-09-10 02:35:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:05,296 INFO L93 Difference]: Finished difference Result 565 states and 882 transitions. [2019-09-10 02:35:05,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:05,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-10 02:35:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:05,301 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:35:05,301 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:35:05,301 INFO L628 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-09-10 02:35:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:35:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:35:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:35:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-09-10 02:35:05,320 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 122 [2019-09-10 02:35:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:05,320 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-09-10 02:35:05,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-09-10 02:35:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:35:05,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:05,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:05,324 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1194907461, now seen corresponding path program 1 times [2019-09-10 02:35:05,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:05,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:35:05,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:05,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:35:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:35:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:35:05,541 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 12 states. [2019-09-10 02:35:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:05,712 INFO L93 Difference]: Finished difference Result 566 states and 881 transitions. [2019-09-10 02:35:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:35:05,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-10 02:35:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:05,717 INFO L225 Difference]: With dead ends: 566 [2019-09-10 02:35:05,717 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:35:05,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:35:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:35:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:35:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:35:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 877 transitions. [2019-09-10 02:35:05,734 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 877 transitions. Word has length 122 [2019-09-10 02:35:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:05,735 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 877 transitions. [2019-09-10 02:35:05,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:35:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 877 transitions. [2019-09-10 02:35:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:35:05,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:05,738 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:05,738 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1301394887, now seen corresponding path program 1 times [2019-09-10 02:35:05,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:05,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:05,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:05,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:05,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:35:05,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:05,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:35:05,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:35:05,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:35:05,897 INFO L87 Difference]: Start difference. First operand 562 states and 877 transitions. Second operand 9 states. [2019-09-10 02:35:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:09,656 INFO L93 Difference]: Finished difference Result 568 states and 898 transitions. [2019-09-10 02:35:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:35:09,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 02:35:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:09,661 INFO L225 Difference]: With dead ends: 568 [2019-09-10 02:35:09,661 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:35:09,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:35:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:35:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-09-10 02:35:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-10 02:35:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-09-10 02:35:09,678 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 123 [2019-09-10 02:35:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:09,679 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-09-10 02:35:09,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-09-10 02:35:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:35:09,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:09,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:09,683 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash -613976497, now seen corresponding path program 1 times [2019-09-10 02:35:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:09,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:09,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:09,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:35:09,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:09,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:35:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:35:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:09,880 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 8 states. [2019-09-10 02:35:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:16,410 INFO L93 Difference]: Finished difference Result 1490 states and 2372 transitions. [2019-09-10 02:35:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:35:16,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-09-10 02:35:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:16,430 INFO L225 Difference]: With dead ends: 1490 [2019-09-10 02:35:16,430 INFO L226 Difference]: Without dead ends: 1490 [2019-09-10 02:35:16,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:35:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-09-10 02:35:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1451. [2019-09-10 02:35:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-09-10 02:35:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2319 transitions. [2019-09-10 02:35:16,504 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2319 transitions. Word has length 124 [2019-09-10 02:35:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:16,504 INFO L475 AbstractCegarLoop]: Abstraction has 1451 states and 2319 transitions. [2019-09-10 02:35:16,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:35:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2319 transitions. [2019-09-10 02:35:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:35:16,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:16,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:16,510 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1563620061, now seen corresponding path program 1 times [2019-09-10 02:35:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:16,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:16,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:16,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:16,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:16,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:35:16,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:16,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:35:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:35:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:35:16,738 INFO L87 Difference]: Start difference. First operand 1451 states and 2319 transitions. Second operand 9 states. [2019-09-10 02:35:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:23,806 INFO L93 Difference]: Finished difference Result 3269 states and 5344 transitions. [2019-09-10 02:35:23,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:35:23,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-10 02:35:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:23,831 INFO L225 Difference]: With dead ends: 3269 [2019-09-10 02:35:23,831 INFO L226 Difference]: Without dead ends: 3269 [2019-09-10 02:35:23,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:35:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-09-10 02:35:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3046. [2019-09-10 02:35:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2019-09-10 02:35:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4929 transitions. [2019-09-10 02:35:23,940 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4929 transitions. Word has length 130 [2019-09-10 02:35:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:23,940 INFO L475 AbstractCegarLoop]: Abstraction has 3046 states and 4929 transitions. [2019-09-10 02:35:23,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4929 transitions. [2019-09-10 02:35:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:35:23,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:23,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:23,944 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -430429468, now seen corresponding path program 1 times [2019-09-10 02:35:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:23,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:23,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:23,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:23,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:24,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:24,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:35:24,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:24,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:35:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:35:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:24,058 INFO L87 Difference]: Start difference. First operand 3046 states and 4929 transitions. Second operand 5 states. [2019-09-10 02:35:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:26,478 INFO L93 Difference]: Finished difference Result 4477 states and 7179 transitions. [2019-09-10 02:35:26,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:26,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-10 02:35:26,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:26,510 INFO L225 Difference]: With dead ends: 4477 [2019-09-10 02:35:26,510 INFO L226 Difference]: Without dead ends: 4471 [2019-09-10 02:35:26,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-09-10 02:35:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2019-09-10 02:35:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4444. [2019-09-10 02:35:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-10 02:35:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 7119 transitions. [2019-09-10 02:35:26,650 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 7119 transitions. Word has length 130 [2019-09-10 02:35:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:26,650 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 7119 transitions. [2019-09-10 02:35:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:35:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 7119 transitions. [2019-09-10 02:35:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:35:26,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:26,654 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:26,654 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:26,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1936265126, now seen corresponding path program 1 times [2019-09-10 02:35:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:26,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:26,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:26,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:26,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:26,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:26,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:26,824 INFO L87 Difference]: Start difference. First operand 4444 states and 7119 transitions. Second operand 7 states. [2019-09-10 02:35:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:31,051 INFO L93 Difference]: Finished difference Result 8686 states and 14111 transitions. [2019-09-10 02:35:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:35:31,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-09-10 02:35:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:31,143 INFO L225 Difference]: With dead ends: 8686 [2019-09-10 02:35:31,144 INFO L226 Difference]: Without dead ends: 8686 [2019-09-10 02:35:31,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8686 states. [2019-09-10 02:35:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8686 to 8523. [2019-09-10 02:35:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8523 states. [2019-09-10 02:35:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 13801 transitions. [2019-09-10 02:35:31,529 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 13801 transitions. Word has length 130 [2019-09-10 02:35:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:31,529 INFO L475 AbstractCegarLoop]: Abstraction has 8523 states and 13801 transitions. [2019-09-10 02:35:31,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 13801 transitions. [2019-09-10 02:35:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:35:31,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:31,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:31,533 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:31,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1833691056, now seen corresponding path program 1 times [2019-09-10 02:35:31,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:31,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:31,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:31,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:31,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:31,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:35:31,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:31,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:35:31,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:35:31,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:31,636 INFO L87 Difference]: Start difference. First operand 8523 states and 13801 transitions. Second operand 5 states. [2019-09-10 02:35:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:31,739 INFO L93 Difference]: Finished difference Result 8745 states and 14163 transitions. [2019-09-10 02:35:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:35:31,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-10 02:35:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:31,793 INFO L225 Difference]: With dead ends: 8745 [2019-09-10 02:35:31,793 INFO L226 Difference]: Without dead ends: 8745 [2019-09-10 02:35:31,794 INFO L628 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-09-10 02:35:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8745 states. [2019-09-10 02:35:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8745 to 8613. [2019-09-10 02:35:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-09-10 02:35:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 13928 transitions. [2019-09-10 02:35:32,057 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 13928 transitions. Word has length 135 [2019-09-10 02:35:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:32,057 INFO L475 AbstractCegarLoop]: Abstraction has 8613 states and 13928 transitions. [2019-09-10 02:35:32,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:35:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 13928 transitions. [2019-09-10 02:35:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:35:32,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:32,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:32,065 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 723364682, now seen corresponding path program 1 times [2019-09-10 02:35:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:32,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:32,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:32,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:32,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:32,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:32,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:32,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:32,196 INFO L87 Difference]: Start difference. First operand 8613 states and 13928 transitions. Second operand 7 states. [2019-09-10 02:35:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:32,392 INFO L93 Difference]: Finished difference Result 9529 states and 15388 transitions. [2019-09-10 02:35:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:32,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-10 02:35:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:32,434 INFO L225 Difference]: With dead ends: 9529 [2019-09-10 02:35:32,435 INFO L226 Difference]: Without dead ends: 8613 [2019-09-10 02:35:32,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:32,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8613 states. [2019-09-10 02:35:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8613 to 8613. [2019-09-10 02:35:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-09-10 02:35:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 13752 transitions. [2019-09-10 02:35:32,673 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 13752 transitions. Word has length 142 [2019-09-10 02:35:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:32,673 INFO L475 AbstractCegarLoop]: Abstraction has 8613 states and 13752 transitions. [2019-09-10 02:35:32,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 13752 transitions. [2019-09-10 02:35:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:35:32,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:32,677 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:32,678 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash -632472725, now seen corresponding path program 1 times [2019-09-10 02:35:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:32,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:32,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:32,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:35:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:32,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:32,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:32,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:32,825 INFO L87 Difference]: Start difference. First operand 8613 states and 13752 transitions. Second operand 7 states. [2019-09-10 02:35:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:37,069 INFO L93 Difference]: Finished difference Result 9288 states and 14750 transitions. [2019-09-10 02:35:37,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:35:37,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-10 02:35:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:37,114 INFO L225 Difference]: With dead ends: 9288 [2019-09-10 02:35:37,114 INFO L226 Difference]: Without dead ends: 9288 [2019-09-10 02:35:37,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:35:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-09-10 02:35:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9077. [2019-09-10 02:35:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9077 states. [2019-09-10 02:35:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 14374 transitions. [2019-09-10 02:35:37,993 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 14374 transitions. Word has length 147 [2019-09-10 02:35:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:37,993 INFO L475 AbstractCegarLoop]: Abstraction has 9077 states and 14374 transitions. [2019-09-10 02:35:37,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 14374 transitions. [2019-09-10 02:35:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:35:37,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:37,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:37,998 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1781622883, now seen corresponding path program 1 times [2019-09-10 02:35:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:38,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:38,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:38,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:38,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:38,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:35:38,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:38,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:35:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:35:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:38,174 INFO L87 Difference]: Start difference. First operand 9077 states and 14374 transitions. Second operand 11 states. [2019-09-10 02:35:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:44,617 INFO L93 Difference]: Finished difference Result 11692 states and 18274 transitions. [2019-09-10 02:35:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:35:44,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-10 02:35:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:44,677 INFO L225 Difference]: With dead ends: 11692 [2019-09-10 02:35:44,677 INFO L226 Difference]: Without dead ends: 11668 [2019-09-10 02:35:44,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:35:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11668 states. [2019-09-10 02:35:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11668 to 11405. [2019-09-10 02:35:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11405 states. [2019-09-10 02:35:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11405 states to 11405 states and 17760 transitions. [2019-09-10 02:35:44,975 INFO L78 Accepts]: Start accepts. Automaton has 11405 states and 17760 transitions. Word has length 154 [2019-09-10 02:35:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:44,975 INFO L475 AbstractCegarLoop]: Abstraction has 11405 states and 17760 transitions. [2019-09-10 02:35:44,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:35:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11405 states and 17760 transitions. [2019-09-10 02:35:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:35:44,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:44,980 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:44,980 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash -494140473, now seen corresponding path program 1 times [2019-09-10 02:35:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:44,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:44,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:45,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:45,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:45,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:45,151 INFO L87 Difference]: Start difference. First operand 11405 states and 17760 transitions. Second operand 10 states. [2019-09-10 02:35:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:51,393 INFO L93 Difference]: Finished difference Result 24450 states and 38791 transitions. [2019-09-10 02:35:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:51,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 02:35:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:51,489 INFO L225 Difference]: With dead ends: 24450 [2019-09-10 02:35:51,489 INFO L226 Difference]: Without dead ends: 24450 [2019-09-10 02:35:51,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24450 states. [2019-09-10 02:35:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24450 to 24233. [2019-09-10 02:35:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24233 states. [2019-09-10 02:35:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24233 states to 24233 states and 38251 transitions. [2019-09-10 02:35:52,086 INFO L78 Accepts]: Start accepts. Automaton has 24233 states and 38251 transitions. Word has length 152 [2019-09-10 02:35:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:52,087 INFO L475 AbstractCegarLoop]: Abstraction has 24233 states and 38251 transitions. [2019-09-10 02:35:52,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 24233 states and 38251 transitions. [2019-09-10 02:35:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:35:52,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:52,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:52,093 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash -162054303, now seen corresponding path program 1 times [2019-09-10 02:35:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:52,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:52,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:52,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:52,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:52,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:52,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:52,228 INFO L87 Difference]: Start difference. First operand 24233 states and 38251 transitions. Second operand 10 states. [2019-09-10 02:35:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:59,457 INFO L93 Difference]: Finished difference Result 53366 states and 86875 transitions. [2019-09-10 02:35:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:59,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 02:35:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:59,760 INFO L225 Difference]: With dead ends: 53366 [2019-09-10 02:35:59,760 INFO L226 Difference]: Without dead ends: 53366 [2019-09-10 02:35:59,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53366 states. [2019-09-10 02:36:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53366 to 52951. [2019-09-10 02:36:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52951 states. [2019-09-10 02:36:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52951 states to 52951 states and 85609 transitions. [2019-09-10 02:36:01,548 INFO L78 Accepts]: Start accepts. Automaton has 52951 states and 85609 transitions. Word has length 153 [2019-09-10 02:36:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:01,549 INFO L475 AbstractCegarLoop]: Abstraction has 52951 states and 85609 transitions. [2019-09-10 02:36:01,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 52951 states and 85609 transitions. [2019-09-10 02:36:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:36:01,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:01,555 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:01,555 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1016312442, now seen corresponding path program 1 times [2019-09-10 02:36:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:01,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:01,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:01,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:01,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:01,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:01,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:01,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:01,721 INFO L87 Difference]: Start difference. First operand 52951 states and 85609 transitions. Second operand 10 states. [2019-09-10 02:36:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:09,741 INFO L93 Difference]: Finished difference Result 120131 states and 203356 transitions. [2019-09-10 02:36:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:09,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 02:36:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:10,317 INFO L225 Difference]: With dead ends: 120131 [2019-09-10 02:36:10,318 INFO L226 Difference]: Without dead ends: 120131 [2019-09-10 02:36:10,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120131 states. [2019-09-10 02:36:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120131 to 119320. [2019-09-10 02:36:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119320 states. [2019-09-10 02:36:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119320 states to 119320 states and 200014 transitions. [2019-09-10 02:36:13,193 INFO L78 Accepts]: Start accepts. Automaton has 119320 states and 200014 transitions. Word has length 156 [2019-09-10 02:36:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:13,193 INFO L475 AbstractCegarLoop]: Abstraction has 119320 states and 200014 transitions. [2019-09-10 02:36:13,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 119320 states and 200014 transitions. [2019-09-10 02:36:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 02:36:13,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:13,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:13,201 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 683461285, now seen corresponding path program 1 times [2019-09-10 02:36:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:15,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:15,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:16,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:16,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:16,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:16,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:16,036 INFO L87 Difference]: Start difference. First operand 119320 states and 200014 transitions. Second operand 10 states. [2019-09-10 02:36:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:24,547 INFO L93 Difference]: Finished difference Result 280897 states and 503294 transitions. [2019-09-10 02:36:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:24,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 02:36:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:30,127 INFO L225 Difference]: With dead ends: 280897 [2019-09-10 02:36:30,127 INFO L226 Difference]: Without dead ends: 280897 [2019-09-10 02:36:30,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280897 states. [2019-09-10 02:36:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280897 to 279294. [2019-09-10 02:36:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279294 states. [2019-09-10 02:36:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279294 states to 279294 states and 493304 transitions. [2019-09-10 02:36:38,604 INFO L78 Accepts]: Start accepts. Automaton has 279294 states and 493304 transitions. Word has length 155 [2019-09-10 02:36:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:38,604 INFO L475 AbstractCegarLoop]: Abstraction has 279294 states and 493304 transitions. [2019-09-10 02:36:38,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 279294 states and 493304 transitions. [2019-09-10 02:36:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:36:38,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:38,611 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:38,611 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 225105487, now seen corresponding path program 1 times [2019-09-10 02:36:38,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:38,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:38,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:38,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:38,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:38,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:38,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:38,760 INFO L87 Difference]: Start difference. First operand 279294 states and 493304 transitions. Second operand 10 states. [2019-09-10 02:37:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:07,961 INFO L93 Difference]: Finished difference Result 689416 states and 1339049 transitions. [2019-09-10 02:37:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:37:07,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 02:37:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:21,991 INFO L225 Difference]: With dead ends: 689416 [2019-09-10 02:37:21,991 INFO L226 Difference]: Without dead ends: 689416 [2019-09-10 02:37:21,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:37:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689416 states. [2019-09-10 02:38:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689416 to 686229. [2019-09-10 02:38:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686229 states. [2019-09-10 02:38:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686229 states to 686229 states and 1305779 transitions. [2019-09-10 02:38:29,780 INFO L78 Accepts]: Start accepts. Automaton has 686229 states and 1305779 transitions. Word has length 156 [2019-09-10 02:38:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:29,780 INFO L475 AbstractCegarLoop]: Abstraction has 686229 states and 1305779 transitions. [2019-09-10 02:38:29,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:38:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 686229 states and 1305779 transitions. [2019-09-10 02:38:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:38:29,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:29,787 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:29,787 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:29,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash -253618711, now seen corresponding path program 1 times [2019-09-10 02:38:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:29,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:29,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:29,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:38:29,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:29,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:38:29,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:29,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:38:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:38:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:29,929 INFO L87 Difference]: Start difference. First operand 686229 states and 1305779 transitions. Second operand 10 states.