java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:35:13,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:35:13,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:35:13,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:35:13,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:35:13,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:35:13,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:35:13,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:35:13,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:35:13,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:35:13,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:35:13,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:35:13,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:35:13,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:35:13,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:35:13,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:35:13,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:35:13,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:35:13,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:35:13,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:35:13,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:35:13,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:35:13,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:35:13,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:35:13,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:35:13,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:35:13,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:35:13,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:35:13,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:35:13,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:35:13,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:35:13,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:35:13,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:35:13,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:35:13,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:35:13,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:35:13,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:35:13,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:35:13,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:35:13,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:35:13,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:35:13,750 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:35:13,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:35:13,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:35:13,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:35:13,769 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:35:13,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:35:13,771 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:35:13,771 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:35:13,771 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:35:13,771 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:35:13,772 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:35:13,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:35:13,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:35:13,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:35:13,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:35:13,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:35:13,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:35:13,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:35:13,775 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:35:13,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:35:13,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:35:13,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:35:13,776 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:35:13,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:35:13,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:35:13,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:35:13,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:35:13,777 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:35:13,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:35:13,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:35:13,778 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:35:13,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:35:13,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:35:13,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:35:13,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:35:13,831 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:35:13,832 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-09-10 02:35:13,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c14ec2/01ce318391ba4ed5bffbac694d68f3b1/FLAG8f88e1c92 [2019-09-10 02:35:14,504 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:35:14,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-09-10 02:35:14,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c14ec2/01ce318391ba4ed5bffbac694d68f3b1/FLAG8f88e1c92 [2019-09-10 02:35:14,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c14ec2/01ce318391ba4ed5bffbac694d68f3b1 [2019-09-10 02:35:14,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:35:14,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:35:14,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:14,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:35:14,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:35:14,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:14" (1/1) ... [2019-09-10 02:35:14,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd373d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:14, skipping insertion in model container [2019-09-10 02:35:14,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:35:14" (1/1) ... [2019-09-10 02:35:14,753 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:35:14,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:35:15,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:15,501 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:35:15,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:35:15,743 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:35:15,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15 WrapperNode [2019-09-10 02:35:15,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:35:15,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:35:15,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:35:15,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:35:15,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (1/1) ... [2019-09-10 02:35:15,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:35:15,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:35:15,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:35:15,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:35:15,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (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:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:35:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:35:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:35:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:35:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:35:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:35:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:35:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:35:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:35:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:35:15,988 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:15,989 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:35:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:35:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:35:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:35:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:35:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:35:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:35:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:35:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:35:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:35:15,991 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:15,992 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:35:15,993 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:35:15,993 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-10 02:35:15,993 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:35:15,993 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-10 02:35:15,993 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:15,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:35:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:35:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:35:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:35:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:35:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:35:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:35:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:35:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:35:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:35:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:35:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:35:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:35:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:35:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:35:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:35:16,003 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:35:16,003 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:35:16,003 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:35:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:35:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:35:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:35:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:35:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:35:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:35:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:35:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:35:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:35:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:35:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:35:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:35:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:35:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:35:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:35:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:35:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:35:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:35:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:35:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:35:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:35:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:35:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:35:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-10 02:35:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:35:16,012 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:35:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:35:16,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:35:16,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:35:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:35:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:35:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:35:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:35:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:35:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:35:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:35:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:35:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:35:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:35:16,027 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:35:16,028 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:35:16,029 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:35:16,030 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:35:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:35:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:35:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:35:18,130 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:35:18,130 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:35:18,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:18 BoogieIcfgContainer [2019-09-10 02:35:18,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:35:18,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:35:18,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:35:18,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:35:18,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:35:14" (1/3) ... [2019-09-10 02:35:18,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6947a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:18, skipping insertion in model container [2019-09-10 02:35:18,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:35:15" (2/3) ... [2019-09-10 02:35:18,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6947a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:35:18, skipping insertion in model container [2019-09-10 02:35:18,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:35:18" (3/3) ... [2019-09-10 02:35:18,140 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2019-09-10 02:35:18,149 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:35:18,158 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:35:18,174 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:35:18,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:35:18,201 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:35:18,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:35:18,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:35:18,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:35:18,201 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:35:18,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:35:18,202 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:35:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states. [2019-09-10 02:35:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:35:18,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:18,250 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] [2019-09-10 02:35:18,253 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash 961296188, now seen corresponding path program 1 times [2019-09-10 02:35:18,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:18,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:18,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:18,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:18,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:18,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:18,847 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 4 states. [2019-09-10 02:35:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:19,023 INFO L93 Difference]: Finished difference Result 637 states and 1006 transitions. [2019-09-10 02:35:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:19,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 02:35:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:19,057 INFO L225 Difference]: With dead ends: 637 [2019-09-10 02:35:19,057 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:35:19,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:35:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:35:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:35:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-09-10 02:35:19,159 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 87 [2019-09-10 02:35:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:19,160 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-09-10 02:35:19,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-09-10 02:35:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:35:19,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:19,166 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] [2019-09-10 02:35:19,202 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1704388894, now seen corresponding path program 1 times [2019-09-10 02:35:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:19,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:19,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:19,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:19,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:19,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:19,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:19,415 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-09-10 02:35:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:19,485 INFO L93 Difference]: Finished difference Result 628 states and 995 transitions. [2019-09-10 02:35:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:19,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:35:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:19,492 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:35:19,492 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:35:19,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:35:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:35:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:35:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-09-10 02:35:19,526 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 90 [2019-09-10 02:35:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:19,526 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-09-10 02:35:19,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-09-10 02:35:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:35:19,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:19,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:19,533 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1677160523, now seen corresponding path program 1 times [2019-09-10 02:35:19,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:19,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:19,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:19,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:19,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:19,653 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-09-10 02:35:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:19,732 INFO L93 Difference]: Finished difference Result 628 states and 994 transitions. [2019-09-10 02:35:19,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:19,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:35:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:19,738 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:35:19,738 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:35:19,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:35:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:35:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:35:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-09-10 02:35:19,767 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 91 [2019-09-10 02:35:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:19,769 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-09-10 02:35:19,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-09-10 02:35:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:35:19,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:19,771 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] [2019-09-10 02:35:19,772 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1700539194, now seen corresponding path program 1 times [2019-09-10 02:35:19,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:19,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:19,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:19,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:19,954 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 4 states. [2019-09-10 02:35:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:20,002 INFO L93 Difference]: Finished difference Result 628 states and 993 transitions. [2019-09-10 02:35:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:20,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:35:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:20,008 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:35:20,008 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:35:20,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:35:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:35:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:35:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-09-10 02:35:20,032 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-09-10 02:35:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:20,033 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-09-10 02:35:20,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-09-10 02:35:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:35:20,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:20,035 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] [2019-09-10 02:35:20,035 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1002231129, now seen corresponding path program 1 times [2019-09-10 02:35:20,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:20,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:20,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:20,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:20,203 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-09-10 02:35:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:20,249 INFO L93 Difference]: Finished difference Result 628 states and 992 transitions. [2019-09-10 02:35:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:20,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 02:35:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:20,255 INFO L225 Difference]: With dead ends: 628 [2019-09-10 02:35:20,255 INFO L226 Difference]: Without dead ends: 626 [2019-09-10 02:35:20,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-10 02:35:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-10 02:35:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 02:35:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 990 transitions. [2019-09-10 02:35:20,276 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 990 transitions. Word has length 93 [2019-09-10 02:35:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:20,276 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 990 transitions. [2019-09-10 02:35:20,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 990 transitions. [2019-09-10 02:35:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:35:20,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:20,278 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] [2019-09-10 02:35:20,278 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1978692950, now seen corresponding path program 1 times [2019-09-10 02:35:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:20,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:20,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:20,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:20,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:20,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:20,438 INFO L87 Difference]: Start difference. First operand 626 states and 990 transitions. Second operand 10 states. [2019-09-10 02:35:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:20,595 INFO L93 Difference]: Finished difference Result 635 states and 1001 transitions. [2019-09-10 02:35:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:35:20,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 02:35:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:20,601 INFO L225 Difference]: With dead ends: 635 [2019-09-10 02:35:20,601 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:35:20,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:20,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:35:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-10 02:35:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-10 02:35:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 999 transitions. [2019-09-10 02:35:20,636 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 999 transitions. Word has length 94 [2019-09-10 02:35:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:20,637 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 999 transitions. [2019-09-10 02:35:20,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 999 transitions. [2019-09-10 02:35:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:35:20,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:20,641 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] [2019-09-10 02:35:20,642 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash 48073845, now seen corresponding path program 1 times [2019-09-10 02:35:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:20,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:20,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:35:20,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:20,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:35:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:35:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:35:20,748 INFO L87 Difference]: Start difference. First operand 633 states and 999 transitions. Second operand 4 states. [2019-09-10 02:35:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:20,797 INFO L93 Difference]: Finished difference Result 631 states and 994 transitions. [2019-09-10 02:35:20,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:35:20,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-10 02:35:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:20,805 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:35:20,805 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:20,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 976 transitions. [2019-09-10 02:35:20,833 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 976 transitions. Word has length 94 [2019-09-10 02:35:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:20,833 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 976 transitions. [2019-09-10 02:35:20,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:35:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 976 transitions. [2019-09-10 02:35:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:35:20,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:20,838 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] [2019-09-10 02:35:20,839 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1242574475, now seen corresponding path program 1 times [2019-09-10 02:35:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:20,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:21,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:21,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:21,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:21,012 INFO L87 Difference]: Start difference. First operand 620 states and 976 transitions. Second operand 6 states. [2019-09-10 02:35:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:21,301 INFO L93 Difference]: Finished difference Result 623 states and 979 transitions. [2019-09-10 02:35:21,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:21,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:35:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:21,307 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:35:21,307 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:21,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 972 transitions. [2019-09-10 02:35:21,329 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 972 transitions. Word has length 95 [2019-09-10 02:35:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:21,330 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 972 transitions. [2019-09-10 02:35:21,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 972 transitions. [2019-09-10 02:35:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:35:21,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:21,332 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] [2019-09-10 02:35:21,332 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash 96991961, now seen corresponding path program 1 times [2019-09-10 02:35:21,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:21,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:21,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:21,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:21,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:21,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:21,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:21,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:21,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:21,459 INFO L87 Difference]: Start difference. First operand 620 states and 972 transitions. Second operand 6 states. [2019-09-10 02:35:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:21,662 INFO L93 Difference]: Finished difference Result 623 states and 975 transitions. [2019-09-10 02:35:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:21,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:35:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:21,668 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:35:21,668 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:21,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 968 transitions. [2019-09-10 02:35:21,689 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 968 transitions. Word has length 96 [2019-09-10 02:35:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:21,689 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 968 transitions. [2019-09-10 02:35:21,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 968 transitions. [2019-09-10 02:35:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:35:21,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:21,691 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] [2019-09-10 02:35:21,691 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash 44864186, now seen corresponding path program 1 times [2019-09-10 02:35:21,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:21,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:21,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:21,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:21,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:21,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:21,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:21,813 INFO L87 Difference]: Start difference. First operand 620 states and 968 transitions. Second operand 6 states. [2019-09-10 02:35:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:21,981 INFO L93 Difference]: Finished difference Result 623 states and 971 transitions. [2019-09-10 02:35:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:21,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:35:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:21,987 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:35:21,987 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 02:35:21,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 02:35:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-10 02:35:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:35:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 964 transitions. [2019-09-10 02:35:22,008 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 964 transitions. Word has length 97 [2019-09-10 02:35:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:22,008 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 964 transitions. [2019-09-10 02:35:22,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 964 transitions. [2019-09-10 02:35:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:35:22,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:22,010 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] [2019-09-10 02:35:22,010 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2010410810, now seen corresponding path program 1 times [2019-09-10 02:35:22,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:22,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:22,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:22,125 INFO L87 Difference]: Start difference. First operand 620 states and 964 transitions. Second operand 7 states. [2019-09-10 02:35:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:22,231 INFO L93 Difference]: Finished difference Result 623 states and 967 transitions. [2019-09-10 02:35:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:22,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 02:35:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:22,236 INFO L225 Difference]: With dead ends: 623 [2019-09-10 02:35:22,236 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:35:22,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:35:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:35:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:35:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-09-10 02:35:22,256 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 97 [2019-09-10 02:35:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:22,257 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-09-10 02:35:22,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-09-10 02:35:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:35:22,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:22,259 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] [2019-09-10 02:35:22,259 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash -200111170, now seen corresponding path program 1 times [2019-09-10 02:35:22,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:22,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:22,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:22,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:22,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:22,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:22,366 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 6 states. [2019-09-10 02:35:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:22,451 INFO L93 Difference]: Finished difference Result 602 states and 933 transitions. [2019-09-10 02:35:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:22,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 02:35:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:22,456 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:35:22,456 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:35:22,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:35:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:35:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:35:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-09-10 02:35:22,476 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 98 [2019-09-10 02:35:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:22,476 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-09-10 02:35:22,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-09-10 02:35:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:35:22,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:22,478 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] [2019-09-10 02:35:22,478 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2128394241, now seen corresponding path program 1 times [2019-09-10 02:35:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:22,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:22,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:22,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:22,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:22,581 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 6 states. [2019-09-10 02:35:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:22,663 INFO L93 Difference]: Finished difference Result 602 states and 932 transitions. [2019-09-10 02:35:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:22,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:35:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:22,669 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:35:22,669 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:35:22,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:35:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:35:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:35:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 928 transitions. [2019-09-10 02:35:22,688 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 928 transitions. Word has length 99 [2019-09-10 02:35:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:22,688 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 928 transitions. [2019-09-10 02:35:22,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 928 transitions. [2019-09-10 02:35:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:35:22,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:22,690 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] [2019-09-10 02:35:22,690 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash -404641629, now seen corresponding path program 1 times [2019-09-10 02:35:22,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:22,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:22,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:22,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:35:22,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:22,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:35:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:35:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:35:22,880 INFO L87 Difference]: Start difference. First operand 599 states and 928 transitions. Second operand 12 states. [2019-09-10 02:35:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:23,074 INFO L93 Difference]: Finished difference Result 603 states and 931 transitions. [2019-09-10 02:35:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:35:23,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 02:35:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:23,078 INFO L225 Difference]: With dead ends: 603 [2019-09-10 02:35:23,079 INFO L226 Difference]: Without dead ends: 599 [2019-09-10 02:35:23,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:35:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-10 02:35:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-10 02:35:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-10 02:35:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 927 transitions. [2019-09-10 02:35:23,102 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 927 transitions. Word has length 100 [2019-09-10 02:35:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:23,102 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 927 transitions. [2019-09-10 02:35:23,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:35:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 927 transitions. [2019-09-10 02:35:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:35:23,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:23,104 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] [2019-09-10 02:35:23,104 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:23,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1635405980, now seen corresponding path program 1 times [2019-09-10 02:35:23,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:23,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:23,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:23,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:23,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:23,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:23,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:23,279 INFO L87 Difference]: Start difference. First operand 599 states and 927 transitions. Second operand 10 states. [2019-09-10 02:35:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:29,920 INFO L93 Difference]: Finished difference Result 1234 states and 1953 transitions. [2019-09-10 02:35:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:29,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-09-10 02:35:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:29,930 INFO L225 Difference]: With dead ends: 1234 [2019-09-10 02:35:29,930 INFO L226 Difference]: Without dead ends: 1234 [2019-09-10 02:35:29,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-10 02:35:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1204. [2019-09-10 02:35:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-09-10 02:35:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1913 transitions. [2019-09-10 02:35:29,985 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1913 transitions. Word has length 101 [2019-09-10 02:35:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:29,986 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1913 transitions. [2019-09-10 02:35:29,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1913 transitions. [2019-09-10 02:35:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:35:29,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:29,988 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] [2019-09-10 02:35:29,989 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1559201877, now seen corresponding path program 1 times [2019-09-10 02:35:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:29,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:30,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:30,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:30,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:30,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:30,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:30,198 INFO L87 Difference]: Start difference. First operand 1204 states and 1913 transitions. Second operand 10 states. [2019-09-10 02:35:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:37,054 INFO L93 Difference]: Finished difference Result 2617 states and 4243 transitions. [2019-09-10 02:35:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:37,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-09-10 02:35:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:37,075 INFO L225 Difference]: With dead ends: 2617 [2019-09-10 02:35:37,075 INFO L226 Difference]: Without dead ends: 2617 [2019-09-10 02:35:37,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-10 02:35:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2576. [2019-09-10 02:35:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-09-10 02:35:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 4181 transitions. [2019-09-10 02:35:37,162 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 4181 transitions. Word has length 102 [2019-09-10 02:35:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:37,162 INFO L475 AbstractCegarLoop]: Abstraction has 2576 states and 4181 transitions. [2019-09-10 02:35:37,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 4181 transitions. [2019-09-10 02:35:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 02:35:37,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:37,164 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] [2019-09-10 02:35:37,165 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -962393984, now seen corresponding path program 1 times [2019-09-10 02:35:37,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:37,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:37,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:37,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:37,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:37,318 INFO L87 Difference]: Start difference. First operand 2576 states and 4181 transitions. Second operand 10 states. [2019-09-10 02:35:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:44,147 INFO L93 Difference]: Finished difference Result 5847 states and 9709 transitions. [2019-09-10 02:35:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:44,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-10 02:35:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:44,188 INFO L225 Difference]: With dead ends: 5847 [2019-09-10 02:35:44,189 INFO L226 Difference]: Without dead ends: 5847 [2019-09-10 02:35:44,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2019-09-10 02:35:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5784. [2019-09-10 02:35:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-09-10 02:35:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 9591 transitions. [2019-09-10 02:35:44,412 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 9591 transitions. Word has length 103 [2019-09-10 02:35:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:44,412 INFO L475 AbstractCegarLoop]: Abstraction has 5784 states and 9591 transitions. [2019-09-10 02:35:44,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 9591 transitions. [2019-09-10 02:35:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 02:35:44,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:44,414 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] [2019-09-10 02:35:44,415 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:44,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:44,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1204185167, now seen corresponding path program 1 times [2019-09-10 02:35:44,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:44,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:44,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:44,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:44,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:44,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:44,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:44,569 INFO L87 Difference]: Start difference. First operand 5784 states and 9591 transitions. Second operand 10 states. [2019-09-10 02:35:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:51,829 INFO L93 Difference]: Finished difference Result 13690 states and 23384 transitions. [2019-09-10 02:35:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:51,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-10 02:35:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:51,928 INFO L225 Difference]: With dead ends: 13690 [2019-09-10 02:35:51,928 INFO L226 Difference]: Without dead ends: 13690 [2019-09-10 02:35:51,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13690 states. [2019-09-10 02:35:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13690 to 13583. [2019-09-10 02:35:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13583 states. [2019-09-10 02:35:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13583 states to 13583 states and 23106 transitions. [2019-09-10 02:35:53,136 INFO L78 Accepts]: Start accepts. Automaton has 13583 states and 23106 transitions. Word has length 104 [2019-09-10 02:35:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:53,138 INFO L475 AbstractCegarLoop]: Abstraction has 13583 states and 23106 transitions. [2019-09-10 02:35:53,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13583 states and 23106 transitions. [2019-09-10 02:35:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 02:35:53,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:53,140 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] [2019-09-10 02:35:53,140 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash 494065764, now seen corresponding path program 1 times [2019-09-10 02:35:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:53,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:53,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:53,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:53,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:53,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:53,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:53,296 INFO L87 Difference]: Start difference. First operand 13583 states and 23106 transitions. Second operand 10 states. [2019-09-10 02:36:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:00,535 INFO L93 Difference]: Finished difference Result 33680 states and 59690 transitions. [2019-09-10 02:36:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:00,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-10 02:36:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:00,777 INFO L225 Difference]: With dead ends: 33680 [2019-09-10 02:36:00,777 INFO L226 Difference]: Without dead ends: 33680 [2019-09-10 02:36:00,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33680 states. [2019-09-10 02:36:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33680 to 33485. [2019-09-10 02:36:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33485 states. [2019-09-10 02:36:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33485 states to 33485 states and 58900 transitions. [2019-09-10 02:36:02,271 INFO L78 Accepts]: Start accepts. Automaton has 33485 states and 58900 transitions. Word has length 105 [2019-09-10 02:36:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:02,274 INFO L475 AbstractCegarLoop]: Abstraction has 33485 states and 58900 transitions. [2019-09-10 02:36:02,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33485 states and 58900 transitions. [2019-09-10 02:36:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:36:02,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:02,275 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] [2019-09-10 02:36:02,276 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 800604403, now seen corresponding path program 1 times [2019-09-10 02:36:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:02,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:02,438 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:36:02,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:02,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:02,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:02,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:02,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:02,440 INFO L87 Difference]: Start difference. First operand 33485 states and 58900 transitions. Second operand 10 states. [2019-09-10 02:36:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:10,225 INFO L93 Difference]: Finished difference Result 87663 states and 163391 transitions. [2019-09-10 02:36:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:10,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-10 02:36:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:10,821 INFO L225 Difference]: With dead ends: 87663 [2019-09-10 02:36:10,821 INFO L226 Difference]: Without dead ends: 87663 [2019-09-10 02:36:10,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87663 states. [2019-09-10 02:36:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87663 to 87292. [2019-09-10 02:36:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87292 states. [2019-09-10 02:36:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87292 states to 87292 states and 160809 transitions. [2019-09-10 02:36:14,288 INFO L78 Accepts]: Start accepts. Automaton has 87292 states and 160809 transitions. Word has length 106 [2019-09-10 02:36:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:14,288 INFO L475 AbstractCegarLoop]: Abstraction has 87292 states and 160809 transitions. [2019-09-10 02:36:14,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87292 states and 160809 transitions. [2019-09-10 02:36:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 02:36:14,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:14,290 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] [2019-09-10 02:36:14,290 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1011955316, now seen corresponding path program 1 times [2019-09-10 02:36:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:14,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:14,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:14,369 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:36:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:14,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:36:14,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:14,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:36:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:36:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:14,371 INFO L87 Difference]: Start difference. First operand 87292 states and 160809 transitions. Second operand 3 states. [2019-09-10 02:36:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:19,293 INFO L93 Difference]: Finished difference Result 174509 states and 360555 transitions. [2019-09-10 02:36:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:36:19,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 02:36:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:21,207 INFO L225 Difference]: With dead ends: 174509 [2019-09-10 02:36:21,207 INFO L226 Difference]: Without dead ends: 174509 [2019-09-10 02:36:21,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174509 states. [2019-09-10 02:36:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174509 to 174507. [2019-09-10 02:36:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174507 states. [2019-09-10 02:36:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174507 states to 174507 states and 360554 transitions. [2019-09-10 02:36:35,063 INFO L78 Accepts]: Start accepts. Automaton has 174507 states and 360554 transitions. Word has length 106 [2019-09-10 02:36:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:35,063 INFO L475 AbstractCegarLoop]: Abstraction has 174507 states and 360554 transitions. [2019-09-10 02:36:35,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:36:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 174507 states and 360554 transitions. [2019-09-10 02:36:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 02:36:35,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:35,065 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:36:35,065 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1304449025, now seen corresponding path program 1 times [2019-09-10 02:36:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:35,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:35,150 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:36:35,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:36:35,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:35,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:36:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:36:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:35,151 INFO L87 Difference]: Start difference. First operand 174507 states and 360554 transitions. Second operand 3 states. [2019-09-10 02:36:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:46,234 INFO L93 Difference]: Finished difference Result 348941 states and 843366 transitions. [2019-09-10 02:36:46,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:36:46,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 02:36:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:49,676 INFO L225 Difference]: With dead ends: 348941 [2019-09-10 02:36:49,676 INFO L226 Difference]: Without dead ends: 348941 [2019-09-10 02:36:49,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348941 states. [2019-09-10 02:37:10,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348941 to 348938. [2019-09-10 02:37:10,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348938 states. [2019-09-10 02:37:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348938 states to 348938 states and 843364 transitions. [2019-09-10 02:37:33,644 INFO L78 Accepts]: Start accepts. Automaton has 348938 states and 843364 transitions. Word has length 107 [2019-09-10 02:37:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:33,645 INFO L475 AbstractCegarLoop]: Abstraction has 348938 states and 843364 transitions. [2019-09-10 02:37:33,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 348938 states and 843364 transitions. [2019-09-10 02:37:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 02:37:33,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:33,646 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] [2019-09-10 02:37:33,647 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1781823318, now seen corresponding path program 1 times [2019-09-10 02:37:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:33,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:33,732 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:37:33,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:33,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:33,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:33,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:33,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:33,734 INFO L87 Difference]: Start difference. First operand 348938 states and 843364 transitions. Second operand 3 states. [2019-09-10 02:38:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:21,495 INFO L93 Difference]: Finished difference Result 697805 states and 2080603 transitions. [2019-09-10 02:38:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 02:38:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:31,147 INFO L225 Difference]: With dead ends: 697805 [2019-09-10 02:38:31,147 INFO L226 Difference]: Without dead ends: 697805 [2019-09-10 02:38:31,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697805 states.