java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:23,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:23,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:23,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:23,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:23,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:23,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:23,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:23,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:23,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:23,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:23,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:23,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:23,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:23,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:23,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:23,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:23,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:23,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:23,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:23,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:23,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:23,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:23,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:23,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:23,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:23,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:23,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:23,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:23,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:23,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:23,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:23,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:23,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:23,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:23,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:23,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:23,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:23,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:23,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:23,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:23,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:31:23,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:23,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:23,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:23,742 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:23,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:23,743 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:23,743 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:23,743 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:23,743 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:23,743 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:23,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:23,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:23,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:23,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:23,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:23,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:23,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:23,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:23,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:23,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:23,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:23,746 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:23,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:23,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:23,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:23,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:23,747 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:23,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:23,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:23,748 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:23,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:23,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:23,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:23,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:23,793 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:23,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-09-10 02:31:23,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d334e2327/2cce0c62aba34163b39e4f9811953a06/FLAG95abcc29f [2019-09-10 02:31:24,497 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:24,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-09-10 02:31:24,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d334e2327/2cce0c62aba34163b39e4f9811953a06/FLAG95abcc29f [2019-09-10 02:31:24,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d334e2327/2cce0c62aba34163b39e4f9811953a06 [2019-09-10 02:31:24,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:24,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:24,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:24,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:24,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:24,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f483d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:24, skipping insertion in model container [2019-09-10 02:31:24,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:24" (1/1) ... [2019-09-10 02:31:24,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:24,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:25,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:25,503 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:25,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:25,649 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:25,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25 WrapperNode [2019-09-10 02:31:25,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:25,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:25,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:25,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:25,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... [2019-09-10 02:31:25,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:25,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:25,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:25,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:25,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:25,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:25,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:25,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:25,925 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:25,925 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:25,926 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:25,927 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:25,928 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:25,929 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:25,929 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:25,929 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:25,929 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:25,929 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:25,930 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:25,930 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:25,930 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:25,930 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:25,930 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:25,931 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-09-10 02:31:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:25,932 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-09-10 02:31:25,933 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:25,933 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:25,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:25,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:25,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:25,934 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:25,935 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:25,936 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:25,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:25,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:25,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:25,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:25,939 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:25,939 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:25,939 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:25,939 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:25,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:25,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:25,941 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:25,942 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:25,944 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:25,947 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:25,948 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:25,949 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-09-10 02:31:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-09-10 02:31:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:25,951 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:25,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:25,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:28,268 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:28,269 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:28,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:28 BoogieIcfgContainer [2019-09-10 02:31:28,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:28,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:28,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:28,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:28,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:24" (1/3) ... [2019-09-10 02:31:28,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bf6945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:28, skipping insertion in model container [2019-09-10 02:31:28,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:25" (2/3) ... [2019-09-10 02:31:28,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bf6945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:28, skipping insertion in model container [2019-09-10 02:31:28,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:28" (3/3) ... [2019-09-10 02:31:28,279 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-09-10 02:31:28,289 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:28,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:28,313 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:28,343 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:28,344 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:28,344 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:28,344 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:28,344 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:28,344 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:28,344 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:28,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-09-10 02:31:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:31:28,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:28,422 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] [2019-09-10 02:31:28,426 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1188892362, now seen corresponding path program 1 times [2019-09-10 02:31:28,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:28,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:28,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:29,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:29,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:29,066 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-09-10 02:31:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,239 INFO L93 Difference]: Finished difference Result 602 states and 962 transitions. [2019-09-10 02:31:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:29,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 02:31:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,279 INFO L225 Difference]: With dead ends: 602 [2019-09-10 02:31:29,279 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:29,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 02:31:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 02:31:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 950 transitions. [2019-09-10 02:31:29,391 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 950 transitions. Word has length 85 [2019-09-10 02:31:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,391 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 950 transitions. [2019-09-10 02:31:29,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 950 transitions. [2019-09-10 02:31:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:31:29,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,397 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] [2019-09-10 02:31:29,397 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash -425590234, now seen corresponding path program 1 times [2019-09-10 02:31:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:29,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:29,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:29,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:29,668 INFO L87 Difference]: Start difference. First operand 591 states and 950 transitions. Second operand 4 states. [2019-09-10 02:31:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,730 INFO L93 Difference]: Finished difference Result 593 states and 951 transitions. [2019-09-10 02:31:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:29,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 02:31:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,738 INFO L225 Difference]: With dead ends: 593 [2019-09-10 02:31:29,738 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:29,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 02:31:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 02:31:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 949 transitions. [2019-09-10 02:31:29,783 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 949 transitions. Word has length 88 [2019-09-10 02:31:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,783 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 949 transitions. [2019-09-10 02:31:29,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 949 transitions. [2019-09-10 02:31:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:31:29,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,788 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] [2019-09-10 02:31:29,788 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash -737262235, now seen corresponding path program 1 times [2019-09-10 02:31:29,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:29,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:29,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:29,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:29,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:29,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:29,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:29,909 INFO L87 Difference]: Start difference. First operand 591 states and 949 transitions. Second operand 4 states. [2019-09-10 02:31:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:29,962 INFO L93 Difference]: Finished difference Result 593 states and 950 transitions. [2019-09-10 02:31:29,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:29,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 02:31:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:29,968 INFO L225 Difference]: With dead ends: 593 [2019-09-10 02:31:29,968 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:29,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 02:31:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 02:31:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 948 transitions. [2019-09-10 02:31:29,994 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 948 transitions. Word has length 89 [2019-09-10 02:31:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:29,994 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 948 transitions. [2019-09-10 02:31:29,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 948 transitions. [2019-09-10 02:31:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:31:29,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:29,997 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:31:29,997 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:29,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1727810174, now seen corresponding path program 1 times [2019-09-10 02:31:29,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:29,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:29,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:30,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:30,107 INFO L87 Difference]: Start difference. First operand 591 states and 948 transitions. Second operand 4 states. [2019-09-10 02:31:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,169 INFO L93 Difference]: Finished difference Result 593 states and 949 transitions. [2019-09-10 02:31:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:30,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:31:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,176 INFO L225 Difference]: With dead ends: 593 [2019-09-10 02:31:30,176 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:30,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 02:31:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 02:31:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 947 transitions. [2019-09-10 02:31:30,206 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 947 transitions. Word has length 90 [2019-09-10 02:31:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,207 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 947 transitions. [2019-09-10 02:31:30,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 947 transitions. [2019-09-10 02:31:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:31:30,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,210 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:31:30,211 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2006291585, now seen corresponding path program 1 times [2019-09-10 02:31:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:30,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:30,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:30,420 INFO L87 Difference]: Start difference. First operand 591 states and 947 transitions. Second operand 4 states. [2019-09-10 02:31:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,462 INFO L93 Difference]: Finished difference Result 593 states and 948 transitions. [2019-09-10 02:31:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:30,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:31:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,468 INFO L225 Difference]: With dead ends: 593 [2019-09-10 02:31:30,468 INFO L226 Difference]: Without dead ends: 591 [2019-09-10 02:31:30,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-10 02:31:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-10 02:31:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-10 02:31:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 946 transitions. [2019-09-10 02:31:30,490 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 946 transitions. Word has length 91 [2019-09-10 02:31:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,491 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 946 transitions. [2019-09-10 02:31:30,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 946 transitions. [2019-09-10 02:31:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:31:30,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:30,493 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1880678622, now seen corresponding path program 1 times [2019-09-10 02:31:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:30,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:30,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:30,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:30,671 INFO L87 Difference]: Start difference. First operand 591 states and 946 transitions. Second operand 10 states. [2019-09-10 02:31:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:30,875 INFO L93 Difference]: Finished difference Result 600 states and 957 transitions. [2019-09-10 02:31:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:30,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 02:31:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:30,881 INFO L225 Difference]: With dead ends: 600 [2019-09-10 02:31:30,881 INFO L226 Difference]: Without dead ends: 600 [2019-09-10 02:31:30,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:31:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-10 02:31:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2019-09-10 02:31:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-10 02:31:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-09-10 02:31:30,914 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-09-10 02:31:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:30,914 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-09-10 02:31:30,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-09-10 02:31:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:31:30,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:30,917 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:31:30,918 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1901015997, now seen corresponding path program 1 times [2019-09-10 02:31:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:30,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:31,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:31,034 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-09-10 02:31:31,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,079 INFO L93 Difference]: Finished difference Result 596 states and 950 transitions. [2019-09-10 02:31:31,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:31,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:31:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,084 INFO L225 Difference]: With dead ends: 596 [2019-09-10 02:31:31,085 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 02:31:31,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 02:31:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-10 02:31:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-10 02:31:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 932 transitions. [2019-09-10 02:31:31,106 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 932 transitions. Word has length 92 [2019-09-10 02:31:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,107 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 932 transitions. [2019-09-10 02:31:31,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 932 transitions. [2019-09-10 02:31:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:31:31,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,110 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:31:31,110 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1516088769, now seen corresponding path program 1 times [2019-09-10 02:31:31,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:31,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:31,260 INFO L87 Difference]: Start difference. First operand 585 states and 932 transitions. Second operand 6 states. [2019-09-10 02:31:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,523 INFO L93 Difference]: Finished difference Result 588 states and 935 transitions. [2019-09-10 02:31:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:31,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 02:31:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,529 INFO L225 Difference]: With dead ends: 588 [2019-09-10 02:31:31,529 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 02:31:31,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 02:31:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-10 02:31:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-10 02:31:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2019-09-10 02:31:31,551 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 93 [2019-09-10 02:31:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,551 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2019-09-10 02:31:31,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2019-09-10 02:31:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:31:31,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,555 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:31:31,555 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash 645733217, now seen corresponding path program 1 times [2019-09-10 02:31:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:31,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:31,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:31,683 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand 6 states. [2019-09-10 02:31:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:31,867 INFO L93 Difference]: Finished difference Result 588 states and 931 transitions. [2019-09-10 02:31:31,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:31,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-10 02:31:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:31,872 INFO L225 Difference]: With dead ends: 588 [2019-09-10 02:31:31,872 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 02:31:31,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 02:31:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-10 02:31:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-10 02:31:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2019-09-10 02:31:31,895 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 94 [2019-09-10 02:31:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:31,897 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2019-09-10 02:31:31,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2019-09-10 02:31:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:31:31,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:31,901 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:31:31,901 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:31,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1096058748, now seen corresponding path program 1 times [2019-09-10 02:31:31,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:31,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:32,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:32,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:32,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:32,013 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand 6 states. [2019-09-10 02:31:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:32,187 INFO L93 Difference]: Finished difference Result 588 states and 927 transitions. [2019-09-10 02:31:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:32,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:31:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:32,192 INFO L225 Difference]: With dead ends: 588 [2019-09-10 02:31:32,192 INFO L226 Difference]: Without dead ends: 585 [2019-09-10 02:31:32,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-10 02:31:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-10 02:31:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-10 02:31:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 920 transitions. [2019-09-10 02:31:32,213 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 920 transitions. Word has length 95 [2019-09-10 02:31:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:32,213 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 920 transitions. [2019-09-10 02:31:32,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 920 transitions. [2019-09-10 02:31:32,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:31:32,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:32,216 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:31:32,216 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -48204540, now seen corresponding path program 1 times [2019-09-10 02:31:32,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:32,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:32,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:32,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:32,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:32,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:32,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:32,346 INFO L87 Difference]: Start difference. First operand 585 states and 920 transitions. Second operand 7 states. [2019-09-10 02:31:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:32,449 INFO L93 Difference]: Finished difference Result 588 states and 923 transitions. [2019-09-10 02:31:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:32,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 02:31:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:32,454 INFO L225 Difference]: With dead ends: 588 [2019-09-10 02:31:32,454 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 02:31:32,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 02:31:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-10 02:31:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-10 02:31:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 886 transitions. [2019-09-10 02:31:32,472 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 886 transitions. Word has length 95 [2019-09-10 02:31:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:32,473 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 886 transitions. [2019-09-10 02:31:32,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 886 transitions. [2019-09-10 02:31:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:31:32,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:32,475 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:31:32,476 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash 704168390, now seen corresponding path program 1 times [2019-09-10 02:31:32,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:32,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:32,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:32,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:32,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:32,606 INFO L87 Difference]: Start difference. First operand 564 states and 886 transitions. Second operand 6 states. [2019-09-10 02:31:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:32,710 INFO L93 Difference]: Finished difference Result 567 states and 889 transitions. [2019-09-10 02:31:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:32,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:31:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:32,714 INFO L225 Difference]: With dead ends: 567 [2019-09-10 02:31:32,714 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 02:31:32,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 02:31:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-10 02:31:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-10 02:31:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 885 transitions. [2019-09-10 02:31:32,731 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 885 transitions. Word has length 96 [2019-09-10 02:31:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:32,733 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 885 transitions. [2019-09-10 02:31:32,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 885 transitions. [2019-09-10 02:31:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:31:32,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:32,735 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:31:32,735 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 637838025, now seen corresponding path program 1 times [2019-09-10 02:31:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:32,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:32,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:32,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:32,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:32,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:32,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:32,879 INFO L87 Difference]: Start difference. First operand 564 states and 885 transitions. Second operand 6 states. [2019-09-10 02:31:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:32,977 INFO L93 Difference]: Finished difference Result 567 states and 888 transitions. [2019-09-10 02:31:32,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:32,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:31:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:32,982 INFO L225 Difference]: With dead ends: 567 [2019-09-10 02:31:32,982 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 02:31:32,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 02:31:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-10 02:31:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-10 02:31:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 884 transitions. [2019-09-10 02:31:32,999 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 884 transitions. Word has length 97 [2019-09-10 02:31:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:33,000 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 884 transitions. [2019-09-10 02:31:33,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2019-09-10 02:31:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:31:33,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:33,002 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:31:33,002 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1457200085, now seen corresponding path program 1 times [2019-09-10 02:31:33,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:33,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:33,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:33,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:33,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:33,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:33,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:33,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:33,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:33,204 INFO L87 Difference]: Start difference. First operand 564 states and 884 transitions. Second operand 12 states. [2019-09-10 02:31:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:33,367 INFO L93 Difference]: Finished difference Result 568 states and 887 transitions. [2019-09-10 02:31:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:33,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 02:31:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:33,373 INFO L225 Difference]: With dead ends: 568 [2019-09-10 02:31:33,373 INFO L226 Difference]: Without dead ends: 564 [2019-09-10 02:31:33,374 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:31:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-10 02:31:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-10 02:31:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-10 02:31:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 883 transitions. [2019-09-10 02:31:33,392 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 883 transitions. Word has length 98 [2019-09-10 02:31:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:33,392 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 883 transitions. [2019-09-10 02:31:33,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 883 transitions. [2019-09-10 02:31:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:31:33,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:33,395 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:31:33,395 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 910887794, now seen corresponding path program 1 times [2019-09-10 02:31:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:33,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:33,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:33,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:33,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:33,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:33,570 INFO L87 Difference]: Start difference. First operand 564 states and 883 transitions. Second operand 6 states. [2019-09-10 02:31:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:36,958 INFO L93 Difference]: Finished difference Result 1172 states and 1885 transitions. [2019-09-10 02:31:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:36,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:31:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:36,968 INFO L225 Difference]: With dead ends: 1172 [2019-09-10 02:31:36,968 INFO L226 Difference]: Without dead ends: 1172 [2019-09-10 02:31:36,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-09-10 02:31:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1047. [2019-09-10 02:31:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-09-10 02:31:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1686 transitions. [2019-09-10 02:31:37,010 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1686 transitions. Word has length 99 [2019-09-10 02:31:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:37,010 INFO L475 AbstractCegarLoop]: Abstraction has 1047 states and 1686 transitions. [2019-09-10 02:31:37,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1686 transitions. [2019-09-10 02:31:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:31:37,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:37,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:37,016 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 728641115, now seen corresponding path program 1 times [2019-09-10 02:31:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:37,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:37,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:37,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:37,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:37,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:37,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:37,217 INFO L87 Difference]: Start difference. First operand 1047 states and 1686 transitions. Second operand 12 states. [2019-09-10 02:31:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:47,664 INFO L93 Difference]: Finished difference Result 2371 states and 3793 transitions. [2019-09-10 02:31:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:31:47,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2019-09-10 02:31:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:47,677 INFO L225 Difference]: With dead ends: 2371 [2019-09-10 02:31:47,678 INFO L226 Difference]: Without dead ends: 2371 [2019-09-10 02:31:47,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:31:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-09-10 02:31:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2313. [2019-09-10 02:31:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-09-10 02:31:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3713 transitions. [2019-09-10 02:31:47,751 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3713 transitions. Word has length 131 [2019-09-10 02:31:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:47,752 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3713 transitions. [2019-09-10 02:31:47,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3713 transitions. [2019-09-10 02:31:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:31:47,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:47,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:47,756 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 552853337, now seen corresponding path program 1 times [2019-09-10 02:31:47,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:47,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:47,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:47,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:47,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:47,916 INFO L87 Difference]: Start difference. First operand 2313 states and 3713 transitions. Second operand 9 states. [2019-09-10 02:31:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:51,500 INFO L93 Difference]: Finished difference Result 2353 states and 3841 transitions. [2019-09-10 02:31:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:31:51,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-10 02:31:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:51,511 INFO L225 Difference]: With dead ends: 2353 [2019-09-10 02:31:51,512 INFO L226 Difference]: Without dead ends: 2353 [2019-09-10 02:31:51,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:31:51,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-10 02:31:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2337. [2019-09-10 02:31:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-09-10 02:31:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3797 transitions. [2019-09-10 02:31:51,588 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3797 transitions. Word has length 132 [2019-09-10 02:31:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:51,589 INFO L475 AbstractCegarLoop]: Abstraction has 2337 states and 3797 transitions. [2019-09-10 02:31:51,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:31:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3797 transitions. [2019-09-10 02:31:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:51,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:51,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:51,594 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2055663078, now seen corresponding path program 1 times [2019-09-10 02:31:51,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:51,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:51,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:51,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:51,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:31:51,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:51,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:31:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:31:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:51,774 INFO L87 Difference]: Start difference. First operand 2337 states and 3797 transitions. Second operand 8 states. [2019-09-10 02:31:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:57,841 INFO L93 Difference]: Finished difference Result 5648 states and 9066 transitions. [2019-09-10 02:31:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:31:57,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-09-10 02:31:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:57,883 INFO L225 Difference]: With dead ends: 5648 [2019-09-10 02:31:57,884 INFO L226 Difference]: Without dead ends: 5648 [2019-09-10 02:31:57,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:31:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states. [2019-09-10 02:31:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 5600. [2019-09-10 02:31:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-09-10 02:31:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 8993 transitions. [2019-09-10 02:31:58,128 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 8993 transitions. Word has length 133 [2019-09-10 02:31:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:58,129 INFO L475 AbstractCegarLoop]: Abstraction has 5600 states and 8993 transitions. [2019-09-10 02:31:58,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:31:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 8993 transitions. [2019-09-10 02:31:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:31:58,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:58,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:58,133 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2071050646, now seen corresponding path program 1 times [2019-09-10 02:31:58,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:58,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:58,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:58,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:31:58,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:58,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:31:58,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:58,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:31:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:31:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:31:58,281 INFO L87 Difference]: Start difference. First operand 5600 states and 8993 transitions. Second operand 9 states. [2019-09-10 02:32:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:06,202 INFO L93 Difference]: Finished difference Result 9261 states and 14943 transitions. [2019-09-10 02:32:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:32:06,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-09-10 02:32:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:06,256 INFO L225 Difference]: With dead ends: 9261 [2019-09-10 02:32:06,257 INFO L226 Difference]: Without dead ends: 9255 [2019-09-10 02:32:06,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:32:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2019-09-10 02:32:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 8645. [2019-09-10 02:32:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-09-10 02:32:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13813 transitions. [2019-09-10 02:32:06,739 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13813 transitions. Word has length 139 [2019-09-10 02:32:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:06,739 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13813 transitions. [2019-09-10 02:32:06,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:32:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13813 transitions. [2019-09-10 02:32:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:32:06,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:06,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:06,747 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -937860053, now seen corresponding path program 1 times [2019-09-10 02:32:06,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:06,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:06,926 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:32:06,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:06,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:06,928 INFO L87 Difference]: Start difference. First operand 8645 states and 13813 transitions. Second operand 7 states. [2019-09-10 02:32:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:11,550 INFO L93 Difference]: Finished difference Result 17579 states and 28695 transitions. [2019-09-10 02:32:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:32:11,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-10 02:32:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:11,644 INFO L225 Difference]: With dead ends: 17579 [2019-09-10 02:32:11,645 INFO L226 Difference]: Without dead ends: 17579 [2019-09-10 02:32:11,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:32:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17579 states. [2019-09-10 02:32:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17579 to 17197. [2019-09-10 02:32:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17197 states. [2019-09-10 02:32:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17197 states to 17197 states and 27862 transitions. [2019-09-10 02:32:12,199 INFO L78 Accepts]: Start accepts. Automaton has 17197 states and 27862 transitions. Word has length 139 [2019-09-10 02:32:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:12,201 INFO L475 AbstractCegarLoop]: Abstraction has 17197 states and 27862 transitions. [2019-09-10 02:32:12,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 17197 states and 27862 transitions. [2019-09-10 02:32:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:32:12,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:12,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:12,208 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1123011920, now seen corresponding path program 1 times [2019-09-10 02:32:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:12,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:12,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:12,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:32:12,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:12,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:32:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:32:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:12,384 INFO L87 Difference]: Start difference. First operand 17197 states and 27862 transitions. Second operand 5 states. [2019-09-10 02:32:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:12,549 INFO L93 Difference]: Finished difference Result 17602 states and 28465 transitions. [2019-09-10 02:32:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:12,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 02:32:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:12,654 INFO L225 Difference]: With dead ends: 17602 [2019-09-10 02:32:12,655 INFO L226 Difference]: Without dead ends: 17602 [2019-09-10 02:32:12,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-09-10 02:32:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 17386. [2019-09-10 02:32:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-09-10 02:32:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 28126 transitions. [2019-09-10 02:32:14,193 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 28126 transitions. Word has length 144 [2019-09-10 02:32:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:14,194 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 28126 transitions. [2019-09-10 02:32:14,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:32:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 28126 transitions. [2019-09-10 02:32:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:32:14,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:14,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:14,200 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:14,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:14,201 INFO L82 PathProgramCache]: Analyzing trace with hash -67888017, now seen corresponding path program 1 times [2019-09-10 02:32:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:14,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:14,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:14,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:14,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:14,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:14,335 INFO L87 Difference]: Start difference. First operand 17386 states and 28126 transitions. Second operand 7 states. [2019-09-10 02:32:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:14,590 INFO L93 Difference]: Finished difference Result 19414 states and 31369 transitions. [2019-09-10 02:32:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:14,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-10 02:32:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:14,681 INFO L225 Difference]: With dead ends: 19414 [2019-09-10 02:32:14,681 INFO L226 Difference]: Without dead ends: 17386 [2019-09-10 02:32:14,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-09-10 02:32:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 17386. [2019-09-10 02:32:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-09-10 02:32:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 27736 transitions. [2019-09-10 02:32:15,079 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 27736 transitions. Word has length 151 [2019-09-10 02:32:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:15,079 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 27736 transitions. [2019-09-10 02:32:15,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 27736 transitions. [2019-09-10 02:32:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:32:15,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:15,085 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:15,085 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 455720139, now seen corresponding path program 1 times [2019-09-10 02:32:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:15,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:32:15,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:15,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:15,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:15,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:15,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:15,216 INFO L87 Difference]: Start difference. First operand 17386 states and 27736 transitions. Second operand 7 states. [2019-09-10 02:32:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:19,866 INFO L93 Difference]: Finished difference Result 18989 states and 30246 transitions. [2019-09-10 02:32:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:32:19,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-10 02:32:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:19,943 INFO L225 Difference]: With dead ends: 18989 [2019-09-10 02:32:19,944 INFO L226 Difference]: Without dead ends: 18989 [2019-09-10 02:32:19,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:32:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2019-09-10 02:32:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18448. [2019-09-10 02:32:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-10 02:32:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 29176 transitions. [2019-09-10 02:32:20,427 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 29176 transitions. Word has length 156 [2019-09-10 02:32:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:20,428 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 29176 transitions. [2019-09-10 02:32:20,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 29176 transitions. [2019-09-10 02:32:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:32:20,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:20,434 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:20,434 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1238020489, now seen corresponding path program 1 times [2019-09-10 02:32:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:20,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:20,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:20,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:20,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:20,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:20,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:20,578 INFO L87 Difference]: Start difference. First operand 18448 states and 29176 transitions. Second operand 6 states. [2019-09-10 02:32:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:20,831 INFO L93 Difference]: Finished difference Result 26169 states and 41868 transitions. [2019-09-10 02:32:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:20,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-10 02:32:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:20,946 INFO L225 Difference]: With dead ends: 26169 [2019-09-10 02:32:20,946 INFO L226 Difference]: Without dead ends: 26169 [2019-09-10 02:32:20,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2019-09-10 02:32:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 24187. [2019-09-10 02:32:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24187 states. [2019-09-10 02:32:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24187 states to 24187 states and 38644 transitions. [2019-09-10 02:32:21,594 INFO L78 Accepts]: Start accepts. Automaton has 24187 states and 38644 transitions. Word has length 161 [2019-09-10 02:32:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:21,594 INFO L475 AbstractCegarLoop]: Abstraction has 24187 states and 38644 transitions. [2019-09-10 02:32:21,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24187 states and 38644 transitions. [2019-09-10 02:32:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-10 02:32:21,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:21,600 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:21,600 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:21,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1165633931, now seen corresponding path program 1 times [2019-09-10 02:32:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:21,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:21,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:21,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:21,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:21,719 INFO L87 Difference]: Start difference. First operand 24187 states and 38644 transitions. Second operand 4 states. [2019-09-10 02:32:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:23,941 INFO L93 Difference]: Finished difference Result 43375 states and 72559 transitions. [2019-09-10 02:32:23,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:23,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-10 02:32:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:24,355 INFO L225 Difference]: With dead ends: 43375 [2019-09-10 02:32:24,355 INFO L226 Difference]: Without dead ends: 43375 [2019-09-10 02:32:24,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43375 states. [2019-09-10 02:32:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43375 to 42807. [2019-09-10 02:32:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42807 states. [2019-09-10 02:32:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42807 states to 42807 states and 70649 transitions. [2019-09-10 02:32:25,187 INFO L78 Accepts]: Start accepts. Automaton has 42807 states and 70649 transitions. Word has length 161 [2019-09-10 02:32:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 42807 states and 70649 transitions. [2019-09-10 02:32:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 42807 states and 70649 transitions. [2019-09-10 02:32:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:32:25,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:25,193 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:25,194 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1117725836, now seen corresponding path program 1 times [2019-09-10 02:32:25,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:25,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:32:25,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:25,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:32:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:32:25,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:32:25,365 INFO L87 Difference]: Start difference. First operand 42807 states and 70649 transitions. Second operand 11 states. [2019-09-10 02:32:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:34,273 INFO L93 Difference]: Finished difference Result 55839 states and 92232 transitions. [2019-09-10 02:32:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:32:34,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 164 [2019-09-10 02:32:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:34,500 INFO L225 Difference]: With dead ends: 55839 [2019-09-10 02:32:34,500 INFO L226 Difference]: Without dead ends: 55749 [2019-09-10 02:32:34,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:32:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55749 states. [2019-09-10 02:32:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55749 to 51669. [2019-09-10 02:32:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51669 states. [2019-09-10 02:32:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51669 states to 51669 states and 83688 transitions. [2019-09-10 02:32:35,606 INFO L78 Accepts]: Start accepts. Automaton has 51669 states and 83688 transitions. Word has length 164 [2019-09-10 02:32:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:35,607 INFO L475 AbstractCegarLoop]: Abstraction has 51669 states and 83688 transitions. [2019-09-10 02:32:35,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:32:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 51669 states and 83688 transitions. [2019-09-10 02:32:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-10 02:32:35,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:35,611 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:35,612 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:35,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1773610942, now seen corresponding path program 1 times [2019-09-10 02:32:35,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:35,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:35,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:35,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:35,742 INFO L87 Difference]: Start difference. First operand 51669 states and 83688 transitions. Second operand 4 states. [2019-09-10 02:32:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:39,605 INFO L93 Difference]: Finished difference Result 100112 states and 177055 transitions. [2019-09-10 02:32:39,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:39,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-10 02:32:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:40,038 INFO L225 Difference]: With dead ends: 100112 [2019-09-10 02:32:40,038 INFO L226 Difference]: Without dead ends: 100112 [2019-09-10 02:32:40,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100112 states. [2019-09-10 02:32:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100112 to 98863. [2019-09-10 02:32:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98863 states. [2019-09-10 02:32:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98863 states to 98863 states and 170108 transitions. [2019-09-10 02:32:42,281 INFO L78 Accepts]: Start accepts. Automaton has 98863 states and 170108 transitions. Word has length 162 [2019-09-10 02:32:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:42,281 INFO L475 AbstractCegarLoop]: Abstraction has 98863 states and 170108 transitions. [2019-09-10 02:32:42,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 98863 states and 170108 transitions. [2019-09-10 02:32:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 02:32:42,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:42,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:42,286 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -853934291, now seen corresponding path program 1 times [2019-09-10 02:32:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:42,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:42,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:42,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:42,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:42,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:42,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:42,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:42,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:42,406 INFO L87 Difference]: Start difference. First operand 98863 states and 170108 transitions. Second operand 4 states. [2019-09-10 02:32:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:48,893 INFO L93 Difference]: Finished difference Result 204061 states and 413811 transitions. [2019-09-10 02:32:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:48,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-10 02:32:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:49,994 INFO L225 Difference]: With dead ends: 204061 [2019-09-10 02:32:49,994 INFO L226 Difference]: Without dead ends: 204061 [2019-09-10 02:32:49,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:50,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204061 states. [2019-09-10 02:32:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204061 to 201147. [2019-09-10 02:32:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201147 states. [2019-09-10 02:32:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201147 states to 201147 states and 386597 transitions. [2019-09-10 02:32:56,090 INFO L78 Accepts]: Start accepts. Automaton has 201147 states and 386597 transitions. Word has length 163 [2019-09-10 02:32:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:56,090 INFO L475 AbstractCegarLoop]: Abstraction has 201147 states and 386597 transitions. [2019-09-10 02:32:56,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 201147 states and 386597 transitions. [2019-09-10 02:32:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:32:56,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:56,095 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:56,096 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -703453984, now seen corresponding path program 1 times [2019-09-10 02:32:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:56,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:32:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:56,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:56,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:56,212 INFO L87 Difference]: Start difference. First operand 201147 states and 386597 transitions. Second operand 4 states. [2019-09-10 02:33:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:07,826 INFO L93 Difference]: Finished difference Result 434886 states and 1103673 transitions. [2019-09-10 02:33:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:33:07,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-10 02:33:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:18,145 INFO L225 Difference]: With dead ends: 434886 [2019-09-10 02:33:18,145 INFO L226 Difference]: Without dead ends: 434886 [2019-09-10 02:33:18,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:33:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434886 states. [2019-09-10 02:33:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434886 to 427731. [2019-09-10 02:33:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427731 states. [2019-09-10 02:33:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427731 states to 427731 states and 988914 transitions. [2019-09-10 02:33:52,680 INFO L78 Accepts]: Start accepts. Automaton has 427731 states and 988914 transitions. Word has length 164 [2019-09-10 02:33:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:52,681 INFO L475 AbstractCegarLoop]: Abstraction has 427731 states and 988914 transitions. [2019-09-10 02:33:52,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:33:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 427731 states and 988914 transitions. [2019-09-10 02:33:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:33:52,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:52,687 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:52,687 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -333527857, now seen corresponding path program 1 times [2019-09-10 02:33:52,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:52,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:33:52,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:33:52,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:52,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:33:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:33:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:33:52,814 INFO L87 Difference]: Start difference. First operand 427731 states and 988914 transitions. Second operand 4 states. [2019-09-10 02:34:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:59,856 INFO L93 Difference]: Finished difference Result 960957 states and 3402434 transitions. [2019-09-10 02:34:59,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:34:59,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-10 02:34:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:23,747 INFO L225 Difference]: With dead ends: 960957 [2019-09-10 02:35:23,747 INFO L226 Difference]: Without dead ends: 960945 [2019-09-10 02:35:23,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960945 states.