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_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:43:17,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:43:17,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:43:17,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:43:17,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:43:17,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:43:17,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:43:17,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:43:17,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:43:17,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:43:17,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:43:17,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:43:17,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:43:17,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:43:17,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:43:17,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:43:17,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:43:17,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:43:17,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:43:17,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:43:17,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:43:17,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:43:17,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:43:17,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:43:17,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:43:17,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:43:17,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:43:17,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:43:17,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:43:17,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:43:17,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:43:17,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:43:17,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:43:17,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:43:17,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:43:17,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:43:17,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:43:17,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:43:17,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:43:17,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:43:17,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:43:17,512 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-10-03 02:43:17,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:43:17,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:43:17,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:43:17,529 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:43:17,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:43:17,530 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:43:17,530 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:43:17,530 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:43:17,530 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:43:17,530 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:43:17,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:43:17,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:43:17,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:43:17,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:43:17,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:43:17,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:43:17,533 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:43:17,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:43:17,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:43:17,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:43:17,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:43:17,534 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:43:17,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:43:17,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:43:17,535 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:43:17,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:43:17,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:43:17,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:43:17,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:43:17,583 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:43:17,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-10-03 02:43:17,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa6287a51/92440bfd79e8452e8eeecfa21468f84a/FLAG728582d74 [2019-10-03 02:43:18,372 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:43:18,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-10-03 02:43:18,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa6287a51/92440bfd79e8452e8eeecfa21468f84a/FLAG728582d74 [2019-10-03 02:43:18,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa6287a51/92440bfd79e8452e8eeecfa21468f84a [2019-10-03 02:43:18,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:43:18,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:43:18,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:43:18,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:43:18,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:43:18,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:43:18" (1/1) ... [2019-10-03 02:43:18,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5466f872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:18, skipping insertion in model container [2019-10-03 02:43:18,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:43:18" (1/1) ... [2019-10-03 02:43:18,548 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:43:18,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:43:19,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:43:19,541 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:43:19,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:43:19,701 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:43:19,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19 WrapperNode [2019-10-03 02:43:19,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:43:19,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:43:19,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:43:19,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:43:19,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (1/1) ... [2019-10-03 02:43:19,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:43:19,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:43:19,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:43:19,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:43:19,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (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-10-03 02:43:20,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:43:20,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:43:20,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:43:20,027 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:43:20,027 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:43:20,028 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:43:20,028 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:43:20,028 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:43:20,028 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:43:20,028 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:43:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:43:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:43:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:43:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:43:20,029 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:43:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:43:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:43:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:43:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:43:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:43:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:43:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:43:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:43:20,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:43:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:43:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:43:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:43:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:43:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:43:20,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:43:20,033 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:43:20,033 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:43:20,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:43:20,034 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:43:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:43:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:43:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:43:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:43:20,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:43:20,038 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:43:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:43:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:43:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:43:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:43:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:43:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:43:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:43:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:43:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:43:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:43:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:43:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:43:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:43:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:43:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:43:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:43:20,043 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:43:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:43:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:43:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:43:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:43:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:43:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:43:20,046 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:43:20,047 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:43:20,048 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:43:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:43:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:43:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:43:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:43:20,049 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:43:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:43:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:43:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:43:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:43:20,050 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:43:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:43:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:43:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:43:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:43:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:43:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:43:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:43:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:43:20,055 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:43:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:43:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:43:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:43:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:43:22,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:43:22,416 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:43:22,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:22 BoogieIcfgContainer [2019-10-03 02:43:22,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:43:22,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:43:22,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:43:22,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:43:22,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:43:18" (1/3) ... [2019-10-03 02:43:22,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ad5c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:22, skipping insertion in model container [2019-10-03 02:43:22,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:43:19" (2/3) ... [2019-10-03 02:43:22,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ad5c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:43:22, skipping insertion in model container [2019-10-03 02:43:22,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:43:22" (3/3) ... [2019-10-03 02:43:22,427 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2019-10-03 02:43:22,438 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:43:22,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:43:22,468 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:43:22,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:43:22,497 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:43:22,497 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:43:22,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:43:22,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:43:22,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:43:22,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:43:22,498 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:43:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states. [2019-10-03 02:43:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-03 02:43:22,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:22,597 INFO L411 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-10-03 02:43:22,602 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1653197611, now seen corresponding path program 1 times [2019-10-03 02:43:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:22,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:22,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:23,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:23,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:23,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:23,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:23,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:23,262 INFO L87 Difference]: Start difference. First operand 789 states. Second operand 4 states. [2019-10-03 02:43:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:23,486 INFO L93 Difference]: Finished difference Result 640 states and 1015 transitions. [2019-10-03 02:43:23,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:23,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-03 02:43:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:23,530 INFO L225 Difference]: With dead ends: 640 [2019-10-03 02:43:23,531 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:23,534 INFO L640 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-10-03 02:43:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1003 transitions. [2019-10-03 02:43:23,661 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1003 transitions. Word has length 124 [2019-10-03 02:43:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:23,663 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1003 transitions. [2019-10-03 02:43:23,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1003 transitions. [2019-10-03 02:43:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 02:43:23,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:23,673 INFO L411 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-10-03 02:43:23,673 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:23,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1610008943, now seen corresponding path program 1 times [2019-10-03 02:43:23,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:23,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:23,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:23,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:23,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:23,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:23,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:23,960 INFO L87 Difference]: Start difference. First operand 629 states and 1003 transitions. Second operand 4 states. [2019-10-03 02:43:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:24,039 INFO L93 Difference]: Finished difference Result 631 states and 1004 transitions. [2019-10-03 02:43:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:24,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-03 02:43:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:24,046 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:43:24,047 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:24,048 INFO L640 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-10-03 02:43:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1002 transitions. [2019-10-03 02:43:24,081 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1002 transitions. Word has length 127 [2019-10-03 02:43:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:24,082 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1002 transitions. [2019-10-03 02:43:24,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1002 transitions. [2019-10-03 02:43:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:43:24,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:24,089 INFO L411 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-10-03 02:43:24,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1101854388, now seen corresponding path program 1 times [2019-10-03 02:43:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:24,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:24,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:24,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:24,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:24,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:24,311 INFO L87 Difference]: Start difference. First operand 629 states and 1002 transitions. Second operand 4 states. [2019-10-03 02:43:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:24,376 INFO L93 Difference]: Finished difference Result 631 states and 1003 transitions. [2019-10-03 02:43:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:24,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-03 02:43:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:24,386 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:43:24,386 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:24,386 INFO L640 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-10-03 02:43:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-10-03 02:43:24,425 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 128 [2019-10-03 02:43:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:24,427 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-10-03 02:43:24,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-10-03 02:43:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 02:43:24,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:24,434 INFO L411 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-10-03 02:43:24,434 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -862468589, now seen corresponding path program 1 times [2019-10-03 02:43:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:24,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:24,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:24,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:24,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:24,601 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-10-03 02:43:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:24,650 INFO L93 Difference]: Finished difference Result 631 states and 1002 transitions. [2019-10-03 02:43:24,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:24,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-03 02:43:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:24,656 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:43:24,656 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:24,657 INFO L640 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-10-03 02:43:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-10-03 02:43:24,679 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 129 [2019-10-03 02:43:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:24,679 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-10-03 02:43:24,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-10-03 02:43:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 02:43:24,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:24,684 INFO L411 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-10-03 02:43:24,685 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash 671327024, now seen corresponding path program 1 times [2019-10-03 02:43:24,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:24,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:24,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-10-03 02:43:24,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:24,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:24,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:24,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:24,795 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-10-03 02:43:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:24,840 INFO L93 Difference]: Finished difference Result 631 states and 1001 transitions. [2019-10-03 02:43:24,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:24,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-03 02:43:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:24,848 INFO L225 Difference]: With dead ends: 631 [2019-10-03 02:43:24,848 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:43:24,848 INFO L640 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-10-03 02:43:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:43:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-03 02:43:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-03 02:43:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-10-03 02:43:24,870 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 130 [2019-10-03 02:43:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:24,870 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-10-03 02:43:24,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-10-03 02:43:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:43:24,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:24,876 INFO L411 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-10-03 02:43:24,877 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -617846089, now seen corresponding path program 1 times [2019-10-03 02:43:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:24,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:43:25,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:25,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:43:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:43:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:43:25,066 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 10 states. [2019-10-03 02:43:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:25,244 INFO L93 Difference]: Finished difference Result 638 states and 1010 transitions. [2019-10-03 02:43:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:43:25,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-10-03 02:43:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:25,250 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:43:25,251 INFO L226 Difference]: Without dead ends: 638 [2019-10-03 02:43:25,252 INFO L640 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-10-03 02:43:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-03 02:43:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-03 02:43:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-03 02:43:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1008 transitions. [2019-10-03 02:43:25,317 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1008 transitions. Word has length 131 [2019-10-03 02:43:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:25,321 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1008 transitions. [2019-10-03 02:43:25,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:43:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1008 transitions. [2019-10-03 02:43:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:43:25,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:25,334 INFO L411 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-10-03 02:43:25,334 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:25,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 57846520, now seen corresponding path program 1 times [2019-10-03 02:43:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:25,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:25,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:25,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:25,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:25,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:25,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:25,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:25,576 INFO L87 Difference]: Start difference. First operand 636 states and 1008 transitions. Second operand 4 states. [2019-10-03 02:43:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:25,628 INFO L93 Difference]: Finished difference Result 634 states and 1003 transitions. [2019-10-03 02:43:25,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:43:25,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-03 02:43:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:25,636 INFO L225 Difference]: With dead ends: 634 [2019-10-03 02:43:25,636 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:43:25,636 INFO L640 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-10-03 02:43:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:43:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:43:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:43:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 985 transitions. [2019-10-03 02:43:25,667 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 985 transitions. Word has length 131 [2019-10-03 02:43:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:25,667 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 985 transitions. [2019-10-03 02:43:25,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 985 transitions. [2019-10-03 02:43:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-03 02:43:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:25,675 INFO L411 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-10-03 02:43:25,675 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:25,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1033600176, now seen corresponding path program 1 times [2019-10-03 02:43:25,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:25,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:25,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:25,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:25,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:25,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:25,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:25,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:25,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:25,870 INFO L87 Difference]: Start difference. First operand 623 states and 985 transitions. Second operand 6 states. [2019-10-03 02:43:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:26,103 INFO L93 Difference]: Finished difference Result 626 states and 988 transitions. [2019-10-03 02:43:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:26,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-03 02:43:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:26,109 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:43:26,109 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:43:26,110 INFO L640 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-10-03 02:43:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:43:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:43:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:43:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 981 transitions. [2019-10-03 02:43:26,138 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 981 transitions. Word has length 132 [2019-10-03 02:43:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:26,138 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 981 transitions. [2019-10-03 02:43:26,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 981 transitions. [2019-10-03 02:43:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:43:26,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:26,144 INFO L411 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-10-03 02:43:26,144 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1073337876, now seen corresponding path program 1 times [2019-10-03 02:43:26,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:26,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:26,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:26,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:26,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:26,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:26,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:26,311 INFO L87 Difference]: Start difference. First operand 623 states and 981 transitions. Second operand 6 states. [2019-10-03 02:43:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:26,543 INFO L93 Difference]: Finished difference Result 626 states and 984 transitions. [2019-10-03 02:43:26,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:26,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-03 02:43:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:26,550 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:43:26,550 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:43:26,551 INFO L640 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-10-03 02:43:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:43:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:43:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:43:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 977 transitions. [2019-10-03 02:43:26,608 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 977 transitions. Word has length 133 [2019-10-03 02:43:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:26,609 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 977 transitions. [2019-10-03 02:43:26,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 977 transitions. [2019-10-03 02:43:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:43:26,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:26,617 INFO L411 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-10-03 02:43:26,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1624657451, now seen corresponding path program 1 times [2019-10-03 02:43:26,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:26,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:26,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:26,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:26,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:26,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:26,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:26,801 INFO L87 Difference]: Start difference. First operand 623 states and 977 transitions. Second operand 6 states. [2019-10-03 02:43:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:26,976 INFO L93 Difference]: Finished difference Result 626 states and 980 transitions. [2019-10-03 02:43:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:26,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-03 02:43:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:26,982 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:43:26,982 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:43:26,983 INFO L640 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-10-03 02:43:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:43:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:43:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:43:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 973 transitions. [2019-10-03 02:43:27,003 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 973 transitions. Word has length 134 [2019-10-03 02:43:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:27,004 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 973 transitions. [2019-10-03 02:43:27,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 973 transitions. [2019-10-03 02:43:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:43:27,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:27,009 INFO L411 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-10-03 02:43:27,009 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1879686741, now seen corresponding path program 1 times [2019-10-03 02:43:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:27,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:43:27,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:27,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:43:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:43:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:43:27,176 INFO L87 Difference]: Start difference. First operand 623 states and 973 transitions. Second operand 7 states. [2019-10-03 02:43:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:27,257 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2019-10-03 02:43:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:43:27,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-03 02:43:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:27,262 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:43:27,262 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:43:27,263 INFO L640 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-10-03 02:43:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:43:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:43:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:43:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 939 transitions. [2019-10-03 02:43:27,286 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 939 transitions. Word has length 134 [2019-10-03 02:43:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:27,287 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 939 transitions. [2019-10-03 02:43:27,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:43:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 939 transitions. [2019-10-03 02:43:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:43:27,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:27,296 INFO L411 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-10-03 02:43:27,296 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1196444495, now seen corresponding path program 1 times [2019-10-03 02:43:27,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:27,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:27,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:27,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:27,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:27,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:27,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:27,457 INFO L87 Difference]: Start difference. First operand 602 states and 939 transitions. Second operand 6 states. [2019-10-03 02:43:27,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:27,556 INFO L93 Difference]: Finished difference Result 605 states and 942 transitions. [2019-10-03 02:43:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:27,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-03 02:43:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:27,562 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:43:27,562 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:43:27,562 INFO L640 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-10-03 02:43:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:43:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:43:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:43:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 938 transitions. [2019-10-03 02:43:27,584 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 938 transitions. Word has length 135 [2019-10-03 02:43:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:27,585 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 938 transitions. [2019-10-03 02:43:27,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 938 transitions. [2019-10-03 02:43:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:43:27,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:27,590 INFO L411 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-10-03 02:43:27,591 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash 467494150, now seen corresponding path program 1 times [2019-10-03 02:43:27,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:27,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:27,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:27,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:27,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:27,823 INFO L87 Difference]: Start difference. First operand 602 states and 938 transitions. Second operand 6 states. [2019-10-03 02:43:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:27,925 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2019-10-03 02:43:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:27,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-03 02:43:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:27,931 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:43:27,931 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:43:27,932 INFO L640 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-10-03 02:43:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:43:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:43:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:43:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-10-03 02:43:27,957 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 136 [2019-10-03 02:43:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:27,957 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-10-03 02:43:27,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-10-03 02:43:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:43:27,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:27,962 INFO L411 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-10-03 02:43:27,963 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:27,963 INFO L82 PathProgramCache]: Analyzing trace with hash -994380662, now seen corresponding path program 1 times [2019-10-03 02:43:27,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:27,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:28,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:28,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:43:28,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:28,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:43:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:43:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:43:28,162 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 12 states. [2019-10-03 02:43:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:28,335 INFO L93 Difference]: Finished difference Result 606 states and 940 transitions. [2019-10-03 02:43:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:43:28,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-10-03 02:43:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:28,340 INFO L225 Difference]: With dead ends: 606 [2019-10-03 02:43:28,341 INFO L226 Difference]: Without dead ends: 602 [2019-10-03 02:43:28,341 INFO L640 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-10-03 02:43:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-03 02:43:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-03 02:43:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-03 02:43:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-10-03 02:43:28,362 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 137 [2019-10-03 02:43:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:28,362 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-10-03 02:43:28,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:43:28,362 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-10-03 02:43:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:43:28,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:28,367 INFO L411 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-10-03 02:43:28,367 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:28,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1158171471, now seen corresponding path program 1 times [2019-10-03 02:43:28,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:28,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:28,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:28,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:28,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:28,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:28,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:43:28,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:28,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:43:28,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:43:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:28,509 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 5 states. [2019-10-03 02:43:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:31,623 INFO L93 Difference]: Finished difference Result 974 states and 1517 transitions. [2019-10-03 02:43:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:31,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-03 02:43:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:31,634 INFO L225 Difference]: With dead ends: 974 [2019-10-03 02:43:31,634 INFO L226 Difference]: Without dead ends: 974 [2019-10-03 02:43:31,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:43:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-03 02:43:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 944. [2019-10-03 02:43:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-03 02:43:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1477 transitions. [2019-10-03 02:43:31,677 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1477 transitions. Word has length 138 [2019-10-03 02:43:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:31,678 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1477 transitions. [2019-10-03 02:43:31,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:43:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1477 transitions. [2019-10-03 02:43:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:43:31,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:31,683 INFO L411 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-10-03 02:43:31,683 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:31,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1117496721, now seen corresponding path program 1 times [2019-10-03 02:43:31,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:31,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:31,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:31,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:31,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:31,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:31,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:31,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:31,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:31,902 INFO L87 Difference]: Start difference. First operand 944 states and 1477 transitions. Second operand 6 states. [2019-10-03 02:43:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:36,360 INFO L93 Difference]: Finished difference Result 1983 states and 3175 transitions. [2019-10-03 02:43:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:36,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-03 02:43:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:36,376 INFO L225 Difference]: With dead ends: 1983 [2019-10-03 02:43:36,376 INFO L226 Difference]: Without dead ends: 1983 [2019-10-03 02:43:36,377 INFO L640 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-10-03 02:43:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-10-03 02:43:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1882. [2019-10-03 02:43:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-10-03 02:43:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2995 transitions. [2019-10-03 02:43:36,465 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2995 transitions. Word has length 138 [2019-10-03 02:43:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:36,466 INFO L475 AbstractCegarLoop]: Abstraction has 1882 states and 2995 transitions. [2019-10-03 02:43:36,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2995 transitions. [2019-10-03 02:43:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:43:36,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:36,471 INFO L411 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-10-03 02:43:36,471 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1503869869, now seen corresponding path program 1 times [2019-10-03 02:43:36,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:36,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:36,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:36,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:36,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:36,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:36,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:36,632 INFO L87 Difference]: Start difference. First operand 1882 states and 2995 transitions. Second operand 6 states. [2019-10-03 02:43:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:41,316 INFO L93 Difference]: Finished difference Result 4145 states and 6776 transitions. [2019-10-03 02:43:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:41,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-03 02:43:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:41,346 INFO L225 Difference]: With dead ends: 4145 [2019-10-03 02:43:41,347 INFO L226 Difference]: Without dead ends: 4145 [2019-10-03 02:43:41,347 INFO L640 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-10-03 02:43:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2019-10-03 02:43:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3900. [2019-10-03 02:43:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-10-03 02:43:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 6303 transitions. [2019-10-03 02:43:41,509 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 6303 transitions. Word has length 139 [2019-10-03 02:43:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:41,510 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 6303 transitions. [2019-10-03 02:43:41,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 6303 transitions. [2019-10-03 02:43:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:43:41,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:41,515 INFO L411 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-10-03 02:43:41,516 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash 834330645, now seen corresponding path program 1 times [2019-10-03 02:43:41,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:41,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:41,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:41,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:41,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:41,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-10-03 02:43:41,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:41,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:41,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:41,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:41,692 INFO L87 Difference]: Start difference. First operand 3900 states and 6303 transitions. Second operand 6 states. [2019-10-03 02:43:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:46,462 INFO L93 Difference]: Finished difference Result 9037 states and 15166 transitions. [2019-10-03 02:43:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:46,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-03 02:43:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:46,572 INFO L225 Difference]: With dead ends: 9037 [2019-10-03 02:43:46,575 INFO L226 Difference]: Without dead ends: 9037 [2019-10-03 02:43:46,575 INFO L640 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-10-03 02:43:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9037 states. [2019-10-03 02:43:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9037 to 8370. [2019-10-03 02:43:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8370 states. [2019-10-03 02:43:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8370 states to 8370 states and 13811 transitions. [2019-10-03 02:43:47,141 INFO L78 Accepts]: Start accepts. Automaton has 8370 states and 13811 transitions. Word has length 140 [2019-10-03 02:43:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:47,142 INFO L475 AbstractCegarLoop]: Abstraction has 8370 states and 13811 transitions. [2019-10-03 02:43:47,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8370 states and 13811 transitions. [2019-10-03 02:43:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:43:47,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:47,147 INFO L411 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-10-03 02:43:47,147 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:47,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:47,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246257, now seen corresponding path program 1 times [2019-10-03 02:43:47,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:47,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:47,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:47,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:47,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-10-03 02:43:47,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:47,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:47,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:47,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:47,299 INFO L87 Difference]: Start difference. First operand 8370 states and 13811 transitions. Second operand 6 states. [2019-10-03 02:43:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:52,013 INFO L93 Difference]: Finished difference Result 20673 states and 36030 transitions. [2019-10-03 02:43:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:43:52,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:43:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:52,162 INFO L225 Difference]: With dead ends: 20673 [2019-10-03 02:43:52,162 INFO L226 Difference]: Without dead ends: 20673 [2019-10-03 02:43:52,162 INFO L640 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-10-03 02:43:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20673 states. [2019-10-03 02:43:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20673 to 18728. [2019-10-03 02:43:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18728 states. [2019-10-03 02:43:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18728 states to 18728 states and 31945 transitions. [2019-10-03 02:43:53,055 INFO L78 Accepts]: Start accepts. Automaton has 18728 states and 31945 transitions. Word has length 141 [2019-10-03 02:43:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:53,057 INFO L475 AbstractCegarLoop]: Abstraction has 18728 states and 31945 transitions. [2019-10-03 02:43:53,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18728 states and 31945 transitions. [2019-10-03 02:43:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:43:53,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:53,063 INFO L411 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-10-03 02:43:53,063 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1533122470, now seen corresponding path program 1 times [2019-10-03 02:43:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:53,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:53,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:43:54,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:54,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:43:54,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:54,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:43:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:43:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:43:54,035 INFO L87 Difference]: Start difference. First operand 18728 states and 31945 transitions. Second operand 9 states. [2019-10-03 02:44:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:00,651 INFO L93 Difference]: Finished difference Result 43166 states and 73549 transitions. [2019-10-03 02:44:00,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:44:00,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 142 [2019-10-03 02:44:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:00,980 INFO L225 Difference]: With dead ends: 43166 [2019-10-03 02:44:00,980 INFO L226 Difference]: Without dead ends: 43166 [2019-10-03 02:44:00,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-03 02:44:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43166 states. [2019-10-03 02:44:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43166 to 42443. [2019-10-03 02:44:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42443 states. [2019-10-03 02:44:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42443 states to 42443 states and 71943 transitions. [2019-10-03 02:44:02,639 INFO L78 Accepts]: Start accepts. Automaton has 42443 states and 71943 transitions. Word has length 142 [2019-10-03 02:44:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:02,639 INFO L475 AbstractCegarLoop]: Abstraction has 42443 states and 71943 transitions. [2019-10-03 02:44:02,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:44:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 42443 states and 71943 transitions. [2019-10-03 02:44:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:44:02,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:02,645 INFO L411 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-10-03 02:44:02,645 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1803258839, now seen corresponding path program 1 times [2019-10-03 02:44:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:02,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:02,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:02,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:02,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:02,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:02,775 INFO L87 Difference]: Start difference. First operand 42443 states and 71943 transitions. Second operand 7 states. [2019-10-03 02:44:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:04,380 INFO L93 Difference]: Finished difference Result 43819 states and 73977 transitions. [2019-10-03 02:44:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:44:04,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-03 02:44:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:04,574 INFO L225 Difference]: With dead ends: 43819 [2019-10-03 02:44:04,574 INFO L226 Difference]: Without dead ends: 43819 [2019-10-03 02:44:04,574 INFO L640 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-10-03 02:44:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43819 states. [2019-10-03 02:44:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43819 to 43115. [2019-10-03 02:44:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43115 states. [2019-10-03 02:44:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43115 states to 43115 states and 72903 transitions. [2019-10-03 02:44:06,172 INFO L78 Accepts]: Start accepts. Automaton has 43115 states and 72903 transitions. Word has length 147 [2019-10-03 02:44:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:06,173 INFO L475 AbstractCegarLoop]: Abstraction has 43115 states and 72903 transitions. [2019-10-03 02:44:06,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43115 states and 72903 transitions. [2019-10-03 02:44:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:44:06,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:06,180 INFO L411 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-10-03 02:44:06,180 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -206209525, now seen corresponding path program 1 times [2019-10-03 02:44:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:06,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:06,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:06,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:44:06,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:06,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:44:06,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:44:06,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:06,594 INFO L87 Difference]: Start difference. First operand 43115 states and 72903 transitions. Second operand 5 states. [2019-10-03 02:44:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:06,942 INFO L93 Difference]: Finished difference Result 43499 states and 73411 transitions. [2019-10-03 02:44:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:44:06,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 02:44:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:07,144 INFO L225 Difference]: With dead ends: 43499 [2019-10-03 02:44:07,144 INFO L226 Difference]: Without dead ends: 43499 [2019-10-03 02:44:07,144 INFO L640 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-10-03 02:44:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43499 states. [2019-10-03 02:44:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43499 to 43145. [2019-10-03 02:44:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43145 states. [2019-10-03 02:44:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43145 states to 43145 states and 72939 transitions. [2019-10-03 02:44:10,468 INFO L78 Accepts]: Start accepts. Automaton has 43145 states and 72939 transitions. Word has length 148 [2019-10-03 02:44:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:10,468 INFO L475 AbstractCegarLoop]: Abstraction has 43145 states and 72939 transitions. [2019-10-03 02:44:10,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:44:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 43145 states and 72939 transitions. [2019-10-03 02:44:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:44:10,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:10,474 INFO L411 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-10-03 02:44:10,474 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -836668150, now seen corresponding path program 1 times [2019-10-03 02:44:10,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:10,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:10,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:10,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:10,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:10,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:10,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:10,597 INFO L87 Difference]: Start difference. First operand 43145 states and 72939 transitions. Second operand 6 states. [2019-10-03 02:44:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:16,177 INFO L93 Difference]: Finished difference Result 111808 states and 202713 transitions. [2019-10-03 02:44:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:44:16,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 02:44:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:16,834 INFO L225 Difference]: With dead ends: 111808 [2019-10-03 02:44:16,834 INFO L226 Difference]: Without dead ends: 111808 [2019-10-03 02:44:16,834 INFO L640 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-10-03 02:44:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111808 states. [2019-10-03 02:44:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111808 to 99957. [2019-10-03 02:44:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99957 states. [2019-10-03 02:44:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99957 states to 99957 states and 177093 transitions. [2019-10-03 02:44:23,385 INFO L78 Accepts]: Start accepts. Automaton has 99957 states and 177093 transitions. Word has length 148 [2019-10-03 02:44:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:23,385 INFO L475 AbstractCegarLoop]: Abstraction has 99957 states and 177093 transitions. [2019-10-03 02:44:23,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 99957 states and 177093 transitions. [2019-10-03 02:44:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:44:23,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:23,391 INFO L411 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-10-03 02:44:23,391 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 586133833, now seen corresponding path program 1 times [2019-10-03 02:44:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:23,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:23,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:23,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:23,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:23,518 INFO L87 Difference]: Start difference. First operand 99957 states and 177093 transitions. Second operand 7 states. [2019-10-03 02:44:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:24,716 INFO L93 Difference]: Finished difference Result 102325 states and 180387 transitions. [2019-10-03 02:44:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:44:24,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2019-10-03 02:44:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:25,407 INFO L225 Difference]: With dead ends: 102325 [2019-10-03 02:44:25,407 INFO L226 Difference]: Without dead ends: 102325 [2019-10-03 02:44:25,408 INFO L640 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-10-03 02:44:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102325 states. [2019-10-03 02:44:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102325 to 100149. [2019-10-03 02:44:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100149 states. [2019-10-03 02:44:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100149 states to 100149 states and 177285 transitions. [2019-10-03 02:44:29,112 INFO L78 Accepts]: Start accepts. Automaton has 100149 states and 177285 transitions. Word has length 148 [2019-10-03 02:44:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:29,113 INFO L475 AbstractCegarLoop]: Abstraction has 100149 states and 177285 transitions. [2019-10-03 02:44:29,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 100149 states and 177285 transitions. [2019-10-03 02:44:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:44:29,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:29,119 INFO L411 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-10-03 02:44:29,119 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash -22294848, now seen corresponding path program 1 times [2019-10-03 02:44:29,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:29,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:44:29,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:29,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:44:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:44:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:29,392 INFO L87 Difference]: Start difference. First operand 100149 states and 177285 transitions. Second operand 8 states. [2019-10-03 02:44:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:37,042 INFO L93 Difference]: Finished difference Result 221241 states and 394678 transitions. [2019-10-03 02:44:37,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:44:37,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-10-03 02:44:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:42,969 INFO L225 Difference]: With dead ends: 221241 [2019-10-03 02:44:42,970 INFO L226 Difference]: Without dead ends: 221241 [2019-10-03 02:44:42,970 INFO L640 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-10-03 02:44:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221241 states. [2019-10-03 02:44:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221241 to 221207. [2019-10-03 02:44:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221207 states. [2019-10-03 02:44:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221207 states to 221207 states and 394638 transitions. [2019-10-03 02:44:50,220 INFO L78 Accepts]: Start accepts. Automaton has 221207 states and 394638 transitions. Word has length 157 [2019-10-03 02:44:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:50,220 INFO L475 AbstractCegarLoop]: Abstraction has 221207 states and 394638 transitions. [2019-10-03 02:44:50,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:44:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 221207 states and 394638 transitions. [2019-10-03 02:44:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:44:50,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:50,227 INFO L411 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] [2019-10-03 02:44:50,227 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2032942901, now seen corresponding path program 1 times [2019-10-03 02:44:50,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:50,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:44:50,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:50,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:50,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:50,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:50,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:50,365 INFO L87 Difference]: Start difference. First operand 221207 states and 394638 transitions. Second operand 7 states. [2019-10-03 02:44:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:59,575 INFO L93 Difference]: Finished difference Result 223191 states and 396334 transitions. [2019-10-03 02:44:59,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:44:59,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-03 02:44:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:00,932 INFO L225 Difference]: With dead ends: 223191 [2019-10-03 02:45:00,933 INFO L226 Difference]: Without dead ends: 222871 [2019-10-03 02:45:00,933 INFO L640 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-10-03 02:45:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222871 states. [2019-10-03 02:45:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222871 to 222871. [2019-10-03 02:45:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222871 states. [2019-10-03 02:45:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222871 states to 222871 states and 396014 transitions. [2019-10-03 02:45:08,286 INFO L78 Accepts]: Start accepts. Automaton has 222871 states and 396014 transitions. Word has length 158 [2019-10-03 02:45:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:08,287 INFO L475 AbstractCegarLoop]: Abstraction has 222871 states and 396014 transitions. [2019-10-03 02:45:08,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:45:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 222871 states and 396014 transitions. [2019-10-03 02:45:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-03 02:45:08,291 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:08,291 INFO L411 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-10-03 02:45:08,292 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 653176656, now seen corresponding path program 1 times [2019-10-03 02:45:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:08,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:08,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:08,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:45:08,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:08,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:45:08,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:08,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:45:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:45:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:45:08,436 INFO L87 Difference]: Start difference. First operand 222871 states and 396014 transitions. Second operand 7 states. [2019-10-03 02:45:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:20,619 INFO L93 Difference]: Finished difference Result 233386 states and 415552 transitions. [2019-10-03 02:45:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:45:20,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-10-03 02:45:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:22,056 INFO L225 Difference]: With dead ends: 233386 [2019-10-03 02:45:22,056 INFO L226 Difference]: Without dead ends: 233386 [2019-10-03 02:45:22,056 INFO L640 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-10-03 02:45:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233386 states. [2019-10-03 02:45:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233386 to 230295. [2019-10-03 02:45:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230295 states. [2019-10-03 02:45:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230295 states to 230295 states and 406092 transitions. [2019-10-03 02:45:34,371 INFO L78 Accepts]: Start accepts. Automaton has 230295 states and 406092 transitions. Word has length 160 [2019-10-03 02:45:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:34,371 INFO L475 AbstractCegarLoop]: Abstraction has 230295 states and 406092 transitions. [2019-10-03 02:45:34,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:45:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 230295 states and 406092 transitions. [2019-10-03 02:45:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-03 02:45:34,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:34,376 INFO L411 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-10-03 02:45:34,376 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1102598506, now seen corresponding path program 1 times [2019-10-03 02:45:34,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:34,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:34,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:34,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:34,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:45:34,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:34,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:45:34,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:34,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:45:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:45:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:45:34,492 INFO L87 Difference]: Start difference. First operand 230295 states and 406092 transitions. Second operand 6 states. [2019-10-03 02:45:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:38,617 INFO L93 Difference]: Finished difference Result 297800 states and 522278 transitions. [2019-10-03 02:45:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:45:38,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-03 02:45:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:40,080 INFO L225 Difference]: With dead ends: 297800 [2019-10-03 02:45:40,080 INFO L226 Difference]: Without dead ends: 297800 [2019-10-03 02:45:40,080 INFO L640 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-10-03 02:45:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297800 states. [2019-10-03 02:45:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297800 to 281421. [2019-10-03 02:45:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281421 states. [2019-10-03 02:46:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281421 states to 281421 states and 496566 transitions. [2019-10-03 02:46:03,660 INFO L78 Accepts]: Start accepts. Automaton has 281421 states and 496566 transitions. Word has length 165 [2019-10-03 02:46:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:03,661 INFO L475 AbstractCegarLoop]: Abstraction has 281421 states and 496566 transitions. [2019-10-03 02:46:03,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 281421 states and 496566 transitions. [2019-10-03 02:46:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 02:46:03,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:03,665 INFO L411 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-10-03 02:46:03,665 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash 431117452, now seen corresponding path program 1 times [2019-10-03 02:46:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:03,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:03,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:46:03,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:03,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:03,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:03,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:03,791 INFO L87 Difference]: Start difference. First operand 281421 states and 496566 transitions. Second operand 4 states. [2019-10-03 02:46:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:22,157 INFO L93 Difference]: Finished difference Result 692839 states and 1426192 transitions. [2019-10-03 02:46:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:46:22,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-03 02:46:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:36,250 INFO L225 Difference]: With dead ends: 692839 [2019-10-03 02:46:36,250 INFO L226 Difference]: Without dead ends: 692839 [2019-10-03 02:46:36,251 INFO L640 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-10-03 02:46:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692839 states. [2019-10-03 02:47:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692839 to 666435. [2019-10-03 02:47:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666435 states. [2019-10-03 02:47:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666435 states to 666435 states and 1349517 transitions. [2019-10-03 02:47:36,827 INFO L78 Accepts]: Start accepts. Automaton has 666435 states and 1349517 transitions. Word has length 164 [2019-10-03 02:47:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:36,827 INFO L475 AbstractCegarLoop]: Abstraction has 666435 states and 1349517 transitions. [2019-10-03 02:47:36,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 666435 states and 1349517 transitions. [2019-10-03 02:47:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-03 02:47:36,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:36,837 INFO L411 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, 1] [2019-10-03 02:47:36,837 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 94266847, now seen corresponding path program 1 times [2019-10-03 02:47:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:36,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:36,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:47:36,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:36,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:36,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:36,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:36,961 INFO L87 Difference]: Start difference. First operand 666435 states and 1349517 transitions. Second operand 4 states.