java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:34:47,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:34:47,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:34:47,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:34:47,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:34:47,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:34:47,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:34:47,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:34:47,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:34:47,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:34:47,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:34:47,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:34:47,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:34:47,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:34:47,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:34:47,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:34:47,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:34:47,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:34:47,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:34:47,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:34:47,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:34:47,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:34:47,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:34:47,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:34:47,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:34:47,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:34:47,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:34:47,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:34:47,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:34:47,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:34:47,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:34:47,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:34:47,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:34:47,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:34:47,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:34:47,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:34:47,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:34:47,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:34:47,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:34:47,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:34:47,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:34:47,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:34:47,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:34:47,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:34:47,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:34:47,616 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:34:47,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:34:47,616 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:34:47,617 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:34:47,617 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:34:47,617 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:34:47,617 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:34:47,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:34:47,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:34:47,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:34:47,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:34:47,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:34:47,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:34:47,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:34:47,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:34:47,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:34:47,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:34:47,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:34:47,620 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:34:47,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:34:47,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:34:47,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:34:47,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:34:47,621 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:34:47,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:34:47,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:34:47,622 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:34:47,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:34:47,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:34:47,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:34:47,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:34:47,668 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:34:47,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-09-10 02:34:47,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca61b044b/9da58f7058294e13977c56d4b887a4bc/FLAG1cfb407e2 [2019-09-10 02:34:48,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:34:48,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-09-10 02:34:48,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca61b044b/9da58f7058294e13977c56d4b887a4bc/FLAG1cfb407e2 [2019-09-10 02:34:48,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca61b044b/9da58f7058294e13977c56d4b887a4bc [2019-09-10 02:34:48,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:34:48,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:34:48,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:34:48,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:34:48,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:34:48,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:34:48" (1/1) ... [2019-09-10 02:34:48,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a23211a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:48, skipping insertion in model container [2019-09-10 02:34:48,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:34:48" (1/1) ... [2019-09-10 02:34:48,590 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:34:48,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:34:49,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:34:49,368 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:34:49,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:34:49,597 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:34:49,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49 WrapperNode [2019-09-10 02:34:49,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:34:49,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:34:49,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:34:49,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:34:49,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... [2019-09-10 02:34:49,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:34:49,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:34:49,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:34:49,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:34:49,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:34:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:34:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:34:49,877 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:34:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:34:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:34:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:34:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:34:49,878 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:34:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:34:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:34:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:34:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:34:49,879 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:34:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:34:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:34:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:34:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:34:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:34:49,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:34:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:34:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:34:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:34:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:34:49,882 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:34:49,883 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:34:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:34:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:34:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:34:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:34:49,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:34:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:34:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:34:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:34:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:34:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:34:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:34:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:34:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:34:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:34:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:34:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:34:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:34:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:34:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:34:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:34:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:34:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:34:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:34:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:34:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:34:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:34:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:34:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:34:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:34:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:34:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:34:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:34:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:34:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:34:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:34:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:34:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:34:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:34:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:34:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:34:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:34:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:34:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:34:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:34:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:34:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:34:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:34:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:34:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:34:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:34:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:34:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:34:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:34:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:34:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:34:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:34:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:34:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:34:52,490 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:34:52,490 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:34:52,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:34:52 BoogieIcfgContainer [2019-09-10 02:34:52,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:34:52,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:34:52,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:34:52,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:34:52,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:34:48" (1/3) ... [2019-09-10 02:34:52,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60836b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:34:52, skipping insertion in model container [2019-09-10 02:34:52,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:34:49" (2/3) ... [2019-09-10 02:34:52,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60836b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:34:52, skipping insertion in model container [2019-09-10 02:34:52,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:34:52" (3/3) ... [2019-09-10 02:34:52,500 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2019-09-10 02:34:52,510 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:34:52,518 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:34:52,534 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:34:52,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:34:52,558 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:34:52,558 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:34:52,558 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:34:52,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:34:52,558 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:34:52,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:34:52,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:34:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states. [2019-09-10 02:34:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 02:34:52,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:52,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:52,640 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:52,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1110601002, now seen corresponding path program 1 times [2019-09-10 02:34:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:52,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:52,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:53,159 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:34:53,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:53,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:53,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:53,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:53,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:53,185 INFO L87 Difference]: Start difference. First operand 728 states. Second operand 4 states. [2019-09-10 02:34:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:53,385 INFO L93 Difference]: Finished difference Result 579 states and 929 transitions. [2019-09-10 02:34:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:53,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-10 02:34:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:53,431 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:34:53,431 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:34:53,434 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:34:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:34:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 02:34:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 02:34:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-09-10 02:34:53,607 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 109 [2019-09-10 02:34:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:53,607 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-09-10 02:34:53,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-09-10 02:34:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 02:34:53,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:53,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:53,616 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:53,617 INFO L82 PathProgramCache]: Analyzing trace with hash 513878495, now seen corresponding path program 1 times [2019-09-10 02:34:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:53,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:53,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:53,794 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:34:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:53,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:53,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:53,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:53,803 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 4 states. [2019-09-10 02:34:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:53,883 INFO L93 Difference]: Finished difference Result 570 states and 918 transitions. [2019-09-10 02:34:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:53,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 02:34:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:53,892 INFO L225 Difference]: With dead ends: 570 [2019-09-10 02:34:53,892 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:34:53,893 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:34:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:34:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 02:34:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 02:34:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 916 transitions. [2019-09-10 02:34:53,952 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 916 transitions. Word has length 112 [2019-09-10 02:34:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:53,954 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 916 transitions. [2019-09-10 02:34:53,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 916 transitions. [2019-09-10 02:34:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 02:34:53,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:53,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:53,963 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:53,964 INFO L82 PathProgramCache]: Analyzing trace with hash -899322139, now seen corresponding path program 1 times [2019-09-10 02:34:53,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:53,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:53,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:54,190 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:34:54,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:54,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:54,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:54,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:54,192 INFO L87 Difference]: Start difference. First operand 568 states and 916 transitions. Second operand 4 states. [2019-09-10 02:34:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:54,240 INFO L93 Difference]: Finished difference Result 570 states and 917 transitions. [2019-09-10 02:34:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:54,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 02:34:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:54,246 INFO L225 Difference]: With dead ends: 570 [2019-09-10 02:34:54,246 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:34:54,246 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:34:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:34:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 02:34:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 02:34:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 915 transitions. [2019-09-10 02:34:54,269 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 915 transitions. Word has length 113 [2019-09-10 02:34:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:54,269 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 915 transitions. [2019-09-10 02:34:54,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 915 transitions. [2019-09-10 02:34:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 02:34:54,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:54,274 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:54,274 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash 251093531, now seen corresponding path program 1 times [2019-09-10 02:34:54,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:54,441 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:34:54,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:54,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:54,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:54,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:54,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:54,443 INFO L87 Difference]: Start difference. First operand 568 states and 915 transitions. Second operand 4 states. [2019-09-10 02:34:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:54,498 INFO L93 Difference]: Finished difference Result 570 states and 916 transitions. [2019-09-10 02:34:54,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:54,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 02:34:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:54,504 INFO L225 Difference]: With dead ends: 570 [2019-09-10 02:34:54,504 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:34:54,504 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:34:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:34:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 02:34:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 02:34:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-09-10 02:34:54,534 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-09-10 02:34:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:54,535 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-09-10 02:34:54,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-09-10 02:34:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 02:34:54,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:54,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:54,542 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -730763999, now seen corresponding path program 1 times [2019-09-10 02:34:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:54,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:54,702 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:34:54,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:54,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:54,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:54,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:54,705 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-09-10 02:34:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:54,747 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-09-10 02:34:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:54,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-10 02:34:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:54,753 INFO L225 Difference]: With dead ends: 570 [2019-09-10 02:34:54,753 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 02:34:54,754 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:34:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 02:34:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-10 02:34:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-10 02:34:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 913 transitions. [2019-09-10 02:34:54,777 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 913 transitions. Word has length 115 [2019-09-10 02:34:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:54,778 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 913 transitions. [2019-09-10 02:34:54,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 913 transitions. [2019-09-10 02:34:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:34:54,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:54,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:54,783 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:54,784 INFO L82 PathProgramCache]: Analyzing trace with hash 906386007, now seen corresponding path program 1 times [2019-09-10 02:34:54,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:54,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:54,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:54,983 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:34:54,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:54,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:34:54,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:54,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:34:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:34:54,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:34:54,985 INFO L87 Difference]: Start difference. First operand 568 states and 913 transitions. Second operand 10 states. [2019-09-10 02:34:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:55,136 INFO L93 Difference]: Finished difference Result 577 states and 924 transitions. [2019-09-10 02:34:55,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:34:55,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-09-10 02:34:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:55,145 INFO L225 Difference]: With dead ends: 577 [2019-09-10 02:34:55,146 INFO L226 Difference]: Without dead ends: 577 [2019-09-10 02:34:55,150 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:34:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-10 02:34:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-09-10 02:34:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-10 02:34:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2019-09-10 02:34:55,184 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 116 [2019-09-10 02:34:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:55,185 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2019-09-10 02:34:55,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:34:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2019-09-10 02:34:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 02:34:55,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:55,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:55,192 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 335134774, now seen corresponding path program 1 times [2019-09-10 02:34:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:55,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:55,422 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:34:55,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:55,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:55,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:55,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:55,426 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand 4 states. [2019-09-10 02:34:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:55,497 INFO L93 Difference]: Finished difference Result 573 states and 917 transitions. [2019-09-10 02:34:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:34:55,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 02:34:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:55,507 INFO L225 Difference]: With dead ends: 573 [2019-09-10 02:34:55,508 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:34:55,508 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:34:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:34:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:34:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:34:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 899 transitions. [2019-09-10 02:34:55,544 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 899 transitions. Word has length 116 [2019-09-10 02:34:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:55,544 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 899 transitions. [2019-09-10 02:34:55,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 899 transitions. [2019-09-10 02:34:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 02:34:55,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:55,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:55,550 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:55,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1313046375, now seen corresponding path program 1 times [2019-09-10 02:34:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:55,722 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:34:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:55,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:55,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:55,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:55,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:55,725 INFO L87 Difference]: Start difference. First operand 562 states and 899 transitions. Second operand 6 states. [2019-09-10 02:34:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:55,922 INFO L93 Difference]: Finished difference Result 565 states and 902 transitions. [2019-09-10 02:34:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:55,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-10 02:34:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:55,927 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:34:55,927 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:34:55,928 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:34:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:34:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:34:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:34:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 895 transitions. [2019-09-10 02:34:55,949 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 895 transitions. Word has length 117 [2019-09-10 02:34:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:55,951 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 895 transitions. [2019-09-10 02:34:55,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 895 transitions. [2019-09-10 02:34:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 02:34:55,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:55,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:55,955 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1293617158, now seen corresponding path program 1 times [2019-09-10 02:34:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:55,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:56,113 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:34:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:56,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:56,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:56,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:56,115 INFO L87 Difference]: Start difference. First operand 562 states and 895 transitions. Second operand 6 states. [2019-09-10 02:34:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:56,322 INFO L93 Difference]: Finished difference Result 565 states and 898 transitions. [2019-09-10 02:34:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:56,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 02:34:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:56,327 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:34:56,327 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:34:56,328 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:34:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:34:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:34:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:34:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 891 transitions. [2019-09-10 02:34:56,346 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 891 transitions. Word has length 118 [2019-09-10 02:34:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:56,346 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 891 transitions. [2019-09-10 02:34:56,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 891 transitions. [2019-09-10 02:34:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:34:56,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:56,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:56,351 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1173950530, now seen corresponding path program 1 times [2019-09-10 02:34:56,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:56,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:56,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:56,543 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:34:56,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:56,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:56,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:56,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:56,545 INFO L87 Difference]: Start difference. First operand 562 states and 891 transitions. Second operand 6 states. [2019-09-10 02:34:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:56,715 INFO L93 Difference]: Finished difference Result 565 states and 894 transitions. [2019-09-10 02:34:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:56,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 02:34:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:56,720 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:34:56,721 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 02:34:56,721 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:34:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 02:34:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-10 02:34:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-10 02:34:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 887 transitions. [2019-09-10 02:34:56,740 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 887 transitions. Word has length 119 [2019-09-10 02:34:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:56,740 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 887 transitions. [2019-09-10 02:34:56,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 887 transitions. [2019-09-10 02:34:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 02:34:56,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:56,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:56,746 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2140246978, now seen corresponding path program 1 times [2019-09-10 02:34:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:56,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:56,874 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:34:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:34:56,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:56,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:34:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:34:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:34:56,876 INFO L87 Difference]: Start difference. First operand 562 states and 887 transitions. Second operand 7 states. [2019-09-10 02:34:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:56,948 INFO L93 Difference]: Finished difference Result 565 states and 890 transitions. [2019-09-10 02:34:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:34:56,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-10 02:34:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:56,953 INFO L225 Difference]: With dead ends: 565 [2019-09-10 02:34:56,953 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 02:34:56,954 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:34:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 02:34:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-10 02:34:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 02:34:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2019-09-10 02:34:56,971 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 119 [2019-09-10 02:34:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:56,971 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2019-09-10 02:34:56,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:34:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2019-09-10 02:34:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:34:56,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:56,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:56,975 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:56,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:56,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2053075839, now seen corresponding path program 1 times [2019-09-10 02:34:56,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:56,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:56,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:57,102 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:34:57,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:57,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:57,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:57,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:57,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:57,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:57,105 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand 6 states. [2019-09-10 02:34:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:57,207 INFO L93 Difference]: Finished difference Result 544 states and 856 transitions. [2019-09-10 02:34:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:57,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-10 02:34:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:57,212 INFO L225 Difference]: With dead ends: 544 [2019-09-10 02:34:57,212 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 02:34:57,213 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:34:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 02:34:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-10 02:34:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 02:34:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 852 transitions. [2019-09-10 02:34:57,231 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 852 transitions. Word has length 120 [2019-09-10 02:34:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:57,233 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 852 transitions. [2019-09-10 02:34:57,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 852 transitions. [2019-09-10 02:34:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 02:34:57,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:57,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:57,238 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1470960925, now seen corresponding path program 1 times [2019-09-10 02:34:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:34:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:57,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:57,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:57,370 INFO L87 Difference]: Start difference. First operand 541 states and 852 transitions. Second operand 6 states. [2019-09-10 02:34:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:57,462 INFO L93 Difference]: Finished difference Result 544 states and 855 transitions. [2019-09-10 02:34:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:57,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-10 02:34:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:57,467 INFO L225 Difference]: With dead ends: 544 [2019-09-10 02:34:57,467 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 02:34:57,468 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:34:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 02:34:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-10 02:34:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 02:34:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 851 transitions. [2019-09-10 02:34:57,516 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 851 transitions. Word has length 121 [2019-09-10 02:34:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:57,518 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 851 transitions. [2019-09-10 02:34:57,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 851 transitions. [2019-09-10 02:34:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 02:34:57,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:57,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:57,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 470409988, now seen corresponding path program 1 times [2019-09-10 02:34:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:57,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:57,695 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:34:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:34:57,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:57,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:34:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:34:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:34:57,697 INFO L87 Difference]: Start difference. First operand 541 states and 851 transitions. Second operand 12 states. [2019-09-10 02:34:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:57,858 INFO L93 Difference]: Finished difference Result 545 states and 854 transitions. [2019-09-10 02:34:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-10 02:34:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:57,863 INFO L225 Difference]: With dead ends: 545 [2019-09-10 02:34:57,863 INFO L226 Difference]: Without dead ends: 541 [2019-09-10 02:34:57,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:34:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-10 02:34:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-10 02:34:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-10 02:34:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 850 transitions. [2019-09-10 02:34:57,880 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 850 transitions. Word has length 122 [2019-09-10 02:34:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:57,880 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 850 transitions. [2019-09-10 02:34:57,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:34:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 850 transitions. [2019-09-10 02:34:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:34:57,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:57,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:57,884 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash 213763234, now seen corresponding path program 1 times [2019-09-10 02:34:57,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:57,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:57,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:57,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:58,028 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:34:58,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:58,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:34:58,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:58,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:34:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:34:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:34:58,030 INFO L87 Difference]: Start difference. First operand 541 states and 850 transitions. Second operand 9 states. [2019-09-10 02:35:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:01,509 INFO L93 Difference]: Finished difference Result 547 states and 871 transitions. [2019-09-10 02:35:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:35:01,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 02:35:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:01,515 INFO L225 Difference]: With dead ends: 547 [2019-09-10 02:35:01,515 INFO L226 Difference]: Without dead ends: 547 [2019-09-10 02:35:01,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:35:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-10 02:35:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-09-10 02:35:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-10 02:35:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 869 transitions. [2019-09-10 02:35:01,549 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 869 transitions. Word has length 123 [2019-09-10 02:35:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:01,549 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 869 transitions. [2019-09-10 02:35:01,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:35:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 869 transitions. [2019-09-10 02:35:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:35:01,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:01,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:01,554 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:01,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash 121735372, now seen corresponding path program 1 times [2019-09-10 02:35:01,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:01,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:01,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:01,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:35:01,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:01,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:35:01,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:35:01,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:01,776 INFO L87 Difference]: Start difference. First operand 545 states and 869 transitions. Second operand 8 states. [2019-09-10 02:35:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:08,060 INFO L93 Difference]: Finished difference Result 1427 states and 2289 transitions. [2019-09-10 02:35:08,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:35:08,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-09-10 02:35:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:08,085 INFO L225 Difference]: With dead ends: 1427 [2019-09-10 02:35:08,085 INFO L226 Difference]: Without dead ends: 1427 [2019-09-10 02:35:08,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:35:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-09-10 02:35:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1388. [2019-09-10 02:35:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-10 02:35:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2236 transitions. [2019-09-10 02:35:08,142 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2236 transitions. Word has length 124 [2019-09-10 02:35:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:08,142 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2236 transitions. [2019-09-10 02:35:08,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:35:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2236 transitions. [2019-09-10 02:35:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:35:08,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:08,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:08,146 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:08,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:08,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1651184340, now seen corresponding path program 1 times [2019-09-10 02:35:08,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:08,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:08,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:08,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:08,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:08,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:08,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:08,324 INFO L87 Difference]: Start difference. First operand 1388 states and 2236 transitions. Second operand 7 states. [2019-09-10 02:35:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:12,429 INFO L93 Difference]: Finished difference Result 2572 states and 4201 transitions. [2019-09-10 02:35:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:35:12,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-09-10 02:35:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:12,451 INFO L225 Difference]: With dead ends: 2572 [2019-09-10 02:35:12,452 INFO L226 Difference]: Without dead ends: 2572 [2019-09-10 02:35:12,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-10 02:35:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2516. [2019-09-10 02:35:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-09-10 02:35:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4112 transitions. [2019-09-10 02:35:12,538 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4112 transitions. Word has length 130 [2019-09-10 02:35:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:12,538 INFO L475 AbstractCegarLoop]: Abstraction has 2516 states and 4112 transitions. [2019-09-10 02:35:12,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4112 transitions. [2019-09-10 02:35:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:35:12,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:12,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:12,543 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -220068901, now seen corresponding path program 1 times [2019-09-10 02:35:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:12,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:12,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:12,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:12,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:35:12,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:12,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:35:12,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:35:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:12,672 INFO L87 Difference]: Start difference. First operand 2516 states and 4112 transitions. Second operand 5 states. [2019-09-10 02:35:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:12,753 INFO L93 Difference]: Finished difference Result 2575 states and 4201 transitions. [2019-09-10 02:35:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:35:12,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-10 02:35:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:12,784 INFO L225 Difference]: With dead ends: 2575 [2019-09-10 02:35:12,784 INFO L226 Difference]: Without dead ends: 2575 [2019-09-10 02:35:12,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-09-10 02:35:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2542. [2019-09-10 02:35:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-09-10 02:35:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4149 transitions. [2019-09-10 02:35:12,907 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4149 transitions. Word has length 135 [2019-09-10 02:35:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:12,908 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4149 transitions. [2019-09-10 02:35:12,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:35:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4149 transitions. [2019-09-10 02:35:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:35:12,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:12,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:12,912 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775240, now seen corresponding path program 1 times [2019-09-10 02:35:12,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:12,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:35:13,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:13,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:13,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:13,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:13,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:13,126 INFO L87 Difference]: Start difference. First operand 2542 states and 4149 transitions. Second operand 7 states. [2019-09-10 02:35:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:13,285 INFO L93 Difference]: Finished difference Result 2782 states and 4534 transitions. [2019-09-10 02:35:13,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:35:13,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-10 02:35:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:13,305 INFO L225 Difference]: With dead ends: 2782 [2019-09-10 02:35:13,305 INFO L226 Difference]: Without dead ends: 2542 [2019-09-10 02:35:13,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:35:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-09-10 02:35:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2019-09-10 02:35:13,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-09-10 02:35:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4103 transitions. [2019-09-10 02:35:13,387 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4103 transitions. Word has length 142 [2019-09-10 02:35:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:13,388 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4103 transitions. [2019-09-10 02:35:13,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4103 transitions. [2019-09-10 02:35:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:35:13,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:13,393 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:13,393 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1238042262, now seen corresponding path program 1 times [2019-09-10 02:35:13,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:13,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:35:13,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:13,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:35:13,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:13,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:35:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:35:13,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:35:13,540 INFO L87 Difference]: Start difference. First operand 2542 states and 4103 transitions. Second operand 7 states. [2019-09-10 02:35:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:17,751 INFO L93 Difference]: Finished difference Result 2725 states and 4357 transitions. [2019-09-10 02:35:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:35:17,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-10 02:35:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:17,775 INFO L225 Difference]: With dead ends: 2725 [2019-09-10 02:35:17,775 INFO L226 Difference]: Without dead ends: 2725 [2019-09-10 02:35:17,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:35:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-09-10 02:35:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2658. [2019-09-10 02:35:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-09-10 02:35:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4259 transitions. [2019-09-10 02:35:17,856 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4259 transitions. Word has length 147 [2019-09-10 02:35:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:17,856 INFO L475 AbstractCegarLoop]: Abstraction has 2658 states and 4259 transitions. [2019-09-10 02:35:17,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:35:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4259 transitions. [2019-09-10 02:35:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:35:17,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:17,861 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:17,862 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash 115535751, now seen corresponding path program 1 times [2019-09-10 02:35:17,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:17,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:17,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:17,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:35:17,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:17,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:35:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:35:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:35:17,974 INFO L87 Difference]: Start difference. First operand 2658 states and 4259 transitions. Second operand 6 states. [2019-09-10 02:35:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:18,147 INFO L93 Difference]: Finished difference Result 3758 states and 6060 transitions. [2019-09-10 02:35:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:35:18,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-10 02:35:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:18,191 INFO L225 Difference]: With dead ends: 3758 [2019-09-10 02:35:18,192 INFO L226 Difference]: Without dead ends: 3758 [2019-09-10 02:35:18,192 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:35:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-09-10 02:35:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3524. [2019-09-10 02:35:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-10 02:35:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5688 transitions. [2019-09-10 02:35:18,349 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5688 transitions. Word has length 152 [2019-09-10 02:35:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:18,350 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5688 transitions. [2019-09-10 02:35:18,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:35:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5688 transitions. [2019-09-10 02:35:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 02:35:18,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:18,355 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:18,356 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 799851757, now seen corresponding path program 1 times [2019-09-10 02:35:18,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:18,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:18,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:18,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:18,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:18,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:35:18,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:18,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:35:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:35:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:35:18,523 INFO L87 Difference]: Start difference. First operand 3524 states and 5688 transitions. Second operand 11 states. [2019-09-10 02:35:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:27,389 INFO L93 Difference]: Finished difference Result 4386 states and 6999 transitions. [2019-09-10 02:35:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:35:27,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-10 02:35:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:27,413 INFO L225 Difference]: With dead ends: 4386 [2019-09-10 02:35:27,413 INFO L226 Difference]: Without dead ends: 4380 [2019-09-10 02:35:27,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:35:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2019-09-10 02:35:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4110. [2019-09-10 02:35:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2019-09-10 02:35:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 6545 transitions. [2019-09-10 02:35:27,533 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 6545 transitions. Word has length 154 [2019-09-10 02:35:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:27,534 INFO L475 AbstractCegarLoop]: Abstraction has 4110 states and 6545 transitions. [2019-09-10 02:35:27,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:35:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 6545 transitions. [2019-09-10 02:35:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 02:35:27,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:27,538 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:27,539 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 43149193, now seen corresponding path program 1 times [2019-09-10 02:35:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:27,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:27,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:27,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:27,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:27,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:27,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:27,707 INFO L87 Difference]: Start difference. First operand 4110 states and 6545 transitions. Second operand 10 states. [2019-09-10 02:35:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:33,879 INFO L93 Difference]: Finished difference Result 8755 states and 14100 transitions. [2019-09-10 02:35:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:33,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 02:35:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:33,921 INFO L225 Difference]: With dead ends: 8755 [2019-09-10 02:35:33,921 INFO L226 Difference]: Without dead ends: 8755 [2019-09-10 02:35:33,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2019-09-10 02:35:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 8659. [2019-09-10 02:35:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8659 states. [2019-09-10 02:35:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8659 states to 8659 states and 13902 transitions. [2019-09-10 02:35:34,181 INFO L78 Accepts]: Start accepts. Automaton has 8659 states and 13902 transitions. Word has length 152 [2019-09-10 02:35:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:34,181 INFO L475 AbstractCegarLoop]: Abstraction has 8659 states and 13902 transitions. [2019-09-10 02:35:34,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8659 states and 13902 transitions. [2019-09-10 02:35:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 02:35:34,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:34,186 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:34,187 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1980816055, now seen corresponding path program 1 times [2019-09-10 02:35:34,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:34,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:34,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:34,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:34,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:34,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:34,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:34,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:34,349 INFO L87 Difference]: Start difference. First operand 8659 states and 13902 transitions. Second operand 10 states. [2019-09-10 02:35:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:40,667 INFO L93 Difference]: Finished difference Result 18927 states and 30930 transitions. [2019-09-10 02:35:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:40,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-10 02:35:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:40,827 INFO L225 Difference]: With dead ends: 18927 [2019-09-10 02:35:40,828 INFO L226 Difference]: Without dead ends: 18927 [2019-09-10 02:35:40,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2019-09-10 02:35:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 18754. [2019-09-10 02:35:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-09-10 02:35:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 30516 transitions. [2019-09-10 02:35:41,372 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 30516 transitions. Word has length 153 [2019-09-10 02:35:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:41,373 INFO L475 AbstractCegarLoop]: Abstraction has 18754 states and 30516 transitions. [2019-09-10 02:35:41,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 30516 transitions. [2019-09-10 02:35:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:35:41,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:41,379 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:41,380 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1908202704, now seen corresponding path program 1 times [2019-09-10 02:35:41,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:41,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:41,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:41,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:41,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:41,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:41,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:41,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:41,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:41,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:41,533 INFO L87 Difference]: Start difference. First operand 18754 states and 30516 transitions. Second operand 10 states. [2019-09-10 02:35:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:48,232 INFO L93 Difference]: Finished difference Result 42074 states and 70262 transitions. [2019-09-10 02:35:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:48,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 02:35:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:48,491 INFO L225 Difference]: With dead ends: 42074 [2019-09-10 02:35:48,492 INFO L226 Difference]: Without dead ends: 42074 [2019-09-10 02:35:48,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42074 states. [2019-09-10 02:35:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42074 to 41747. [2019-09-10 02:35:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41747 states. [2019-09-10 02:35:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41747 states to 41747 states and 69296 transitions. [2019-09-10 02:35:49,974 INFO L78 Accepts]: Start accepts. Automaton has 41747 states and 69296 transitions. Word has length 156 [2019-09-10 02:35:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:35:49,975 INFO L475 AbstractCegarLoop]: Abstraction has 41747 states and 69296 transitions. [2019-09-10 02:35:49,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:35:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41747 states and 69296 transitions. [2019-09-10 02:35:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:35:49,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:35:49,981 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:35:49,982 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:35:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:35:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1692075242, now seen corresponding path program 1 times [2019-09-10 02:35:49,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:35:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:49,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:35:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:35:49,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:35:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:35:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:35:50,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:35:50,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:35:50,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:35:50,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:35:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:35:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:35:50,139 INFO L87 Difference]: Start difference. First operand 41747 states and 69296 transitions. Second operand 10 states. [2019-09-10 02:35:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:57,874 INFO L93 Difference]: Finished difference Result 96484 states and 166269 transitions. [2019-09-10 02:35:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:35:57,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2019-09-10 02:35:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:58,390 INFO L225 Difference]: With dead ends: 96484 [2019-09-10 02:35:58,391 INFO L226 Difference]: Without dead ends: 96484 [2019-09-10 02:35:58,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:35:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96484 states. [2019-09-10 02:36:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96484 to 95849. [2019-09-10 02:36:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95849 states. [2019-09-10 02:36:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95849 states to 95849 states and 163719 transitions. [2019-09-10 02:36:03,981 INFO L78 Accepts]: Start accepts. Automaton has 95849 states and 163719 transitions. Word has length 157 [2019-09-10 02:36:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:03,982 INFO L475 AbstractCegarLoop]: Abstraction has 95849 states and 163719 transitions. [2019-09-10 02:36:03,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 95849 states and 163719 transitions. [2019-09-10 02:36:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:36:03,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:03,989 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:03,989 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:03,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1188270993, now seen corresponding path program 1 times [2019-09-10 02:36:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:03,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:04,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:04,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:04,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:04,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:04,129 INFO L87 Difference]: Start difference. First operand 95849 states and 163719 transitions. Second operand 10 states. [2019-09-10 02:36:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:16,068 INFO L93 Difference]: Finished difference Result 229611 states and 414085 transitions. [2019-09-10 02:36:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:16,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 02:36:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:17,416 INFO L225 Difference]: With dead ends: 229611 [2019-09-10 02:36:17,416 INFO L226 Difference]: Without dead ends: 229611 [2019-09-10 02:36:17,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229611 states. [2019-09-10 02:36:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229611 to 228360. [2019-09-10 02:36:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228360 states. [2019-09-10 02:36:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228360 states to 228360 states and 406447 transitions. [2019-09-10 02:36:30,401 INFO L78 Accepts]: Start accepts. Automaton has 228360 states and 406447 transitions. Word has length 156 [2019-09-10 02:36:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:30,402 INFO L475 AbstractCegarLoop]: Abstraction has 228360 states and 406447 transitions. [2019-09-10 02:36:30,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 228360 states and 406447 transitions. [2019-09-10 02:36:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:36:30,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:30,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:30,412 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1543780398, now seen corresponding path program 1 times [2019-09-10 02:36:30,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:30,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:30,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:30,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:36:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:30,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:36:30,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:30,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:36:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:36:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:30,511 INFO L87 Difference]: Start difference. First operand 228360 states and 406447 transitions. Second operand 3 states. [2019-09-10 02:36:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:42,041 INFO L93 Difference]: Finished difference Result 456643 states and 871555 transitions. [2019-09-10 02:36:42,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:36:42,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-10 02:36:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:44,724 INFO L225 Difference]: With dead ends: 456643 [2019-09-10 02:36:44,725 INFO L226 Difference]: Without dead ends: 456643 [2019-09-10 02:36:44,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:36:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456643 states. [2019-09-10 02:37:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456643 to 456641. [2019-09-10 02:37:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456641 states. [2019-09-10 02:37:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456641 states to 456641 states and 871554 transitions. [2019-09-10 02:37:29,735 INFO L78 Accepts]: Start accepts. Automaton has 456641 states and 871554 transitions. Word has length 157 [2019-09-10 02:37:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:29,735 INFO L475 AbstractCegarLoop]: Abstraction has 456641 states and 871554 transitions. [2019-09-10 02:37:29,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:37:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 456641 states and 871554 transitions. [2019-09-10 02:37:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:37:29,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:29,747 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] [2019-09-10 02:37:29,747 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -613818356, now seen corresponding path program 1 times [2019-09-10 02:37:29,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:29,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:29,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:29,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:29,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:29,857 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:37:29,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:29,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:37:29,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:29,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:37:29,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:37:29,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:37:29,859 INFO L87 Difference]: Start difference. First operand 456641 states and 871554 transitions. Second operand 3 states. [2019-09-10 02:38:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:03,515 INFO L93 Difference]: Finished difference Result 913207 states and 1932477 transitions. [2019-09-10 02:38:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:38:03,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-09-10 02:38:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:13,100 INFO L225 Difference]: With dead ends: 913207 [2019-09-10 02:38:13,100 INFO L226 Difference]: Without dead ends: 913207 [2019-09-10 02:38:13,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:38:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913207 states.