java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:33,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:33,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:33,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:33,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:33,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:33,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:33,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:33,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:33,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:33,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:33,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:33,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:33,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:33,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:33,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:33,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:33,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:33,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:33,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:33,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:33,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:33,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:33,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:33,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:33,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:33,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:33,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:33,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:33,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:33,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:33,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:33,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:33,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:33,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:33,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:33,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:33,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:33,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:33,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:33,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:33,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:31:33,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:33,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:33,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:33,569 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:33,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:33,570 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:33,571 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:33,571 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:33,571 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:33,571 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:33,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:33,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:33,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:33,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:33,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:33,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:33,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:33,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:33,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:33,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:33,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:33,574 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:33,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:33,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:33,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:33,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:33,576 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:33,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:33,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:33,577 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:33,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:33,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:33,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:33,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:33,659 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:33,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-09-10 02:31:33,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebabe40c/58b4cc7182064df8908c2269797b3e29/FLAGa2f714ed9 [2019-09-10 02:31:34,395 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:34,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-09-10 02:31:34,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebabe40c/58b4cc7182064df8908c2269797b3e29/FLAGa2f714ed9 [2019-09-10 02:31:34,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ebabe40c/58b4cc7182064df8908c2269797b3e29 [2019-09-10 02:31:34,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:34,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:34,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:34,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:34,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:34,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:34" (1/1) ... [2019-09-10 02:31:34,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a36dcf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:34, skipping insertion in model container [2019-09-10 02:31:34,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:34" (1/1) ... [2019-09-10 02:31:34,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:34,693 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:35,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:35,499 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:35,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:35,757 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:35,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35 WrapperNode [2019-09-10 02:31:35,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:35,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:35,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:35,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:35,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... [2019-09-10 02:31:35,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:35,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:35,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:35,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:35,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:36,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:36,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:36,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:36,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:36,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:36,061 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:36,061 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:36,062 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:36,063 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:36,064 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:36,069 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:36,070 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:36,071 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:36,072 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:36,073 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:36,074 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:36,074 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:36,077 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:36,082 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:36,083 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:36,088 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:36,089 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:36,090 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:36,091 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:36,094 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:36,102 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:36,103 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:36,104 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:38,304 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:38,305 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:38,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:38 BoogieIcfgContainer [2019-09-10 02:31:38,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:38,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:38,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:38,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:38,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:34" (1/3) ... [2019-09-10 02:31:38,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a008f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:38, skipping insertion in model container [2019-09-10 02:31:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:35" (2/3) ... [2019-09-10 02:31:38,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6a008f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:38, skipping insertion in model container [2019-09-10 02:31:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:38" (3/3) ... [2019-09-10 02:31:38,316 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2019-09-10 02:31:38,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:38,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:38,364 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:38,400 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:38,401 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:38,401 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:38,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:38,401 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:38,402 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:38,402 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:38,402 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states. [2019-09-10 02:31:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:31:38,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:38,479 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] [2019-09-10 02:31:38,482 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1453471950, now seen corresponding path program 1 times [2019-09-10 02:31:38,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:38,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:38,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:38,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:39,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:39,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:39,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:39,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:39,169 INFO L87 Difference]: Start difference. First operand 773 states. Second operand 4 states. [2019-09-10 02:31:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:39,344 INFO L93 Difference]: Finished difference Result 624 states and 992 transitions. [2019-09-10 02:31:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:39,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 02:31:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:39,379 INFO L225 Difference]: With dead ends: 624 [2019-09-10 02:31:39,379 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 02:31:39,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 02:31:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-10 02:31:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:31:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 980 transitions. [2019-09-10 02:31:39,502 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 980 transitions. Word has length 124 [2019-09-10 02:31:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:39,502 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 980 transitions. [2019-09-10 02:31:39,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 980 transitions. [2019-09-10 02:31:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:31:39,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:39,515 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] [2019-09-10 02:31:39,515 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash -491101009, now seen corresponding path program 1 times [2019-09-10 02:31:39,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:39,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:39,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:39,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:39,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:39,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:39,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:39,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:39,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:39,802 INFO L87 Difference]: Start difference. First operand 613 states and 980 transitions. Second operand 4 states. [2019-09-10 02:31:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:39,869 INFO L93 Difference]: Finished difference Result 615 states and 981 transitions. [2019-09-10 02:31:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:39,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 02:31:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:39,881 INFO L225 Difference]: With dead ends: 615 [2019-09-10 02:31:39,881 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 02:31:39,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 02:31:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-10 02:31:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:31:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 979 transitions. [2019-09-10 02:31:39,938 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 979 transitions. Word has length 127 [2019-09-10 02:31:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:39,940 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 979 transitions. [2019-09-10 02:31:39,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 979 transitions. [2019-09-10 02:31:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:31:39,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:39,954 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] [2019-09-10 02:31:39,954 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2141971607, now seen corresponding path program 1 times [2019-09-10 02:31:39,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:39,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:39,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:39,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:39,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:40,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:40,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:40,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:40,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:40,189 INFO L87 Difference]: Start difference. First operand 613 states and 979 transitions. Second operand 4 states. [2019-09-10 02:31:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:40,295 INFO L93 Difference]: Finished difference Result 615 states and 980 transitions. [2019-09-10 02:31:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:40,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 02:31:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:40,305 INFO L225 Difference]: With dead ends: 615 [2019-09-10 02:31:40,305 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 02:31:40,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 02:31:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-10 02:31:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:31:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 978 transitions. [2019-09-10 02:31:40,341 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 978 transitions. Word has length 128 [2019-09-10 02:31:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:40,342 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 978 transitions. [2019-09-10 02:31:40,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 978 transitions. [2019-09-10 02:31:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:31:40,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:40,347 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] [2019-09-10 02:31:40,347 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 923417843, now seen corresponding path program 1 times [2019-09-10 02:31:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:40,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:40,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:40,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:40,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:40,515 INFO L87 Difference]: Start difference. First operand 613 states and 978 transitions. Second operand 4 states. [2019-09-10 02:31:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:40,577 INFO L93 Difference]: Finished difference Result 615 states and 979 transitions. [2019-09-10 02:31:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:40,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 02:31:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:40,583 INFO L225 Difference]: With dead ends: 615 [2019-09-10 02:31:40,584 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 02:31:40,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 02:31:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-10 02:31:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:31:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 977 transitions. [2019-09-10 02:31:40,611 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 977 transitions. Word has length 129 [2019-09-10 02:31:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:40,612 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 977 transitions. [2019-09-10 02:31:40,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 977 transitions. [2019-09-10 02:31:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:31:40,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:40,617 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] [2019-09-10 02:31:40,617 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash -130986579, now seen corresponding path program 1 times [2019-09-10 02:31:40,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:40,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:40,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:40,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:40,734 INFO L87 Difference]: Start difference. First operand 613 states and 977 transitions. Second operand 4 states. [2019-09-10 02:31:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:40,781 INFO L93 Difference]: Finished difference Result 615 states and 978 transitions. [2019-09-10 02:31:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:40,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 02:31:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:40,787 INFO L225 Difference]: With dead ends: 615 [2019-09-10 02:31:40,787 INFO L226 Difference]: Without dead ends: 613 [2019-09-10 02:31:40,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-10 02:31:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-10 02:31:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-10 02:31:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 976 transitions. [2019-09-10 02:31:40,807 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 976 transitions. Word has length 130 [2019-09-10 02:31:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:40,808 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 976 transitions. [2019-09-10 02:31:40,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 976 transitions. [2019-09-10 02:31:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:31:40,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:40,815 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] [2019-09-10 02:31:40,815 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:40,816 INFO L82 PathProgramCache]: Analyzing trace with hash -49982153, now seen corresponding path program 1 times [2019-09-10 02:31:40,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:40,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:41,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:41,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:41,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:41,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:41,009 INFO L87 Difference]: Start difference. First operand 613 states and 976 transitions. Second operand 10 states. [2019-09-10 02:31:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:41,224 INFO L93 Difference]: Finished difference Result 622 states and 987 transitions. [2019-09-10 02:31:41,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:41,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-10 02:31:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:41,233 INFO L225 Difference]: With dead ends: 622 [2019-09-10 02:31:41,234 INFO L226 Difference]: Without dead ends: 622 [2019-09-10 02:31:41,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:31:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-10 02:31:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-09-10 02:31:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:31:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-09-10 02:31:41,267 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-09-10 02:31:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:41,267 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-09-10 02:31:41,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-09-10 02:31:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:31:41,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:41,274 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] [2019-09-10 02:31:41,275 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 625710456, now seen corresponding path program 1 times [2019-09-10 02:31:41,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:41,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:41,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:41,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:41,439 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-09-10 02:31:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:41,496 INFO L93 Difference]: Finished difference Result 618 states and 980 transitions. [2019-09-10 02:31:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:41,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 02:31:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:41,504 INFO L225 Difference]: With dead ends: 618 [2019-09-10 02:31:41,504 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:31:41,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:31:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:31:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:31:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:31:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 962 transitions. [2019-09-10 02:31:41,533 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 962 transitions. Word has length 131 [2019-09-10 02:31:41,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:41,534 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 962 transitions. [2019-09-10 02:31:41,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 962 transitions. [2019-09-10 02:31:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:31:41,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:41,540 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] [2019-09-10 02:31:41,541 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:41,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1002453247, now seen corresponding path program 1 times [2019-09-10 02:31:41,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:41,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:41,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:41,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:41,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:41,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:41,726 INFO L87 Difference]: Start difference. First operand 607 states and 962 transitions. Second operand 6 states. [2019-09-10 02:31:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:41,994 INFO L93 Difference]: Finished difference Result 610 states and 965 transitions. [2019-09-10 02:31:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:41,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 02:31:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:42,000 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:31:42,001 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:31:42,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:31:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:31:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:31:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 958 transitions. [2019-09-10 02:31:42,026 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 958 transitions. Word has length 132 [2019-09-10 02:31:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:42,029 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 958 transitions. [2019-09-10 02:31:42,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 958 transitions. [2019-09-10 02:31:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:42,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,037 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] [2019-09-10 02:31:42,038 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1646126772, now seen corresponding path program 1 times [2019-09-10 02:31:42,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:42,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:42,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:42,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:42,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:42,230 INFO L87 Difference]: Start difference. First operand 607 states and 958 transitions. Second operand 6 states. [2019-09-10 02:31:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:42,421 INFO L93 Difference]: Finished difference Result 610 states and 961 transitions. [2019-09-10 02:31:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:42,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 02:31:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:42,427 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:31:42,428 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:31:42,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:31:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:31:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:31:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 954 transitions. [2019-09-10 02:31:42,451 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 954 transitions. Word has length 133 [2019-09-10 02:31:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:42,451 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 954 transitions. [2019-09-10 02:31:42,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 954 transitions. [2019-09-10 02:31:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:31:42,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,457 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] [2019-09-10 02:31:42,457 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1808478140, now seen corresponding path program 1 times [2019-09-10 02:31:42,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:42,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:42,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:42,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:42,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:42,605 INFO L87 Difference]: Start difference. First operand 607 states and 954 transitions. Second operand 6 states. [2019-09-10 02:31:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:42,811 INFO L93 Difference]: Finished difference Result 610 states and 957 transitions. [2019-09-10 02:31:42,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:42,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 02:31:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:42,819 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:31:42,819 INFO L226 Difference]: Without dead ends: 607 [2019-09-10 02:31:42,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-10 02:31:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-10 02:31:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 02:31:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 950 transitions. [2019-09-10 02:31:42,842 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 950 transitions. Word has length 134 [2019-09-10 02:31:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:42,842 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 950 transitions. [2019-09-10 02:31:42,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 950 transitions. [2019-09-10 02:31:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:31:42,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,851 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] [2019-09-10 02:31:42,852 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1695866052, now seen corresponding path program 1 times [2019-09-10 02:31:42,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:43,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:43,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:43,047 INFO L87 Difference]: Start difference. First operand 607 states and 950 transitions. Second operand 7 states. [2019-09-10 02:31:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:43,147 INFO L93 Difference]: Finished difference Result 610 states and 953 transitions. [2019-09-10 02:31:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:43,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-09-10 02:31:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:43,155 INFO L225 Difference]: With dead ends: 610 [2019-09-10 02:31:43,155 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:31:43,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:31:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-09-10 02:31:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-10 02:31:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 916 transitions. [2019-09-10 02:31:43,182 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 916 transitions. Word has length 134 [2019-09-10 02:31:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:43,182 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 916 transitions. [2019-09-10 02:31:43,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 916 transitions. [2019-09-10 02:31:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:31:43,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:43,191 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] [2019-09-10 02:31:43,191 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2087814641, now seen corresponding path program 1 times [2019-09-10 02:31:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:43,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:43,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:43,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:43,389 INFO L87 Difference]: Start difference. First operand 586 states and 916 transitions. Second operand 6 states. [2019-09-10 02:31:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:43,491 INFO L93 Difference]: Finished difference Result 589 states and 919 transitions. [2019-09-10 02:31:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:43,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 02:31:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:43,498 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:31:43,498 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:31:43,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:31:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-09-10 02:31:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-10 02:31:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 915 transitions. [2019-09-10 02:31:43,523 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 915 transitions. Word has length 135 [2019-09-10 02:31:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:43,524 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 915 transitions. [2019-09-10 02:31:43,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 915 transitions. [2019-09-10 02:31:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:31:43,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:43,529 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] [2019-09-10 02:31:43,529 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1341910135, now seen corresponding path program 1 times [2019-09-10 02:31:43,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:43,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:43,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:43,664 INFO L87 Difference]: Start difference. First operand 586 states and 915 transitions. Second operand 6 states. [2019-09-10 02:31:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:43,755 INFO L93 Difference]: Finished difference Result 589 states and 918 transitions. [2019-09-10 02:31:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:43,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 02:31:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:43,760 INFO L225 Difference]: With dead ends: 589 [2019-09-10 02:31:43,761 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:31:43,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:31:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:31:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-09-10 02:31:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-10 02:31:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-09-10 02:31:43,782 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 136 [2019-09-10 02:31:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:43,784 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-09-10 02:31:43,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-09-10 02:31:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:31:43,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:43,788 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] [2019-09-10 02:31:43,789 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -50054806, now seen corresponding path program 1 times [2019-09-10 02:31:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:43,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:43,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:43,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:43,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:43,991 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 12 states. [2019-09-10 02:31:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:44,161 INFO L93 Difference]: Finished difference Result 590 states and 917 transitions. [2019-09-10 02:31:44,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:44,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-09-10 02:31:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:44,167 INFO L225 Difference]: With dead ends: 590 [2019-09-10 02:31:44,168 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 02:31:44,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:31:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 02:31:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-09-10 02:31:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-10 02:31:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 913 transitions. [2019-09-10 02:31:44,187 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 913 transitions. Word has length 137 [2019-09-10 02:31:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:44,188 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 913 transitions. [2019-09-10 02:31:44,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 913 transitions. [2019-09-10 02:31:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:31:44,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:44,192 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] [2019-09-10 02:31:44,193 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:44,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -749925748, now seen corresponding path program 1 times [2019-09-10 02:31:44,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:44,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:44,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:44,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:44,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:44,400 INFO L87 Difference]: Start difference. First operand 586 states and 913 transitions. Second operand 6 states. [2019-09-10 02:31:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,552 INFO L93 Difference]: Finished difference Result 1207 states and 1933 transitions. [2019-09-10 02:31:48,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:31:48,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-10 02:31:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,563 INFO L225 Difference]: With dead ends: 1207 [2019-09-10 02:31:48,563 INFO L226 Difference]: Without dead ends: 1207 [2019-09-10 02:31:48,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-09-10 02:31:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1124. [2019-09-10 02:31:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-10 02:31:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1787 transitions. [2019-09-10 02:31:48,653 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1787 transitions. Word has length 138 [2019-09-10 02:31:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,654 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1787 transitions. [2019-09-10 02:31:48,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1787 transitions. [2019-09-10 02:31:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:31:48,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:48,660 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] [2019-09-10 02:31:48,660 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -84982961, now seen corresponding path program 1 times [2019-09-10 02:31:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:48,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:48,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:48,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:48,822 INFO L87 Difference]: Start difference. First operand 1124 states and 1787 transitions. Second operand 6 states. [2019-09-10 02:31:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:53,016 INFO L93 Difference]: Finished difference Result 2499 states and 4098 transitions. [2019-09-10 02:31:53,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:31:53,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-10 02:31:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:53,034 INFO L225 Difference]: With dead ends: 2499 [2019-09-10 02:31:53,035 INFO L226 Difference]: Without dead ends: 2499 [2019-09-10 02:31:53,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-09-10 02:31:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2306. [2019-09-10 02:31:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-09-10 02:31:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3726 transitions. [2019-09-10 02:31:53,128 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3726 transitions. Word has length 139 [2019-09-10 02:31:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:53,128 INFO L475 AbstractCegarLoop]: Abstraction has 2306 states and 3726 transitions. [2019-09-10 02:31:53,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3726 transitions. [2019-09-10 02:31:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:53,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:53,133 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] [2019-09-10 02:31:53,134 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash -708797968, now seen corresponding path program 1 times [2019-09-10 02:31:53,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:53,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:53,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:53,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:53,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:53,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:53,298 INFO L87 Difference]: Start difference. First operand 2306 states and 3726 transitions. Second operand 6 states. [2019-09-10 02:31:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:57,484 INFO L93 Difference]: Finished difference Result 5464 states and 9173 transitions. [2019-09-10 02:31:57,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:31:57,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 02:31:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:57,521 INFO L225 Difference]: With dead ends: 5464 [2019-09-10 02:31:57,521 INFO L226 Difference]: Without dead ends: 5464 [2019-09-10 02:31:57,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-09-10 02:31:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4964. [2019-09-10 02:31:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4964 states. [2019-09-10 02:31:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8151 transitions. [2019-09-10 02:31:57,714 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8151 transitions. Word has length 140 [2019-09-10 02:31:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:57,717 INFO L475 AbstractCegarLoop]: Abstraction has 4964 states and 8151 transitions. [2019-09-10 02:31:57,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8151 transitions. [2019-09-10 02:31:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:31:57,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:57,724 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] [2019-09-10 02:31:57,725 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1665568371, now seen corresponding path program 1 times [2019-09-10 02:31:57,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:57,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:57,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:57,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:31:57,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:57,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:57,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:57,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:57,890 INFO L87 Difference]: Start difference. First operand 4964 states and 8151 transitions. Second operand 6 states. [2019-09-10 02:32:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:01,870 INFO L93 Difference]: Finished difference Result 12479 states and 21496 transitions. [2019-09-10 02:32:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:01,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:32:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:01,966 INFO L225 Difference]: With dead ends: 12479 [2019-09-10 02:32:01,966 INFO L226 Difference]: Without dead ends: 12479 [2019-09-10 02:32:01,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2019-09-10 02:32:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11114. [2019-09-10 02:32:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-09-10 02:32:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 18594 transitions. [2019-09-10 02:32:02,433 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 18594 transitions. Word has length 141 [2019-09-10 02:32:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:02,433 INFO L475 AbstractCegarLoop]: Abstraction has 11114 states and 18594 transitions. [2019-09-10 02:32:02,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 18594 transitions. [2019-09-10 02:32:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:32:02,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:02,438 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] [2019-09-10 02:32:02,438 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691372, now seen corresponding path program 1 times [2019-09-10 02:32:02,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:02,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:02,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:02,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:02,691 INFO L87 Difference]: Start difference. First operand 11114 states and 18594 transitions. Second operand 6 states. [2019-09-10 02:32:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:07,480 INFO L93 Difference]: Finished difference Result 29618 states and 52491 transitions. [2019-09-10 02:32:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:07,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:32:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:07,718 INFO L225 Difference]: With dead ends: 29618 [2019-09-10 02:32:07,719 INFO L226 Difference]: Without dead ends: 29618 [2019-09-10 02:32:07,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29618 states. [2019-09-10 02:32:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29618 to 25800. [2019-09-10 02:32:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25800 states. [2019-09-10 02:32:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25800 states to 25800 states and 44135 transitions. [2019-09-10 02:32:10,267 INFO L78 Accepts]: Start accepts. Automaton has 25800 states and 44135 transitions. Word has length 142 [2019-09-10 02:32:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:10,267 INFO L475 AbstractCegarLoop]: Abstraction has 25800 states and 44135 transitions. [2019-09-10 02:32:10,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25800 states and 44135 transitions. [2019-09-10 02:32:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:32:10,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:10,276 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] [2019-09-10 02:32:10,277 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:10,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash -667500779, now seen corresponding path program 1 times [2019-09-10 02:32:10,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:10,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:10,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:10,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:10,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:32:10,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:10,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:32:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:32:10,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:32:10,423 INFO L87 Difference]: Start difference. First operand 25800 states and 44135 transitions. Second operand 9 states. [2019-09-10 02:32:17,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:17,111 INFO L93 Difference]: Finished difference Result 57391 states and 97969 transitions. [2019-09-10 02:32:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:32:17,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 142 [2019-09-10 02:32:17,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:17,614 INFO L225 Difference]: With dead ends: 57391 [2019-09-10 02:32:17,615 INFO L226 Difference]: Without dead ends: 57391 [2019-09-10 02:32:17,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:32:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57391 states. [2019-09-10 02:32:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57391 to 56572. [2019-09-10 02:32:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56572 states. [2019-09-10 02:32:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56572 states to 56572 states and 96179 transitions. [2019-09-10 02:32:19,606 INFO L78 Accepts]: Start accepts. Automaton has 56572 states and 96179 transitions. Word has length 142 [2019-09-10 02:32:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:19,606 INFO L475 AbstractCegarLoop]: Abstraction has 56572 states and 96179 transitions. [2019-09-10 02:32:19,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:32:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 56572 states and 96179 transitions. [2019-09-10 02:32:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:32:19,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:19,613 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:32:19,614 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1507242393, now seen corresponding path program 1 times [2019-09-10 02:32:19,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:19,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:19,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:19,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:19,746 INFO L87 Difference]: Start difference. First operand 56572 states and 96179 transitions. Second operand 7 states. [2019-09-10 02:32:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:21,784 INFO L93 Difference]: Finished difference Result 57948 states and 98133 transitions. [2019-09-10 02:32:21,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:21,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-10 02:32:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:22,239 INFO L225 Difference]: With dead ends: 57948 [2019-09-10 02:32:22,240 INFO L226 Difference]: Without dead ends: 57948 [2019-09-10 02:32:22,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57948 states. [2019-09-10 02:32:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57948 to 57244. [2019-09-10 02:32:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57244 states. [2019-09-10 02:32:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57244 states to 57244 states and 97139 transitions. [2019-09-10 02:32:24,156 INFO L78 Accepts]: Start accepts. Automaton has 57244 states and 97139 transitions. Word has length 147 [2019-09-10 02:32:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:24,157 INFO L475 AbstractCegarLoop]: Abstraction has 57244 states and 97139 transitions. [2019-09-10 02:32:24,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57244 states and 97139 transitions. [2019-09-10 02:32:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:32:24,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:24,161 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:24,161 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 417651110, now seen corresponding path program 1 times [2019-09-10 02:32:24,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:24,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:24,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:24,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:24,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:24,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:24,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:24,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:24,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:24,279 INFO L87 Difference]: Start difference. First operand 57244 states and 97139 transitions. Second operand 7 states. [2019-09-10 02:32:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:24,962 INFO L93 Difference]: Finished difference Result 58428 states and 98709 transitions. [2019-09-10 02:32:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:24,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2019-09-10 02:32:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:25,341 INFO L225 Difference]: With dead ends: 58428 [2019-09-10 02:32:25,342 INFO L226 Difference]: Without dead ends: 58428 [2019-09-10 02:32:25,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58428 states. [2019-09-10 02:32:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58428 to 57340. [2019-09-10 02:32:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57340 states. [2019-09-10 02:32:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57340 states to 57340 states and 97235 transitions. [2019-09-10 02:32:28,581 INFO L78 Accepts]: Start accepts. Automaton has 57340 states and 97235 transitions. Word has length 148 [2019-09-10 02:32:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:28,581 INFO L475 AbstractCegarLoop]: Abstraction has 57340 states and 97235 transitions. [2019-09-10 02:32:28,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 57340 states and 97235 transitions. [2019-09-10 02:32:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:32:28,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:28,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:28,586 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -374692248, now seen corresponding path program 1 times [2019-09-10 02:32:28,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:28,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:28,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:28,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:28,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:32:28,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:28,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:32:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:32:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:28,697 INFO L87 Difference]: Start difference. First operand 57340 states and 97235 transitions. Second operand 5 states. [2019-09-10 02:32:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:29,577 INFO L93 Difference]: Finished difference Result 57828 states and 97898 transitions. [2019-09-10 02:32:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:32:29,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 02:32:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:30,020 INFO L225 Difference]: With dead ends: 57828 [2019-09-10 02:32:30,020 INFO L226 Difference]: Without dead ends: 57828 [2019-09-10 02:32:30,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57828 states. [2019-09-10 02:32:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57828 to 57332. [2019-09-10 02:32:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57332 states. [2019-09-10 02:32:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57332 states to 57332 states and 97216 transitions. [2019-09-10 02:32:31,859 INFO L78 Accepts]: Start accepts. Automaton has 57332 states and 97216 transitions. Word has length 148 [2019-09-10 02:32:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:31,859 INFO L475 AbstractCegarLoop]: Abstraction has 57332 states and 97216 transitions. [2019-09-10 02:32:31,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:32:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 57332 states and 97216 transitions. [2019-09-10 02:32:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:32:31,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:31,865 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:31,865 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1285408334, now seen corresponding path program 1 times [2019-09-10 02:32:31,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:31,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:31,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:32,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:32,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:32:32,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:32,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:32:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:32:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:32,082 INFO L87 Difference]: Start difference. First operand 57332 states and 97216 transitions. Second operand 8 states. [2019-09-10 02:32:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:38,039 INFO L93 Difference]: Finished difference Result 135589 states and 230884 transitions. [2019-09-10 02:32:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:32:38,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-09-10 02:32:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:38,842 INFO L225 Difference]: With dead ends: 135589 [2019-09-10 02:32:38,842 INFO L226 Difference]: Without dead ends: 135589 [2019-09-10 02:32:38,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:32:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135589 states. [2019-09-10 02:32:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135589 to 135459. [2019-09-10 02:32:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135459 states. [2019-09-10 02:32:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135459 states to 135459 states and 230716 transitions. [2019-09-10 02:32:45,003 INFO L78 Accepts]: Start accepts. Automaton has 135459 states and 230716 transitions. Word has length 157 [2019-09-10 02:32:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:45,003 INFO L475 AbstractCegarLoop]: Abstraction has 135459 states and 230716 transitions. [2019-09-10 02:32:45,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:32:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 135459 states and 230716 transitions. [2019-09-10 02:32:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:32:45,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:45,007 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:45,008 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash 98015881, now seen corresponding path program 1 times [2019-09-10 02:32:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:45,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:45,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:45,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:45,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:45,152 INFO L87 Difference]: Start difference. First operand 135459 states and 230716 transitions. Second operand 7 states. [2019-09-10 02:32:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:47,752 INFO L93 Difference]: Finished difference Result 136291 states and 231484 transitions. [2019-09-10 02:32:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:32:47,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 02:32:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:48,713 INFO L225 Difference]: With dead ends: 136291 [2019-09-10 02:32:48,713 INFO L226 Difference]: Without dead ends: 136227 [2019-09-10 02:32:48,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136227 states. [2019-09-10 02:32:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136227 to 136227. [2019-09-10 02:32:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136227 states. [2019-09-10 02:32:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136227 states to 136227 states and 231420 transitions. [2019-09-10 02:32:53,014 INFO L78 Accepts]: Start accepts. Automaton has 136227 states and 231420 transitions. Word has length 159 [2019-09-10 02:32:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:53,014 INFO L475 AbstractCegarLoop]: Abstraction has 136227 states and 231420 transitions. [2019-09-10 02:32:53,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 136227 states and 231420 transitions. [2019-09-10 02:32:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:32:53,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:53,020 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:32:53,021 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1830198483, now seen corresponding path program 1 times [2019-09-10 02:32:53,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:53,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:53,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:54,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:54,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:54,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:54,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:54,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:54,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:54,278 INFO L87 Difference]: Start difference. First operand 136227 states and 231420 transitions. Second operand 7 states. [2019-09-10 02:33:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:00,393 INFO L93 Difference]: Finished difference Result 141494 states and 240160 transitions. [2019-09-10 02:33:00,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:33:00,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-09-10 02:33:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:05,863 INFO L225 Difference]: With dead ends: 141494 [2019-09-10 02:33:05,863 INFO L226 Difference]: Without dead ends: 141494 [2019-09-10 02:33:05,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:33:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141494 states. [2019-09-10 02:33:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141494 to 139939. [2019-09-10 02:33:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139939 states. [2019-09-10 02:33:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139939 states to 139939 states and 236475 transitions. [2019-09-10 02:33:09,833 INFO L78 Accepts]: Start accepts. Automaton has 139939 states and 236475 transitions. Word has length 160 [2019-09-10 02:33:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:09,833 INFO L475 AbstractCegarLoop]: Abstraction has 139939 states and 236475 transitions. [2019-09-10 02:33:09,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:33:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 139939 states and 236475 transitions. [2019-09-10 02:33:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:33:09,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:09,840 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:09,841 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:09,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1095761754, now seen corresponding path program 1 times [2019-09-10 02:33:09,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:09,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:09,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:09,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:09,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:33:09,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:09,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:09,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:09,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:09,949 INFO L87 Difference]: Start difference. First operand 139939 states and 236475 transitions. Second operand 6 states. [2019-09-10 02:33:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:15,796 INFO L93 Difference]: Finished difference Result 177396 states and 298738 transitions. [2019-09-10 02:33:15,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:15,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-10 02:33:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:17,207 INFO L225 Difference]: With dead ends: 177396 [2019-09-10 02:33:17,207 INFO L226 Difference]: Without dead ends: 177396 [2019-09-10 02:33:17,207 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:33:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177396 states. [2019-09-10 02:33:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177396 to 169198. [2019-09-10 02:33:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169198 states. [2019-09-10 02:33:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169198 states to 169198 states and 285872 transitions. [2019-09-10 02:33:22,688 INFO L78 Accepts]: Start accepts. Automaton has 169198 states and 285872 transitions. Word has length 164 [2019-09-10 02:33:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:22,688 INFO L475 AbstractCegarLoop]: Abstraction has 169198 states and 285872 transitions. [2019-09-10 02:33:22,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 169198 states and 285872 transitions. [2019-09-10 02:33:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:33:22,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:22,693 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:22,693 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1127805181, now seen corresponding path program 1 times [2019-09-10 02:33:22,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:22,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:22,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:33:22,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:22,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:33:22,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:22,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:33:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:33:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:33:22,821 INFO L87 Difference]: Start difference. First operand 169198 states and 285872 transitions. Second operand 4 states. [2019-09-10 02:33:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:35,616 INFO L93 Difference]: Finished difference Result 419403 states and 810598 transitions. [2019-09-10 02:33:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:33:35,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-10 02:33:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:38,521 INFO L225 Difference]: With dead ends: 419403 [2019-09-10 02:33:38,521 INFO L226 Difference]: Without dead ends: 419403 [2019-09-10 02:33:38,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:33:38,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419403 states. [2019-09-10 02:33:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419403 to 409511. [2019-09-10 02:33:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409511 states. [2019-09-10 02:34:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409511 states to 409511 states and 783011 transitions. [2019-09-10 02:34:09,933 INFO L78 Accepts]: Start accepts. Automaton has 409511 states and 783011 transitions. Word has length 165 [2019-09-10 02:34:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:09,933 INFO L475 AbstractCegarLoop]: Abstraction has 409511 states and 783011 transitions. [2019-09-10 02:34:09,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:34:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 409511 states and 783011 transitions. [2019-09-10 02:34:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 02:34:09,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:09,942 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:09,942 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -117940626, now seen corresponding path program 1 times [2019-09-10 02:34:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:09,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:09,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:09,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:34:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:10,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:10,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:10,070 INFO L87 Difference]: Start difference. First operand 409511 states and 783011 transitions. Second operand 4 states. [2019-09-10 02:35:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:04,848 INFO L93 Difference]: Finished difference Result 1051477 states and 2424699 transitions. [2019-09-10 02:35:04,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:35:04,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-10 02:35:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:14,728 INFO L225 Difference]: With dead ends: 1051477 [2019-09-10 02:35:14,729 INFO L226 Difference]: Without dead ends: 1051477 [2019-09-10 02:35:14,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:35:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051477 states.