java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:36:35,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:36:35,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:36:35,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:36:35,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:36:35,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:36:35,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:36:35,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:36:35,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:36:35,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:36:35,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:36:35,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:36:35,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:36:35,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:36:35,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:36:35,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:36:35,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:36:35,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:36:35,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:36:35,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:36:35,686 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:36:35,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:36:35,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:36:35,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:36:35,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:36:35,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:36:35,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:36:35,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:36:35,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:36:35,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:36:35,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:36:35,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:36:35,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:36:35,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:36:35,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:36:35,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:36:35,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:36:35,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:36:35,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:36:35,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:36:35,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:36:35,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:36:35,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:36:35,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:36:35,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:36:35,717 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:36:35,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:36:35,718 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:36:35,718 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:36:35,718 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:36:35,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:36:35,719 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:36:35,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:36:35,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:36:35,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:36:35,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:36:35,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:36:35,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:36:35,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:36:35,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:36:35,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:36:35,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:36:35,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:36:35,722 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:36:35,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:36:35,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:36:35,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:36:35,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:36:35,723 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:36:35,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:36:35,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:36:35,723 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:36:35,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:36:35,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:36:35,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:36:35,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:36:35,770 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:36:35,771 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_productSimulator.cil.c [2019-09-10 02:36:35,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e2ac50e/9fcf3980031e4b8686604d924289913a/FLAG8c8f49b15 [2019-09-10 02:36:36,459 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:36:36,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_productSimulator.cil.c [2019-09-10 02:36:36,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e2ac50e/9fcf3980031e4b8686604d924289913a/FLAG8c8f49b15 [2019-09-10 02:36:36,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e2ac50e/9fcf3980031e4b8686604d924289913a [2019-09-10 02:36:36,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:36:36,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:36:36,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:36,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:36:36,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:36:36,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:36" (1/1) ... [2019-09-10 02:36:36,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626530f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:36, skipping insertion in model container [2019-09-10 02:36:36,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:36" (1/1) ... [2019-09-10 02:36:36,693 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:36:36,789 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:36:37,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:37,542 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:36:37,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:37,844 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:36:37,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37 WrapperNode [2019-09-10 02:36:37,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:37,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:36:37,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:36:37,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:36:37,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:37,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:37,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:37,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:38,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:38,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:38,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... [2019-09-10 02:36:38,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:36:38,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:36:38,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:36:38,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:36:38,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:36:38,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:36:38,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:36:38,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:38,158 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:36:38,158 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:36:38,158 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:36:38,158 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:36:38,158 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:36:38,159 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:36:38,159 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:36:38,159 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:36:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:36:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:36:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:36:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:36:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:36:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:36:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:36:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:36:38,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:36:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:38,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:36:38,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:36:38,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:36:38,165 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:38,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:36:38,167 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:36:38,168 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-09-10 02:36:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:36:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-09-10 02:36:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-09-10 02:36:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-09-10 02:36:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-09-10 02:36:38,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:36:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:36:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:36:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:36:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:36:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-10 02:36:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-10 02:36:38,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-09-10 02:36:38,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-09-10 02:36:38,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:36:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:36:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:36:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-10 02:36:38,174 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-10 02:36:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-10 02:36:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-10 02:36:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:36:38,175 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:36:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-09-10 02:36:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-09-10 02:36:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:36:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-09-10 02:36:38,177 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-09-10 02:36:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:36:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:36:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:36:38,178 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:36:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:36:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:36:38,178 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:36:38,179 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:36:38,180 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:36:38,181 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:36:38,181 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:36:38,181 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:36:38,181 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:36:38,181 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:36:38,182 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:36:38,182 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:36:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:36:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:36:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:36:38,184 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:36:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:36:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:36:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:36:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:36:38,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:36:38,186 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:36:38,186 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:36:38,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:38,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:36:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:36:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:36:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:36:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:36:38,202 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:36:38,202 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:36:38,202 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:36:38,202 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:36:38,203 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:36:38,203 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:36:38,203 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:36:38,203 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:38,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:36:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-09-10 02:36:38,206 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-09-10 02:36:38,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-09-10 02:36:38,208 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-09-10 02:36:38,209 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-09-10 02:36:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:36:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:36:40,628 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:36:40,628 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:36:40,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:40 BoogieIcfgContainer [2019-09-10 02:36:40,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:36:40,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:36:40,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:36:40,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:36:40,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:36:36" (1/3) ... [2019-09-10 02:36:40,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5e9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:40, skipping insertion in model container [2019-09-10 02:36:40,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:37" (2/3) ... [2019-09-10 02:36:40,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5e9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:40, skipping insertion in model container [2019-09-10 02:36:40,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:40" (3/3) ... [2019-09-10 02:36:40,640 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_productSimulator.cil.c [2019-09-10 02:36:40,650 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:36:40,663 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:36:40,680 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:36:40,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:36:40,713 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:36:40,713 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:36:40,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:36:40,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:36:40,713 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:36:40,713 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:36:40,714 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:36:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states. [2019-09-10 02:36:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 02:36:40,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:40,813 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:40,817 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1751171414, now seen corresponding path program 1 times [2019-09-10 02:36:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:41,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:41,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:41,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:41,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:41,670 INFO L87 Difference]: Start difference. First operand 916 states. Second operand 6 states. [2019-09-10 02:36:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:41,892 INFO L93 Difference]: Finished difference Result 761 states and 1170 transitions. [2019-09-10 02:36:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:41,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-10 02:36:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:41,923 INFO L225 Difference]: With dead ends: 761 [2019-09-10 02:36:41,923 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:41,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1149 transitions. [2019-09-10 02:36:42,066 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1149 transitions. Word has length 120 [2019-09-10 02:36:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:42,071 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1149 transitions. [2019-09-10 02:36:42,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1149 transitions. [2019-09-10 02:36:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 02:36:42,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:42,082 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:42,082 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 490428433, now seen corresponding path program 1 times [2019-09-10 02:36:42,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:42,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:42,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:42,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:42,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:42,318 INFO L87 Difference]: Start difference. First operand 744 states and 1149 transitions. Second operand 4 states. [2019-09-10 02:36:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:42,393 INFO L93 Difference]: Finished difference Result 746 states and 1150 transitions. [2019-09-10 02:36:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:42,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 02:36:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:42,402 INFO L225 Difference]: With dead ends: 746 [2019-09-10 02:36:42,402 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:42,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1148 transitions. [2019-09-10 02:36:42,431 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1148 transitions. Word has length 123 [2019-09-10 02:36:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:42,432 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1148 transitions. [2019-09-10 02:36:42,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1148 transitions. [2019-09-10 02:36:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:36:42,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:42,435 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:42,436 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:42,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash -620177609, now seen corresponding path program 1 times [2019-09-10 02:36:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:42,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:42,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:42,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:42,700 INFO L87 Difference]: Start difference. First operand 744 states and 1148 transitions. Second operand 4 states. [2019-09-10 02:36:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:42,770 INFO L93 Difference]: Finished difference Result 746 states and 1149 transitions. [2019-09-10 02:36:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:42,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 02:36:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:42,777 INFO L225 Difference]: With dead ends: 746 [2019-09-10 02:36:42,778 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:42,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1147 transitions. [2019-09-10 02:36:42,805 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1147 transitions. Word has length 124 [2019-09-10 02:36:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:42,806 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1147 transitions. [2019-09-10 02:36:42,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1147 transitions. [2019-09-10 02:36:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 02:36:42,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:42,809 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:42,809 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 669317965, now seen corresponding path program 1 times [2019-09-10 02:36:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:42,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:43,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:43,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:43,007 INFO L87 Difference]: Start difference. First operand 744 states and 1147 transitions. Second operand 4 states. [2019-09-10 02:36:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:43,077 INFO L93 Difference]: Finished difference Result 746 states and 1148 transitions. [2019-09-10 02:36:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:43,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-10 02:36:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:43,087 INFO L225 Difference]: With dead ends: 746 [2019-09-10 02:36:43,087 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:43,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1146 transitions. [2019-09-10 02:36:43,113 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1146 transitions. Word has length 125 [2019-09-10 02:36:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:43,115 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1146 transitions. [2019-09-10 02:36:43,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1146 transitions. [2019-09-10 02:36:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 02:36:43,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:43,122 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:43,123 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash -947447693, now seen corresponding path program 1 times [2019-09-10 02:36:43,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:43,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:43,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:43,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:43,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:43,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:43,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:43,278 INFO L87 Difference]: Start difference. First operand 744 states and 1146 transitions. Second operand 4 states. [2019-09-10 02:36:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:43,334 INFO L93 Difference]: Finished difference Result 746 states and 1147 transitions. [2019-09-10 02:36:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:43,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 02:36:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:43,345 INFO L225 Difference]: With dead ends: 746 [2019-09-10 02:36:43,345 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:43,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1145 transitions. [2019-09-10 02:36:43,385 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1145 transitions. Word has length 126 [2019-09-10 02:36:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:43,385 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1145 transitions. [2019-09-10 02:36:43,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1145 transitions. [2019-09-10 02:36:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:36:43,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:43,390 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:43,390 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1830968969, now seen corresponding path program 1 times [2019-09-10 02:36:43,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:43,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:43,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:43,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:43,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:43,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:43,619 INFO L87 Difference]: Start difference. First operand 744 states and 1145 transitions. Second operand 4 states. [2019-09-10 02:36:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:43,666 INFO L93 Difference]: Finished difference Result 746 states and 1146 transitions. [2019-09-10 02:36:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:43,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 02:36:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:43,673 INFO L225 Difference]: With dead ends: 746 [2019-09-10 02:36:43,673 INFO L226 Difference]: Without dead ends: 744 [2019-09-10 02:36:43,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-09-10 02:36:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-09-10 02:36:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-09-10 02:36:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1144 transitions. [2019-09-10 02:36:43,700 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1144 transitions. Word has length 127 [2019-09-10 02:36:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:43,701 INFO L475 AbstractCegarLoop]: Abstraction has 744 states and 1144 transitions. [2019-09-10 02:36:43,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1144 transitions. [2019-09-10 02:36:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:36:43,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:43,704 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:43,706 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash -873883217, now seen corresponding path program 1 times [2019-09-10 02:36:43,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:43,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:43,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:43,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:43,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:43,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:36:43,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:43,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:36:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:36:43,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:36:43,915 INFO L87 Difference]: Start difference. First operand 744 states and 1144 transitions. Second operand 11 states. [2019-09-10 02:36:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:44,128 INFO L93 Difference]: Finished difference Result 753 states and 1155 transitions. [2019-09-10 02:36:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:36:44,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2019-09-10 02:36:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:44,138 INFO L225 Difference]: With dead ends: 753 [2019-09-10 02:36:44,138 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 02:36:44,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:36:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 02:36:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2019-09-10 02:36:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-10 02:36:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1153 transitions. [2019-09-10 02:36:44,171 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1153 transitions. Word has length 128 [2019-09-10 02:36:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:44,172 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1153 transitions. [2019-09-10 02:36:44,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:36:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1153 transitions. [2019-09-10 02:36:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:36:44,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:44,175 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:44,176 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1613236558, now seen corresponding path program 1 times [2019-09-10 02:36:44,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:44,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:44,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:44,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:44,393 INFO L87 Difference]: Start difference. First operand 751 states and 1153 transitions. Second operand 4 states. [2019-09-10 02:36:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:44,439 INFO L93 Difference]: Finished difference Result 749 states and 1148 transitions. [2019-09-10 02:36:44,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:44,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 02:36:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:44,445 INFO L225 Difference]: With dead ends: 749 [2019-09-10 02:36:44,445 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:36:44,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:36:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:36:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:36:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1130 transitions. [2019-09-10 02:36:44,472 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1130 transitions. Word has length 128 [2019-09-10 02:36:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:44,472 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1130 transitions. [2019-09-10 02:36:44,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1130 transitions. [2019-09-10 02:36:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:36:44,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:44,475 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:44,476 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1929128491, now seen corresponding path program 1 times [2019-09-10 02:36:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:44,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:44,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:44,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:44,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:44,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:44,606 INFO L87 Difference]: Start difference. First operand 738 states and 1130 transitions. Second operand 6 states. [2019-09-10 02:36:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:44,844 INFO L93 Difference]: Finished difference Result 741 states and 1133 transitions. [2019-09-10 02:36:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:44,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 02:36:44,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:44,851 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:36:44,852 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:36:44,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:36:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:36:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:36:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1126 transitions. [2019-09-10 02:36:44,888 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1126 transitions. Word has length 129 [2019-09-10 02:36:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:44,888 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1126 transitions. [2019-09-10 02:36:44,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1126 transitions. [2019-09-10 02:36:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:36:44,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:44,891 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:44,892 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2134384978, now seen corresponding path program 1 times [2019-09-10 02:36:44,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:44,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:44,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:44,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:45,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:45,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:45,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:45,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:45,041 INFO L87 Difference]: Start difference. First operand 738 states and 1126 transitions. Second operand 6 states. [2019-09-10 02:36:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:45,248 INFO L93 Difference]: Finished difference Result 741 states and 1129 transitions. [2019-09-10 02:36:45,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:45,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-10 02:36:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:45,257 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:36:45,257 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:36:45,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:36:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:36:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:36:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1122 transitions. [2019-09-10 02:36:45,290 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1122 transitions. Word has length 130 [2019-09-10 02:36:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:45,292 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1122 transitions. [2019-09-10 02:36:45,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1122 transitions. [2019-09-10 02:36:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:36:45,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:45,295 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:45,295 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -920602288, now seen corresponding path program 1 times [2019-09-10 02:36:45,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:45,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:45,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:45,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:45,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:45,446 INFO L87 Difference]: Start difference. First operand 738 states and 1122 transitions. Second operand 6 states. [2019-09-10 02:36:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:45,680 INFO L93 Difference]: Finished difference Result 741 states and 1125 transitions. [2019-09-10 02:36:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:45,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-09-10 02:36:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:45,687 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:36:45,687 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 02:36:45,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 02:36:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-09-10 02:36:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 02:36:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2019-09-10 02:36:45,716 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 131 [2019-09-10 02:36:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:45,716 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2019-09-10 02:36:45,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2019-09-10 02:36:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:36:45,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:45,720 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:45,720 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1980126672, now seen corresponding path program 1 times [2019-09-10 02:36:45,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:45,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:45,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:45,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:45,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:45,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:45,863 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 7 states. [2019-09-10 02:36:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:45,956 INFO L93 Difference]: Finished difference Result 741 states and 1121 transitions. [2019-09-10 02:36:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:36:45,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-10 02:36:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:45,963 INFO L225 Difference]: With dead ends: 741 [2019-09-10 02:36:45,964 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:36:45,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:36:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:36:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:36:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1084 transitions. [2019-09-10 02:36:45,994 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1084 transitions. Word has length 131 [2019-09-10 02:36:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:45,995 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1084 transitions. [2019-09-10 02:36:45,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1084 transitions. [2019-09-10 02:36:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:36:45,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:45,999 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:45,999 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:45,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1963930793, now seen corresponding path program 1 times [2019-09-10 02:36:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:46,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:46,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:46,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:46,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:46,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:46,163 INFO L87 Difference]: Start difference. First operand 717 states and 1084 transitions. Second operand 6 states. [2019-09-10 02:36:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:46,266 INFO L93 Difference]: Finished difference Result 720 states and 1087 transitions. [2019-09-10 02:36:46,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:46,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 02:36:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:46,275 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:36:46,276 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:36:46,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:36:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:36:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:36:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1083 transitions. [2019-09-10 02:36:46,302 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1083 transitions. Word has length 132 [2019-09-10 02:36:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:46,303 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1083 transitions. [2019-09-10 02:36:46,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1083 transitions. [2019-09-10 02:36:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:36:46,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:46,306 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:46,306 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -775379851, now seen corresponding path program 1 times [2019-09-10 02:36:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:46,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:46,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:46,447 INFO L87 Difference]: Start difference. First operand 717 states and 1083 transitions. Second operand 6 states. [2019-09-10 02:36:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:46,546 INFO L93 Difference]: Finished difference Result 720 states and 1086 transitions. [2019-09-10 02:36:46,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:46,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 02:36:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:46,553 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:36:46,553 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:36:46,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:36:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:36:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:36:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1082 transitions. [2019-09-10 02:36:46,606 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1082 transitions. Word has length 133 [2019-09-10 02:36:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:46,606 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1082 transitions. [2019-09-10 02:36:46,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1082 transitions. [2019-09-10 02:36:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:36:46,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:46,609 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:46,609 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:46,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2026224674, now seen corresponding path program 1 times [2019-09-10 02:36:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:46,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:46,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:46,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:46,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:46,722 INFO L87 Difference]: Start difference. First operand 717 states and 1082 transitions. Second operand 4 states. [2019-09-10 02:36:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:46,765 INFO L93 Difference]: Finished difference Result 720 states and 1085 transitions. [2019-09-10 02:36:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:46,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-09-10 02:36:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:46,772 INFO L225 Difference]: With dead ends: 720 [2019-09-10 02:36:46,772 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:36:46,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:36:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:36:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:36:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:36:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1081 transitions. [2019-09-10 02:36:46,794 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1081 transitions. Word has length 134 [2019-09-10 02:36:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:46,795 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1081 transitions. [2019-09-10 02:36:46,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1081 transitions. [2019-09-10 02:36:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:36:46,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:46,798 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:46,798 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash 881957212, now seen corresponding path program 1 times [2019-09-10 02:36:46,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:46,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:46,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:46,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:46,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:46,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:36:46,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:46,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:36:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:36:46,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:36:46,988 INFO L87 Difference]: Start difference. First operand 717 states and 1081 transitions. Second operand 13 states. [2019-09-10 02:36:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:47,202 INFO L93 Difference]: Finished difference Result 721 states and 1084 transitions. [2019-09-10 02:36:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:36:47,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 134 [2019-09-10 02:36:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:47,210 INFO L225 Difference]: With dead ends: 721 [2019-09-10 02:36:47,210 INFO L226 Difference]: Without dead ends: 717 [2019-09-10 02:36:47,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:36:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-09-10 02:36:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-09-10 02:36:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-09-10 02:36:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1080 transitions. [2019-09-10 02:36:47,254 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1080 transitions. Word has length 134 [2019-09-10 02:36:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:47,257 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1080 transitions. [2019-09-10 02:36:47,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:36:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1080 transitions. [2019-09-10 02:36:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:36:47,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:47,260 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:47,261 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash -301817066, now seen corresponding path program 1 times [2019-09-10 02:36:47,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:47,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:47,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:47,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:47,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:47,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:47,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:47,399 INFO L87 Difference]: Start difference. First operand 717 states and 1080 transitions. Second operand 4 states. [2019-09-10 02:36:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:48,714 INFO L93 Difference]: Finished difference Result 1381 states and 2090 transitions. [2019-09-10 02:36:48,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:48,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 02:36:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:48,726 INFO L225 Difference]: With dead ends: 1381 [2019-09-10 02:36:48,726 INFO L226 Difference]: Without dead ends: 1381 [2019-09-10 02:36:48,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2019-09-10 02:36:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1368. [2019-09-10 02:36:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-09-10 02:36:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2074 transitions. [2019-09-10 02:36:48,778 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2074 transitions. Word has length 135 [2019-09-10 02:36:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:48,779 INFO L475 AbstractCegarLoop]: Abstraction has 1368 states and 2074 transitions. [2019-09-10 02:36:48,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2074 transitions. [2019-09-10 02:36:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:36:48,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:48,783 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:48,784 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1014149374, now seen corresponding path program 1 times [2019-09-10 02:36:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:48,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:48,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:48,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:48,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:48,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:48,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:48,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:48,975 INFO L87 Difference]: Start difference. First operand 1368 states and 2074 transitions. Second operand 6 states. [2019-09-10 02:36:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:53,614 INFO L93 Difference]: Finished difference Result 2801 states and 4414 transitions. [2019-09-10 02:36:53,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:53,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 02:36:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:53,636 INFO L225 Difference]: With dead ends: 2801 [2019-09-10 02:36:53,636 INFO L226 Difference]: Without dead ends: 2801 [2019-09-10 02:36:53,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-09-10 02:36:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2752. [2019-09-10 02:36:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-09-10 02:36:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 4348 transitions. [2019-09-10 02:36:53,737 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 4348 transitions. Word has length 136 [2019-09-10 02:36:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:53,737 INFO L475 AbstractCegarLoop]: Abstraction has 2752 states and 4348 transitions. [2019-09-10 02:36:53,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 4348 transitions. [2019-09-10 02:36:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 02:36:53,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:53,747 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:53,748 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1438060187, now seen corresponding path program 1 times [2019-09-10 02:36:53,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:53,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:53,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:54,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:54,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:36:54,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:54,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:36:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:36:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:36:54,044 INFO L87 Difference]: Start difference. First operand 2752 states and 4348 transitions. Second operand 9 states. [2019-09-10 02:36:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:58,767 INFO L93 Difference]: Finished difference Result 2776 states and 4440 transitions. [2019-09-10 02:36:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:36:58,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-09-10 02:36:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:58,787 INFO L225 Difference]: With dead ends: 2776 [2019-09-10 02:36:58,787 INFO L226 Difference]: Without dead ends: 2776 [2019-09-10 02:36:58,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:36:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-09-10 02:36:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2768. [2019-09-10 02:36:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-09-10 02:36:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 4428 transitions. [2019-09-10 02:36:58,893 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 4428 transitions. Word has length 181 [2019-09-10 02:36:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:58,893 INFO L475 AbstractCegarLoop]: Abstraction has 2768 states and 4428 transitions. [2019-09-10 02:36:58,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:36:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 4428 transitions. [2019-09-10 02:36:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 02:36:58,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:58,905 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:58,906 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2917670, now seen corresponding path program 1 times [2019-09-10 02:36:58,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:58,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:36:59,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:59,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:36:59,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:59,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:36:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:36:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:59,142 INFO L87 Difference]: Start difference. First operand 2768 states and 4428 transitions. Second operand 8 states. [2019-09-10 02:37:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:07,850 INFO L93 Difference]: Finished difference Result 7750 states and 12444 transitions. [2019-09-10 02:37:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 02:37:07,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-10 02:37:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:07,912 INFO L225 Difference]: With dead ends: 7750 [2019-09-10 02:37:07,913 INFO L226 Difference]: Without dead ends: 7750 [2019-09-10 02:37:07,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7750 states. [2019-09-10 02:37:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7750 to 7676. [2019-09-10 02:37:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7676 states. [2019-09-10 02:37:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7676 states to 7676 states and 12326 transitions. [2019-09-10 02:37:08,224 INFO L78 Accepts]: Start accepts. Automaton has 7676 states and 12326 transitions. Word has length 182 [2019-09-10 02:37:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:08,224 INFO L475 AbstractCegarLoop]: Abstraction has 7676 states and 12326 transitions. [2019-09-10 02:37:08,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:37:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7676 states and 12326 transitions. [2019-09-10 02:37:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 02:37:08,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:08,234 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:08,234 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1009565604, now seen corresponding path program 1 times [2019-09-10 02:37:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:08,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:08,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:08,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:37:08,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:08,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:08,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:08,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:08,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:08,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:08,378 INFO L87 Difference]: Start difference. First operand 7676 states and 12326 transitions. Second operand 6 states. [2019-09-10 02:37:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:09,322 INFO L93 Difference]: Finished difference Result 7700 states and 12338 transitions. [2019-09-10 02:37:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:37:09,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 186 [2019-09-10 02:37:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:09,378 INFO L225 Difference]: With dead ends: 7700 [2019-09-10 02:37:09,378 INFO L226 Difference]: Without dead ends: 7700 [2019-09-10 02:37:09,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2019-09-10 02:37:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 7700. [2019-09-10 02:37:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7700 states. [2019-09-10 02:37:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7700 states to 7700 states and 12338 transitions. [2019-09-10 02:37:09,612 INFO L78 Accepts]: Start accepts. Automaton has 7700 states and 12338 transitions. Word has length 186 [2019-09-10 02:37:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:09,612 INFO L475 AbstractCegarLoop]: Abstraction has 7700 states and 12338 transitions. [2019-09-10 02:37:09,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7700 states and 12338 transitions. [2019-09-10 02:37:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 02:37:09,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:09,622 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:09,622 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash 557703553, now seen corresponding path program 1 times [2019-09-10 02:37:09,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:09,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:09,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:09,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:09,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:37:09,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:09,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:37:09,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:09,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:37:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:37:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:37:09,759 INFO L87 Difference]: Start difference. First operand 7700 states and 12338 transitions. Second operand 4 states. [2019-09-10 02:37:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:10,993 INFO L93 Difference]: Finished difference Result 14901 states and 23877 transitions. [2019-09-10 02:37:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:37:10,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 02:37:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:11,093 INFO L225 Difference]: With dead ends: 14901 [2019-09-10 02:37:11,094 INFO L226 Difference]: Without dead ends: 14901 [2019-09-10 02:37:11,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:37:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14901 states. [2019-09-10 02:37:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14901 to 14888. [2019-09-10 02:37:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14888 states. [2019-09-10 02:37:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14888 states to 14888 states and 23861 transitions. [2019-09-10 02:37:11,544 INFO L78 Accepts]: Start accepts. Automaton has 14888 states and 23861 transitions. Word has length 186 [2019-09-10 02:37:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:11,545 INFO L475 AbstractCegarLoop]: Abstraction has 14888 states and 23861 transitions. [2019-09-10 02:37:11,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:37:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14888 states and 23861 transitions. [2019-09-10 02:37:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 02:37:11,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:11,562 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:11,563 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:11,563 INFO L82 PathProgramCache]: Analyzing trace with hash 717768455, now seen corresponding path program 1 times [2019-09-10 02:37:11,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:11,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:11,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:37:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:11,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:11,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:11,758 INFO L87 Difference]: Start difference. First operand 14888 states and 23861 transitions. Second operand 6 states. [2019-09-10 02:37:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:12,637 INFO L93 Difference]: Finished difference Result 15008 states and 23933 transitions. [2019-09-10 02:37:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:37:12,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-10 02:37:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:12,845 INFO L225 Difference]: With dead ends: 15008 [2019-09-10 02:37:12,845 INFO L226 Difference]: Without dead ends: 15008 [2019-09-10 02:37:12,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15008 states. [2019-09-10 02:37:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15008 to 15008. [2019-09-10 02:37:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15008 states. [2019-09-10 02:37:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15008 states to 15008 states and 23933 transitions. [2019-09-10 02:37:13,250 INFO L78 Accepts]: Start accepts. Automaton has 15008 states and 23933 transitions. Word has length 187 [2019-09-10 02:37:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:13,250 INFO L475 AbstractCegarLoop]: Abstraction has 15008 states and 23933 transitions. [2019-09-10 02:37:13,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15008 states and 23933 transitions. [2019-09-10 02:37:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 02:37:13,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:13,267 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:13,267 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash 609840576, now seen corresponding path program 1 times [2019-09-10 02:37:13,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:13,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:37:13,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:13,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:37:13,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:13,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:37:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:37:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:37:13,419 INFO L87 Difference]: Start difference. First operand 15008 states and 23933 transitions. Second operand 6 states. [2019-09-10 02:37:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:14,322 INFO L93 Difference]: Finished difference Result 15152 states and 24029 transitions. [2019-09-10 02:37:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:37:14,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 188 [2019-09-10 02:37:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:14,417 INFO L225 Difference]: With dead ends: 15152 [2019-09-10 02:37:14,418 INFO L226 Difference]: Without dead ends: 15152 [2019-09-10 02:37:14,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15152 states. [2019-09-10 02:37:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15152 to 15152. [2019-09-10 02:37:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15152 states. [2019-09-10 02:37:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15152 states to 15152 states and 24029 transitions. [2019-09-10 02:37:15,857 INFO L78 Accepts]: Start accepts. Automaton has 15152 states and 24029 transitions. Word has length 188 [2019-09-10 02:37:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:15,858 INFO L475 AbstractCegarLoop]: Abstraction has 15152 states and 24029 transitions. [2019-09-10 02:37:15,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:37:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 15152 states and 24029 transitions. [2019-09-10 02:37:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 02:37:15,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:15,880 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:15,880 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1542648437, now seen corresponding path program 1 times [2019-09-10 02:37:15,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:15,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:15,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:37:16,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:16,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:16,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:16,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:16,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:16,051 INFO L87 Difference]: Start difference. First operand 15152 states and 24029 transitions. Second operand 9 states. [2019-09-10 02:37:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:26,727 INFO L93 Difference]: Finished difference Result 35371 states and 58521 transitions. [2019-09-10 02:37:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:37:26,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-09-10 02:37:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:26,995 INFO L225 Difference]: With dead ends: 35371 [2019-09-10 02:37:26,996 INFO L226 Difference]: Without dead ends: 35371 [2019-09-10 02:37:26,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:37:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35371 states. [2019-09-10 02:37:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35371 to 33030. [2019-09-10 02:37:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33030 states. [2019-09-10 02:37:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33030 states to 33030 states and 53691 transitions. [2019-09-10 02:37:28,148 INFO L78 Accepts]: Start accepts. Automaton has 33030 states and 53691 transitions. Word has length 188 [2019-09-10 02:37:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:28,149 INFO L475 AbstractCegarLoop]: Abstraction has 33030 states and 53691 transitions. [2019-09-10 02:37:28,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33030 states and 53691 transitions. [2019-09-10 02:37:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 02:37:28,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:28,169 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:28,169 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1058973110, now seen corresponding path program 1 times [2019-09-10 02:37:28,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:28,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:28,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:37:28,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:28,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:37:28,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:28,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:37:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:37:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:37:28,329 INFO L87 Difference]: Start difference. First operand 33030 states and 53691 transitions. Second operand 5 states. [2019-09-10 02:37:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:32,212 INFO L93 Difference]: Finished difference Result 50675 states and 80547 transitions. [2019-09-10 02:37:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:37:32,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-09-10 02:37:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:32,613 INFO L225 Difference]: With dead ends: 50675 [2019-09-10 02:37:32,614 INFO L226 Difference]: Without dead ends: 50547 [2019-09-10 02:37:32,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-09-10 02:37:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50547 states. [2019-09-10 02:37:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50547 to 50310. [2019-09-10 02:37:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50310 states. [2019-09-10 02:37:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50310 states to 50310 states and 80083 transitions. [2019-09-10 02:37:34,059 INFO L78 Accepts]: Start accepts. Automaton has 50310 states and 80083 transitions. Word has length 188 [2019-09-10 02:37:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:34,059 INFO L475 AbstractCegarLoop]: Abstraction has 50310 states and 80083 transitions. [2019-09-10 02:37:34,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:37:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 50310 states and 80083 transitions. [2019-09-10 02:37:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-10 02:37:34,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:34,076 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:34,076 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 857149176, now seen corresponding path program 1 times [2019-09-10 02:37:34,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:34,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:34,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:34,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:37:34,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:34,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 02:37:34,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:34,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:37:34,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:37:34,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:37:34,267 INFO L87 Difference]: Start difference. First operand 50310 states and 80083 transitions. Second operand 11 states. [2019-09-10 02:37:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:44,982 INFO L93 Difference]: Finished difference Result 98455 states and 157775 transitions. [2019-09-10 02:37:44,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:37:44,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-09-10 02:37:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:45,580 INFO L225 Difference]: With dead ends: 98455 [2019-09-10 02:37:45,580 INFO L226 Difference]: Without dead ends: 98455 [2019-09-10 02:37:45,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:37:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98455 states. [2019-09-10 02:37:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98455 to 97090. [2019-09-10 02:37:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97090 states. [2019-09-10 02:37:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97090 states to 97090 states and 154923 transitions. [2019-09-10 02:37:47,740 INFO L78 Accepts]: Start accepts. Automaton has 97090 states and 154923 transitions. Word has length 188 [2019-09-10 02:37:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:47,741 INFO L475 AbstractCegarLoop]: Abstraction has 97090 states and 154923 transitions. [2019-09-10 02:37:47,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:37:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 97090 states and 154923 transitions. [2019-09-10 02:37:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-10 02:37:47,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:47,759 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:47,759 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1235543059, now seen corresponding path program 1 times [2019-09-10 02:37:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:47,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 02:37:47,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:47,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:37:47,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:47,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:37:47,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:37:47,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:47,923 INFO L87 Difference]: Start difference. First operand 97090 states and 154923 transitions. Second operand 9 states. [2019-09-10 02:37:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:48,701 INFO L93 Difference]: Finished difference Result 99330 states and 158923 transitions. [2019-09-10 02:37:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:37:48,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-10 02:37:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:49,303 INFO L225 Difference]: With dead ends: 99330 [2019-09-10 02:37:49,303 INFO L226 Difference]: Without dead ends: 99330 [2019-09-10 02:37:49,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:37:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99330 states. [2019-09-10 02:37:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99330 to 98146. [2019-09-10 02:37:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98146 states. [2019-09-10 02:37:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98146 states to 98146 states and 156371 transitions. [2019-09-10 02:37:54,649 INFO L78 Accepts]: Start accepts. Automaton has 98146 states and 156371 transitions. Word has length 193 [2019-09-10 02:37:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:37:54,650 INFO L475 AbstractCegarLoop]: Abstraction has 98146 states and 156371 transitions. [2019-09-10 02:37:54,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:37:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 98146 states and 156371 transitions. [2019-09-10 02:37:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 02:37:54,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:37:54,659 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:37:54,660 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:37:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:37:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1390224139, now seen corresponding path program 1 times [2019-09-10 02:37:54,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:37:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:54,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:37:54,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:37:54,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:37:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:37:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:37:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:37:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:37:54,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:37:54,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:37:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:37:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:37:54,818 INFO L87 Difference]: Start difference. First operand 98146 states and 156371 transitions. Second operand 4 states. [2019-09-10 02:37:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:37:57,200 INFO L93 Difference]: Finished difference Result 180718 states and 289935 transitions. [2019-09-10 02:37:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:37:57,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-10 02:37:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:37:58,015 INFO L225 Difference]: With dead ends: 180718 [2019-09-10 02:37:58,015 INFO L226 Difference]: Without dead ends: 180670 [2019-09-10 02:37:58,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:37:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180670 states. [2019-09-10 02:38:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180670 to 179841. [2019-09-10 02:38:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179841 states. [2019-09-10 02:38:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179841 states to 179841 states and 288879 transitions. [2019-09-10 02:38:05,150 INFO L78 Accepts]: Start accepts. Automaton has 179841 states and 288879 transitions. Word has length 199 [2019-09-10 02:38:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:05,150 INFO L475 AbstractCegarLoop]: Abstraction has 179841 states and 288879 transitions. [2019-09-10 02:38:05,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:38:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 179841 states and 288879 transitions. [2019-09-10 02:38:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 02:38:05,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:05,173 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:38:05,173 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:05,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1373421050, now seen corresponding path program 1 times [2019-09-10 02:38:05,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:05,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:05,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:05,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 02:38:05,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:38:05,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:38:05,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:05,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:38:05,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:38:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:38:05,350 INFO L87 Difference]: Start difference. First operand 179841 states and 288879 transitions. Second operand 6 states. [2019-09-10 02:38:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:19,845 INFO L93 Difference]: Finished difference Result 416422 states and 702759 transitions. [2019-09-10 02:38:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:38:19,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 200 [2019-09-10 02:38:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:22,202 INFO L225 Difference]: With dead ends: 416422 [2019-09-10 02:38:22,203 INFO L226 Difference]: Without dead ends: 416342 [2019-09-10 02:38:22,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:38:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416342 states. [2019-09-10 02:38:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416342 to 390377. [2019-09-10 02:38:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390377 states. [2019-09-10 02:38:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390377 states to 390377 states and 643743 transitions. [2019-09-10 02:38:38,392 INFO L78 Accepts]: Start accepts. Automaton has 390377 states and 643743 transitions. Word has length 200 [2019-09-10 02:38:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:38,393 INFO L475 AbstractCegarLoop]: Abstraction has 390377 states and 643743 transitions. [2019-09-10 02:38:38,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:38:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 390377 states and 643743 transitions. [2019-09-10 02:38:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 02:38:38,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:38:38,420 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-09-10 02:38:38,421 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:38:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash 868012490, now seen corresponding path program 1 times [2019-09-10 02:38:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:38:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:38:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:38:38,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:38:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:38:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:38:38,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:38:38,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:38:38,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2019-09-10 02:38:38,598 INFO L207 CegarAbsIntRunner]: [231], [233], [235], [270], [272], [274], [276], [278], [279], [280], [283], [285], [289], [708], [711], [859], [860], [863], [865], [868], [870], [876], [880], [993], [994], [1236], [1239], [1248], [1257], [1267], [1268], [1341], [1345], [1348], [1383], [1385], [1386], [1394], [1401], [1403], [1500], [1503], [1508], [1511], [1529], [1530], [1532], [1541], [1543], [1556], [1569], [1570], [1572], [1575], [1577], [1581], [1600], [1648], [1649], [1652], [1654], [1656], [1659], [1730], [1733], [1763], [1764], [1858], [1861], [1863], [1867], [1868], [1904], [1907], [1912], [1917], [1922], [1927], [1932], [1935], [2051], [2074], [2079], [2082], [2101], [2286], [2290], [2294], [2298], [2302], [2306], [2309], [2311], [2312], [2325], [2328], [2334], [2338], [2339], [2342], [2364], [2430], [2431], [2583], [2601], [2605], [2609], [2613], [2616], [2622], [2648], [2649], [2650], [2651], [2680], [2681], [2682], [2683], [2684], [2685], [2686], [2687], [2688], [2689], [2690], [2691], [2746], [2747], [2748], [2749], [2778], [2779], [2780], [2781], [2928], [2929], [2930], [2931], [2932], [2933], [2934], [2935], [2936], [2942], [2943], [2948], [2949], [2950], [2951], [2952], [2953], [2982], [2983], [2984], [2985], [2996], [2997], [3004], [3005], [3006], [3007], [3022], [3023], [3024], [3025], [3028], [3040], [3041], [3044], [3045], [3056], [3057], [3058], [3059], [3060], [3082], [3083], [3084] [2019-09-10 02:38:38,707 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:38:38,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:38:38,895 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:38:38,898 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 148 root evaluator evaluations with a maximum evaluation depth of 0. Performed 148 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 284 variables. [2019-09-10 02:38:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:38:38,906 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:38:39,027 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:38:39,027 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:38:39,033 INFO L420 sIntCurrentIteration]: We unified 200 AI predicates to 200 [2019-09-10 02:38:39,033 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:38:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:38:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:38:39,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:38:39,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:38:39,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:38:39,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:39,036 INFO L87 Difference]: Start difference. First operand 390377 states and 643743 transitions. Second operand 2 states. [2019-09-10 02:38:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:38:39,037 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:38:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:38:39,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 201 [2019-09-10 02:38:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:38:39,037 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:38:39,037 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:38:39,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:38:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:38:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:38:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:38:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:38:39,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2019-09-10 02:38:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:38:39,040 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:38:39,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:38:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:38:39,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:38:39,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:38:39 BoogieIcfgContainer [2019-09-10 02:38:39,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:38:39,052 INFO L168 Benchmark]: Toolchain (without parser) took 122375.10 ms. Allocated memory was 134.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 86.2 MB in the beginning and 682.5 MB in the end (delta: -596.3 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,053 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1168.88 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 131.5 MB in the end (delta: -45.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,054 INFO L168 Benchmark]: Boogie Preprocessor took 252.34 ms. Allocated memory is still 202.9 MB. Free memory was 131.5 MB in the beginning and 121.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,055 INFO L168 Benchmark]: RCFGBuilder took 2526.34 ms. Allocated memory was 202.9 MB in the beginning and 260.0 MB in the end (delta: 57.1 MB). Free memory was 121.1 MB in the beginning and 105.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,056 INFO L168 Benchmark]: TraceAbstraction took 118416.30 ms. Allocated memory was 260.0 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 105.2 MB in the beginning and 682.5 MB in the end (delta: -577.3 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-09-10 02:38:39,060 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1168.88 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 131.5 MB in the end (delta: -45.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 252.34 ms. Allocated memory is still 202.9 MB. Free memory was 131.5 MB in the beginning and 121.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2526.34 ms. Allocated memory was 202.9 MB in the beginning and 260.0 MB in the end (delta: 57.1 MB). Free memory was 121.1 MB in the beginning and 105.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118416.30 ms. Allocated memory was 260.0 MB in the beginning and 3.8 GB in the end (delta: 3.5 GB). Free memory was 105.2 MB in the beginning and 682.5 MB in the end (delta: -577.3 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1706]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 94 procedures, 1043 locations, 1 error locations. SAFE Result, 118.3s OverallTime, 31 OverallIterations, 5 TraceHistogramMax, 74.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38001 SDtfs, 29871 SDslu, 96714 SDs, 0 SdLazy, 43060 SolverSat, 7449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390377occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.52 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 37.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 32080 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 4793 NumberOfCodeBlocks, 4793 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4762 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 966/975 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...