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_spec2_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:20,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:20,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:20,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:20,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:20,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:20,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:20,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:20,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:20,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:20,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:20,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:20,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:20,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:20,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:20,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:20,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:20,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:20,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:20,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:20,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:20,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:20,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:20,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:20,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:20,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:20,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:20,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:20,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:20,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:20,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:20,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:20,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:20,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:20,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:20,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:20,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:20,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:20,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:20,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:20,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:20,888 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:31:20,914 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:20,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:20,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:20,915 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:20,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:20,916 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:20,917 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:20,917 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:20,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:20,917 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:20,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:20,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:20,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:20,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:20,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:20,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:20,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:20,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:20,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:20,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:20,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:20,924 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:20,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:20,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:20,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:20,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:20,925 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:20,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:20,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:20,926 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:20,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:21,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:21,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:21,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:21,006 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:21,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-09-10 02:31:21,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81d8d18c/3667b24c892046bb9d679ccfa297a52c/FLAG42c18a42c [2019-09-10 02:31:21,683 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:21,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-09-10 02:31:21,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81d8d18c/3667b24c892046bb9d679ccfa297a52c/FLAG42c18a42c [2019-09-10 02:31:21,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81d8d18c/3667b24c892046bb9d679ccfa297a52c [2019-09-10 02:31:21,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:21,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:21,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:21,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:21,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:21,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:21" (1/1) ... [2019-09-10 02:31:21,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f07c2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:21, skipping insertion in model container [2019-09-10 02:31:21,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:21" (1/1) ... [2019-09-10 02:31:21,893 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:21,964 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:22,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:22,660 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:22,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:22,840 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:22,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22 WrapperNode [2019-09-10 02:31:22,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:22,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:22,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:22,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:22,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:22,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:22,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:22,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:22,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:22,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:23,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (1/1) ... [2019-09-10 02:31:23,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:23,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:23,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:23,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:23,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (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:31:23,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:23,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:23,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:23,099 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:23,099 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:23,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:23,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:23,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:23,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:23,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:23,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:23,109 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:23,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:23,109 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:23,109 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:23,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:23,110 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:23,111 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:23,112 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:23,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:23,114 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:23,115 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:23,115 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:23,115 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:23,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:23,118 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:23,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:23,120 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:23,121 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:23,122 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:23,126 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:23,127 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:23,131 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:23,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:23,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:23,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:25,502 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:25,503 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:25,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:25 BoogieIcfgContainer [2019-09-10 02:31:25,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:25,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:25,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:25,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:25,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:21" (1/3) ... [2019-09-10 02:31:25,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea7c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:25, skipping insertion in model container [2019-09-10 02:31:25,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:22" (2/3) ... [2019-09-10 02:31:25,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea7c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:25, skipping insertion in model container [2019-09-10 02:31:25,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:25" (3/3) ... [2019-09-10 02:31:25,516 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2019-09-10 02:31:25,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:25,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:25,559 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:25,595 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:25,596 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:25,596 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:25,596 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:25,596 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:25,596 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:25,596 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:25,596 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-09-10 02:31:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 02:31:25,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:25,680 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] [2019-09-10 02:31:25,687 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash -943810912, now seen corresponding path program 1 times [2019-09-10 02:31:25,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:25,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:25,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:25,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:25,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:26,219 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:31:26,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:26,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:26,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:26,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:26,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:26,246 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 4 states. [2019-09-10 02:31:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:26,410 INFO L93 Difference]: Finished difference Result 588 states and 944 transitions. [2019-09-10 02:31:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:26,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 02:31:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:26,439 INFO L225 Difference]: With dead ends: 588 [2019-09-10 02:31:26,440 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:31:26,442 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:31:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:31:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-10 02:31:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:31:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 932 transitions. [2019-09-10 02:31:26,542 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 932 transitions. Word has length 107 [2019-09-10 02:31:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:26,542 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 932 transitions. [2019-09-10 02:31:26,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 932 transitions. [2019-09-10 02:31:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 02:31:26,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:26,550 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] [2019-09-10 02:31:26,551 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1793356700, now seen corresponding path program 1 times [2019-09-10 02:31:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:26,868 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:31:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:26,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:26,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:26,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:26,872 INFO L87 Difference]: Start difference. First operand 577 states and 932 transitions. Second operand 4 states. [2019-09-10 02:31:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:26,945 INFO L93 Difference]: Finished difference Result 579 states and 933 transitions. [2019-09-10 02:31:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:26,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 02:31:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:26,952 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:26,953 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:31:26,954 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:31:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:31:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-10 02:31:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:31:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 931 transitions. [2019-09-10 02:31:26,988 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 931 transitions. Word has length 110 [2019-09-10 02:31:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:26,988 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 931 transitions. [2019-09-10 02:31:26,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 931 transitions. [2019-09-10 02:31:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 02:31:26,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:26,994 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] [2019-09-10 02:31:26,994 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1568343631, now seen corresponding path program 1 times [2019-09-10 02:31:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:26,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:26,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,137 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:31:27,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,142 INFO L87 Difference]: Start difference. First operand 577 states and 931 transitions. Second operand 4 states. [2019-09-10 02:31:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,200 INFO L93 Difference]: Finished difference Result 579 states and 932 transitions. [2019-09-10 02:31:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 02:31:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,206 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:27,207 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:31:27,207 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:31:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:31:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-10 02:31:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:31:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 930 transitions. [2019-09-10 02:31:27,233 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 930 transitions. Word has length 111 [2019-09-10 02:31:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,233 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 930 transitions. [2019-09-10 02:31:27,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 930 transitions. [2019-09-10 02:31:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:31:27,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,238 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:31:27,238 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash 84938816, now seen corresponding path program 1 times [2019-09-10 02:31:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,359 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:31:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,362 INFO L87 Difference]: Start difference. First operand 577 states and 930 transitions. Second operand 4 states. [2019-09-10 02:31:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,420 INFO L93 Difference]: Finished difference Result 579 states and 931 transitions. [2019-09-10 02:31:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 02:31:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,426 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:27,427 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:31:27,427 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:31:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:31:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-10 02:31:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:31:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 929 transitions. [2019-09-10 02:31:27,459 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 929 transitions. Word has length 112 [2019-09-10 02:31:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,461 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 929 transitions. [2019-09-10 02:31:27,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 929 transitions. [2019-09-10 02:31:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:31:27,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,470 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:31:27,471 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1272870165, now seen corresponding path program 1 times [2019-09-10 02:31:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,673 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:31:27,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:27,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:27,675 INFO L87 Difference]: Start difference. First operand 577 states and 929 transitions. Second operand 4 states. [2019-09-10 02:31:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:27,719 INFO L93 Difference]: Finished difference Result 579 states and 930 transitions. [2019-09-10 02:31:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:27,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 02:31:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:27,725 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:31:27,726 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:31:27,726 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:31:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:31:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-10 02:31:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-10 02:31:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 928 transitions. [2019-09-10 02:31:27,752 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 928 transitions. Word has length 113 [2019-09-10 02:31:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:27,752 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 928 transitions. [2019-09-10 02:31:27,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 928 transitions. [2019-09-10 02:31:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:31:27,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:27,758 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:31:27,759 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1262791708, now seen corresponding path program 1 times [2019-09-10 02:31:27,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:27,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:27,961 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:31:27,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:27,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:27,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:27,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:27,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:27,963 INFO L87 Difference]: Start difference. First operand 577 states and 928 transitions. Second operand 10 states. [2019-09-10 02:31:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,130 INFO L93 Difference]: Finished difference Result 586 states and 939 transitions. [2019-09-10 02:31:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:28,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-09-10 02:31:28,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,138 INFO L225 Difference]: With dead ends: 586 [2019-09-10 02:31:28,139 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:31:28,140 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:31:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:31:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-09-10 02:31:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-10 02:31:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 937 transitions. [2019-09-10 02:31:28,178 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 937 transitions. Word has length 114 [2019-09-10 02:31:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,179 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 937 transitions. [2019-09-10 02:31:28,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 937 transitions. [2019-09-10 02:31:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:31:28,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,188 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:31:28,189 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1682308539, now seen corresponding path program 1 times [2019-09-10 02:31:28,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,306 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:31:28,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:28,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:28,308 INFO L87 Difference]: Start difference. First operand 584 states and 937 transitions. Second operand 4 states. [2019-09-10 02:31:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,354 INFO L93 Difference]: Finished difference Result 582 states and 932 transitions. [2019-09-10 02:31:28,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:28,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 02:31:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,359 INFO L225 Difference]: With dead ends: 582 [2019-09-10 02:31:28,360 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:31:28,360 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:31:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:31:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:31:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:31:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 914 transitions. [2019-09-10 02:31:28,379 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 914 transitions. Word has length 114 [2019-09-10 02:31:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,380 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 914 transitions. [2019-09-10 02:31:28,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 914 transitions. [2019-09-10 02:31:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:31:28,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,384 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:31:28,384 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash 441821781, now seen corresponding path program 1 times [2019-09-10 02:31:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:28,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:28,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:28,520 INFO L87 Difference]: Start difference. First operand 571 states and 914 transitions. Second operand 6 states. [2019-09-10 02:31:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:28,791 INFO L93 Difference]: Finished difference Result 574 states and 917 transitions. [2019-09-10 02:31:28,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:28,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-10 02:31:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:28,796 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:31:28,796 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:31:28,797 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:31:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:31:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:31:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:31:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 910 transitions. [2019-09-10 02:31:28,818 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 910 transitions. Word has length 115 [2019-09-10 02:31:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:28,820 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 910 transitions. [2019-09-10 02:31:28,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 910 transitions. [2019-09-10 02:31:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:31:28,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,825 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:31:28,825 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash 766133599, now seen corresponding path program 1 times [2019-09-10 02:31:28,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:28,973 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:31:28,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:28,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:28,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:28,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:28,975 INFO L87 Difference]: Start difference. First operand 571 states and 910 transitions. Second operand 6 states. [2019-09-10 02:31:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,194 INFO L93 Difference]: Finished difference Result 574 states and 913 transitions. [2019-09-10 02:31:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:29,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-09-10 02:31:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,199 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:31:29,199 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:31:29,200 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:31:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:31:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:31:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:31:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 906 transitions. [2019-09-10 02:31:29,222 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 906 transitions. Word has length 116 [2019-09-10 02:31:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,222 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 906 transitions. [2019-09-10 02:31:29,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 906 transitions. [2019-09-10 02:31:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:31:29,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,226 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:31:29,229 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash -188511270, now seen corresponding path program 1 times [2019-09-10 02:31:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,367 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:31:29,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:29,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:29,369 INFO L87 Difference]: Start difference. First operand 571 states and 906 transitions. Second operand 6 states. [2019-09-10 02:31:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,551 INFO L93 Difference]: Finished difference Result 574 states and 909 transitions. [2019-09-10 02:31:29,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:29,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-10 02:31:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,556 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:31:29,556 INFO L226 Difference]: Without dead ends: 571 [2019-09-10 02:31:29,557 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:31:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-10 02:31:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-10 02:31:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-10 02:31:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 902 transitions. [2019-09-10 02:31:29,576 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 902 transitions. Word has length 117 [2019-09-10 02:31:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,576 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 902 transitions. [2019-09-10 02:31:29,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 902 transitions. [2019-09-10 02:31:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:31:29,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,580 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:31:29,580 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 266348634, now seen corresponding path program 1 times [2019-09-10 02:31:29,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,708 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:31:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:29,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:29,710 INFO L87 Difference]: Start difference. First operand 571 states and 902 transitions. Second operand 7 states. [2019-09-10 02:31:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,778 INFO L93 Difference]: Finished difference Result 574 states and 905 transitions. [2019-09-10 02:31:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:29,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-09-10 02:31:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,783 INFO L225 Difference]: With dead ends: 574 [2019-09-10 02:31:29,783 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 02:31:29,784 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:31:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 02:31:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-09-10 02:31:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-10 02:31:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 868 transitions. [2019-09-10 02:31:29,801 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 868 transitions. Word has length 117 [2019-09-10 02:31:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,801 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 868 transitions. [2019-09-10 02:31:29,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 868 transitions. [2019-09-10 02:31:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:31:29,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,805 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:31:29,806 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2136107772, now seen corresponding path program 1 times [2019-09-10 02:31:29,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,963 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:31:29,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:29,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:29,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:29,966 INFO L87 Difference]: Start difference. First operand 550 states and 868 transitions. Second operand 6 states. [2019-09-10 02:31:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,073 INFO L93 Difference]: Finished difference Result 553 states and 871 transitions. [2019-09-10 02:31:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 02:31:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,078 INFO L225 Difference]: With dead ends: 553 [2019-09-10 02:31:30,079 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 02:31:30,079 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:31:30,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 02:31:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-09-10 02:31:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-10 02:31:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 867 transitions. [2019-09-10 02:31:30,095 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 867 transitions. Word has length 118 [2019-09-10 02:31:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,096 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 867 transitions. [2019-09-10 02:31:30,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 867 transitions. [2019-09-10 02:31:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:31:30,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,100 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:31:30,100 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash -505466529, now seen corresponding path program 1 times [2019-09-10 02:31:30,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,262 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:31:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:30,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:30,264 INFO L87 Difference]: Start difference. First operand 550 states and 867 transitions. Second operand 6 states. [2019-09-10 02:31:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,345 INFO L93 Difference]: Finished difference Result 553 states and 870 transitions. [2019-09-10 02:31:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:30,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 02:31:30,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,350 INFO L225 Difference]: With dead ends: 553 [2019-09-10 02:31:30,350 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 02:31:30,351 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:31:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 02:31:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-09-10 02:31:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-10 02:31:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2019-09-10 02:31:30,367 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 119 [2019-09-10 02:31:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,368 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2019-09-10 02:31:30,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2019-09-10 02:31:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:31:30,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,372 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:31:30,372 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -585955541, now seen corresponding path program 1 times [2019-09-10 02:31:30,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,479 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:31:30,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:30,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:30,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:30,481 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand 4 states. [2019-09-10 02:31:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,531 INFO L93 Difference]: Finished difference Result 553 states and 869 transitions. [2019-09-10 02:31:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:30,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-10 02:31:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,539 INFO L225 Difference]: With dead ends: 553 [2019-09-10 02:31:30,539 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 02:31:30,539 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:31:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 02:31:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-09-10 02:31:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-10 02:31:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 865 transitions. [2019-09-10 02:31:30,559 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 865 transitions. Word has length 120 [2019-09-10 02:31:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,560 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 865 transitions. [2019-09-10 02:31:30,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 865 transitions. [2019-09-10 02:31:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:31:30,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,565 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:31:30,565 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,566 INFO L82 PathProgramCache]: Analyzing trace with hash 381395113, now seen corresponding path program 1 times [2019-09-10 02:31:30,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,747 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:31:30,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:30,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:30,749 INFO L87 Difference]: Start difference. First operand 550 states and 865 transitions. Second operand 12 states. [2019-09-10 02:31:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,918 INFO L93 Difference]: Finished difference Result 554 states and 868 transitions. [2019-09-10 02:31:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:30,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-09-10 02:31:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,924 INFO L225 Difference]: With dead ends: 554 [2019-09-10 02:31:30,924 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 02:31:30,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:31:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 02:31:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-09-10 02:31:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-09-10 02:31:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 864 transitions. [2019-09-10 02:31:30,941 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 864 transitions. Word has length 120 [2019-09-10 02:31:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,941 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 864 transitions. [2019-09-10 02:31:30,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 864 transitions. [2019-09-10 02:31:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:31:30,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,945 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:31:30,945 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1579499078, now seen corresponding path program 1 times [2019-09-10 02:31:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:31,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:31,145 INFO L87 Difference]: Start difference. First operand 550 states and 864 transitions. Second operand 9 states. [2019-09-10 02:31:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:34,739 INFO L93 Difference]: Finished difference Result 556 states and 885 transitions. [2019-09-10 02:31:34,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:31:34,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 02:31:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:34,745 INFO L225 Difference]: With dead ends: 556 [2019-09-10 02:31:34,745 INFO L226 Difference]: Without dead ends: 556 [2019-09-10 02:31:34,746 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:31:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-10 02:31:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-09-10 02:31:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-10 02:31:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 883 transitions. [2019-09-10 02:31:34,776 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 883 transitions. Word has length 121 [2019-09-10 02:31:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:34,776 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 883 transitions. [2019-09-10 02:31:34,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 883 transitions. [2019-09-10 02:31:34,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:31:34,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:34,781 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:31:34,782 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1625636341, now seen corresponding path program 1 times [2019-09-10 02:31:34,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:34,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:34,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:34,941 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:31:34,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:34,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:31:34,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:34,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:31:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:31:34,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:34,943 INFO L87 Difference]: Start difference. First operand 554 states and 883 transitions. Second operand 8 states. [2019-09-10 02:31:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:41,082 INFO L93 Difference]: Finished difference Result 1454 states and 2333 transitions. [2019-09-10 02:31:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:31:41,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-10 02:31:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:41,094 INFO L225 Difference]: With dead ends: 1454 [2019-09-10 02:31:41,094 INFO L226 Difference]: Without dead ends: 1454 [2019-09-10 02:31:41,095 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:31:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-09-10 02:31:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1415. [2019-09-10 02:31:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-09-10 02:31:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2280 transitions. [2019-09-10 02:31:41,145 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2280 transitions. Word has length 122 [2019-09-10 02:31:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:41,145 INFO L475 AbstractCegarLoop]: Abstraction has 1415 states and 2280 transitions. [2019-09-10 02:31:41,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:31:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2280 transitions. [2019-09-10 02:31:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:41,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:41,148 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] [2019-09-10 02:31:41,149 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -430074642, now seen corresponding path program 1 times [2019-09-10 02:31:41,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:41,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:41,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:41,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:41,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:41,282 INFO L87 Difference]: Start difference. First operand 1415 states and 2280 transitions. Second operand 9 states. [2019-09-10 02:31:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,506 INFO L93 Difference]: Finished difference Result 3197 states and 5266 transitions. [2019-09-10 02:31:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:31:48,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 02:31:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,528 INFO L225 Difference]: With dead ends: 3197 [2019-09-10 02:31:48,528 INFO L226 Difference]: Without dead ends: 3197 [2019-09-10 02:31:48,529 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:31:48,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2019-09-10 02:31:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2974. [2019-09-10 02:31:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-09-10 02:31:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4851 transitions. [2019-09-10 02:31:48,633 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4851 transitions. Word has length 128 [2019-09-10 02:31:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,634 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4851 transitions. [2019-09-10 02:31:48,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4851 transitions. [2019-09-10 02:31:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:48,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:48,637 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] [2019-09-10 02:31:48,637 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:48,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -437834001, now seen corresponding path program 1 times [2019-09-10 02:31:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:48,759 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:31:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:48,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:48,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:48,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:48,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:48,762 INFO L87 Difference]: Start difference. First operand 2974 states and 4851 transitions. Second operand 7 states. [2019-09-10 02:31:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:53,591 INFO L93 Difference]: Finished difference Result 5510 states and 9071 transitions. [2019-09-10 02:31:53,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:31:53,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-09-10 02:31:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:53,637 INFO L225 Difference]: With dead ends: 5510 [2019-09-10 02:31:53,638 INFO L226 Difference]: Without dead ends: 5510 [2019-09-10 02:31:53,639 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:31:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-09-10 02:31:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 5417. [2019-09-10 02:31:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-09-10 02:31:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8909 transitions. [2019-09-10 02:31:53,880 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8909 transitions. Word has length 128 [2019-09-10 02:31:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:53,881 INFO L475 AbstractCegarLoop]: Abstraction has 5417 states and 8909 transitions. [2019-09-10 02:31:53,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8909 transitions. [2019-09-10 02:31:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:53,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:53,885 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] [2019-09-10 02:31:53,885 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -630018540, now seen corresponding path program 1 times [2019-09-10 02:31:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:53,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:54,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:54,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:31:54,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:54,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:31:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:31:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:54,063 INFO L87 Difference]: Start difference. First operand 5417 states and 8909 transitions. Second operand 5 states. [2019-09-10 02:31:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:54,156 INFO L93 Difference]: Finished difference Result 5535 states and 9085 transitions. [2019-09-10 02:31:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:31:54,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 02:31:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:54,198 INFO L225 Difference]: With dead ends: 5535 [2019-09-10 02:31:54,198 INFO L226 Difference]: Without dead ends: 5535 [2019-09-10 02:31:54,199 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:31:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-09-10 02:31:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5469. [2019-09-10 02:31:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-09-10 02:31:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8982 transitions. [2019-09-10 02:31:54,383 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8982 transitions. Word has length 133 [2019-09-10 02:31:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:54,385 INFO L475 AbstractCegarLoop]: Abstraction has 5469 states and 8982 transitions. [2019-09-10 02:31:54,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:31:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8982 transitions. [2019-09-10 02:31:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:54,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:54,389 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] [2019-09-10 02:31:54,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1275605709, now seen corresponding path program 1 times [2019-09-10 02:31:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:54,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:54,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:54,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:54,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:54,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:54,532 INFO L87 Difference]: Start difference. First operand 5469 states and 8982 transitions. Second operand 7 states. [2019-09-10 02:31:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:54,730 INFO L93 Difference]: Finished difference Result 5949 states and 9740 transitions. [2019-09-10 02:31:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:54,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-09-10 02:31:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:54,778 INFO L225 Difference]: With dead ends: 5949 [2019-09-10 02:31:54,778 INFO L226 Difference]: Without dead ends: 5469 [2019-09-10 02:31:54,779 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:31:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-09-10 02:31:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2019-09-10 02:31:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-09-10 02:31:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8890 transitions. [2019-09-10 02:31:54,929 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8890 transitions. Word has length 140 [2019-09-10 02:31:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:54,929 INFO L475 AbstractCegarLoop]: Abstraction has 5469 states and 8890 transitions. [2019-09-10 02:31:54,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8890 transitions. [2019-09-10 02:31:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:31:54,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:54,935 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] [2019-09-10 02:31:54,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1809403985, now seen corresponding path program 1 times [2019-09-10 02:31:54,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:54,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:54,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:55,086 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:31:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:55,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:55,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:55,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:55,088 INFO L87 Difference]: Start difference. First operand 5469 states and 8890 transitions. Second operand 7 states. [2019-09-10 02:31:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:59,541 INFO L93 Difference]: Finished difference Result 5816 states and 9384 transitions. [2019-09-10 02:31:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:31:59,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-10 02:31:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:59,574 INFO L225 Difference]: With dead ends: 5816 [2019-09-10 02:31:59,574 INFO L226 Difference]: Without dead ends: 5816 [2019-09-10 02:31:59,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:31:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2019-09-10 02:31:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5701. [2019-09-10 02:31:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-09-10 02:31:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9204 transitions. [2019-09-10 02:31:59,740 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9204 transitions. Word has length 145 [2019-09-10 02:31:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:59,740 INFO L475 AbstractCegarLoop]: Abstraction has 5701 states and 9204 transitions. [2019-09-10 02:31:59,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9204 transitions. [2019-09-10 02:31:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:31:59,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:59,745 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:31:59,746 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:59,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1339148831, now seen corresponding path program 1 times [2019-09-10 02:31:59,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:59,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:59,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:59,943 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:31:59,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:59,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:31:59,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:59,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:31:59,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:31:59,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:31:59,945 INFO L87 Difference]: Start difference. First operand 5701 states and 9204 transitions. Second operand 11 states. [2019-09-10 02:32:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:07,440 INFO L93 Difference]: Finished difference Result 7022 states and 11158 transitions. [2019-09-10 02:32:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:32:07,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 02:32:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:07,475 INFO L225 Difference]: With dead ends: 7022 [2019-09-10 02:32:07,476 INFO L226 Difference]: Without dead ends: 7010 [2019-09-10 02:32:07,476 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:32:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7010 states. [2019-09-10 02:32:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7010 to 6861. [2019-09-10 02:32:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6861 states. [2019-09-10 02:32:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6861 states to 6861 states and 10896 transitions. [2019-09-10 02:32:07,658 INFO L78 Accepts]: Start accepts. Automaton has 6861 states and 10896 transitions. Word has length 152 [2019-09-10 02:32:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:07,658 INFO L475 AbstractCegarLoop]: Abstraction has 6861 states and 10896 transitions. [2019-09-10 02:32:07,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:32:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 6861 states and 10896 transitions. [2019-09-10 02:32:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 02:32:07,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:07,663 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] [2019-09-10 02:32:07,663 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash 364131353, now seen corresponding path program 1 times [2019-09-10 02:32:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:07,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:07,790 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:32:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:07,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:07,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:07,794 INFO L87 Difference]: Start difference. First operand 6861 states and 10896 transitions. Second operand 4 states. [2019-09-10 02:32:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:09,641 INFO L93 Difference]: Finished difference Result 14665 states and 24105 transitions. [2019-09-10 02:32:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:09,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-10 02:32:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:09,717 INFO L225 Difference]: With dead ends: 14665 [2019-09-10 02:32:09,717 INFO L226 Difference]: Without dead ends: 14665 [2019-09-10 02:32:09,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:32:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14665 states. [2019-09-10 02:32:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14665 to 14511. [2019-09-10 02:32:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14511 states. [2019-09-10 02:32:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14511 states to 14511 states and 23738 transitions. [2019-09-10 02:32:10,124 INFO L78 Accepts]: Start accepts. Automaton has 14511 states and 23738 transitions. Word has length 150 [2019-09-10 02:32:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,124 INFO L475 AbstractCegarLoop]: Abstraction has 14511 states and 23738 transitions. [2019-09-10 02:32:10,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 14511 states and 23738 transitions. [2019-09-10 02:32:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:32:10,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,130 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] [2019-09-10 02:32:10,130 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1598112018, now seen corresponding path program 1 times [2019-09-10 02:32:10,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:10,231 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:32:10,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:10,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:10,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:10,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:10,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:10,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:10,232 INFO L87 Difference]: Start difference. First operand 14511 states and 23738 transitions. Second operand 4 states. [2019-09-10 02:32:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:12,834 INFO L93 Difference]: Finished difference Result 31647 states and 55138 transitions. [2019-09-10 02:32:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:12,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-10 02:32:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:13,020 INFO L225 Difference]: With dead ends: 31647 [2019-09-10 02:32:13,020 INFO L226 Difference]: Without dead ends: 31647 [2019-09-10 02:32:13,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:32:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31647 states. [2019-09-10 02:32:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31647 to 31300. [2019-09-10 02:32:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31300 states. [2019-09-10 02:32:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31300 states to 31300 states and 53880 transitions. [2019-09-10 02:32:13,981 INFO L78 Accepts]: Start accepts. Automaton has 31300 states and 53880 transitions. Word has length 151 [2019-09-10 02:32:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:13,981 INFO L475 AbstractCegarLoop]: Abstraction has 31300 states and 53880 transitions. [2019-09-10 02:32:13,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31300 states and 53880 transitions. [2019-09-10 02:32:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:32:13,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:13,989 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:32:13,989 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1965149282, now seen corresponding path program 1 times [2019-09-10 02:32:13,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:13,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,088 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:32:14,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:14,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:14,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:14,090 INFO L87 Difference]: Start difference. First operand 31300 states and 53880 transitions. Second operand 4 states. [2019-09-10 02:32:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:17,190 INFO L93 Difference]: Finished difference Result 69787 states and 134056 transitions. [2019-09-10 02:32:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:17,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 02:32:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:17,709 INFO L225 Difference]: With dead ends: 69787 [2019-09-10 02:32:17,710 INFO L226 Difference]: Without dead ends: 69787 [2019-09-10 02:32:17,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:32:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69787 states. [2019-09-10 02:32:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69787 to 68975. [2019-09-10 02:32:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68975 states. [2019-09-10 02:32:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68975 states to 68975 states and 129129 transitions. [2019-09-10 02:32:21,741 INFO L78 Accepts]: Start accepts. Automaton has 68975 states and 129129 transitions. Word has length 154 [2019-09-10 02:32:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:21,741 INFO L475 AbstractCegarLoop]: Abstraction has 68975 states and 129129 transitions. [2019-09-10 02:32:21,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 68975 states and 129129 transitions. [2019-09-10 02:32:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:32:21,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:21,749 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:32:21,750 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1771745232, now seen corresponding path program 1 times [2019-09-10 02:32:21,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:21,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:21,851 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:32:21,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:21,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:21,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:21,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:21,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:21,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:21,853 INFO L87 Difference]: Start difference. First operand 68975 states and 129129 transitions. Second operand 4 states. [2019-09-10 02:32:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:27,465 INFO L93 Difference]: Finished difference Result 157619 states and 353842 transitions. [2019-09-10 02:32:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:27,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-10 02:32:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:29,241 INFO L225 Difference]: With dead ends: 157619 [2019-09-10 02:32:29,241 INFO L226 Difference]: Without dead ends: 157619 [2019-09-10 02:32:29,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:32:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157619 states. [2019-09-10 02:32:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157619 to 155638. [2019-09-10 02:32:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155638 states. [2019-09-10 02:32:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155638 states to 155638 states and 332554 transitions. [2019-09-10 02:32:40,120 INFO L78 Accepts]: Start accepts. Automaton has 155638 states and 332554 transitions. Word has length 153 [2019-09-10 02:32:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:40,120 INFO L475 AbstractCegarLoop]: Abstraction has 155638 states and 332554 transitions. [2019-09-10 02:32:40,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 155638 states and 332554 transitions. [2019-09-10 02:32:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:32:40,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:40,130 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:32:40,130 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1317922684, now seen corresponding path program 1 times [2019-09-10 02:32:40,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:40,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:40,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:40,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:40,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:40,247 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:32:40,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:40,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:40,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:40,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:40,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:40,249 INFO L87 Difference]: Start difference. First operand 155638 states and 332554 transitions. Second operand 4 states. [2019-09-10 02:32:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:54,458 INFO L93 Difference]: Finished difference Result 365219 states and 1036491 transitions. [2019-09-10 02:32:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:54,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-10 02:32:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:58,788 INFO L225 Difference]: With dead ends: 365219 [2019-09-10 02:32:58,788 INFO L226 Difference]: Without dead ends: 365207 [2019-09-10 02:32:58,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:32:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365207 states. [2019-09-10 02:33:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365207 to 360171. [2019-09-10 02:33:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360171 states. [2019-09-10 02:33:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360171 states to 360171 states and 938567 transitions. [2019-09-10 02:33:45,261 INFO L78 Accepts]: Start accepts. Automaton has 360171 states and 938567 transitions. Word has length 156 [2019-09-10 02:33:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:45,261 INFO L475 AbstractCegarLoop]: Abstraction has 360171 states and 938567 transitions. [2019-09-10 02:33:45,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:33:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 360171 states and 938567 transitions. [2019-09-10 02:33:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:33:45,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:45,298 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:45,298 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1441985012, now seen corresponding path program 1 times [2019-09-10 02:33:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:45,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:45,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 02:33:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:45,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:33:45,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:45,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:33:45,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:33:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:33:45,434 INFO L87 Difference]: Start difference. First operand 360171 states and 938567 transitions. Second operand 5 states. [2019-09-10 02:34:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:02,186 INFO L93 Difference]: Finished difference Result 361771 states and 942047 transitions. [2019-09-10 02:34:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:34:02,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-10 02:34:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:05,281 INFO L225 Difference]: With dead ends: 361771 [2019-09-10 02:34:05,281 INFO L226 Difference]: Without dead ends: 361771 [2019-09-10 02:34:05,282 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:34:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361771 states. [2019-09-10 02:34:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361771 to 361451. [2019-09-10 02:34:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361451 states. [2019-09-10 02:34:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361451 states to 361451 states and 939975 transitions. [2019-09-10 02:34:39,489 INFO L78 Accepts]: Start accepts. Automaton has 361451 states and 939975 transitions. Word has length 212 [2019-09-10 02:34:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:39,490 INFO L475 AbstractCegarLoop]: Abstraction has 361451 states and 939975 transitions. [2019-09-10 02:34:39,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:34:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 361451 states and 939975 transitions. [2019-09-10 02:34:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 02:34:39,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:39,513 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,513 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:39,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash -507768394, now seen corresponding path program 1 times [2019-09-10 02:34:39,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:39,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:39,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-10 02:34:39,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:39,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:34:39,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:39,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:34:39,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:34:39,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:34:39,674 INFO L87 Difference]: Start difference. First operand 361451 states and 939975 transitions. Second operand 8 states. [2019-09-10 02:35:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:06,717 INFO L93 Difference]: Finished difference Result 546150 states and 1517298 transitions. [2019-09-10 02:35:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:35:06,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-10 02:35:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:20,536 INFO L225 Difference]: With dead ends: 546150 [2019-09-10 02:35:20,536 INFO L226 Difference]: Without dead ends: 546142 [2019-09-10 02:35:20,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546142 states. [2019-09-10 02:35:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546142 to 544867. [2019-09-10 02:35:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544867 states.