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_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:36:30,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:36:30,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:36:30,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:36:30,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:36:30,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:36:30,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:36:30,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:36:30,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:36:30,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:36:30,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:36:30,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:36:30,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:36:30,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:36:30,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:36:30,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:36:30,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:36:30,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:36:30,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:36:30,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:36:30,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:36:30,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:36:30,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:36:30,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:36:30,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:36:30,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:36:30,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:36:30,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:36:30,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:36:30,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:36:30,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:36:30,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:36:30,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:36:30,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:36:30,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:36:30,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:36:30,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:36:30,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:36:30,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:36:30,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:36:30,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:36:30,667 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:30,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:36:30,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:36:30,693 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:36:30,694 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:36:30,695 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:36:30,695 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:36:30,695 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:36:30,695 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:36:30,696 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:36:30,696 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:36:30,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:36:30,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:36:30,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:36:30,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:36:30,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:36:30,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:36:30,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:36:30,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:36:30,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:36:30,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:36:30,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:36:30,701 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:36:30,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:36:30,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:36:30,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:36:30,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:36:30,702 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:36:30,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:36:30,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:36:30,703 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:36:30,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:36:30,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:36:30,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:36:30,762 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:36:30,763 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:36:30,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-09-10 02:36:30,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca2d5c5/d5d48b6daefa40f79a0241fcf10c0dac/FLAG60c069c33 [2019-09-10 02:36:31,459 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:36:31,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-09-10 02:36:31,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca2d5c5/d5d48b6daefa40f79a0241fcf10c0dac/FLAG60c069c33 [2019-09-10 02:36:31,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ca2d5c5/d5d48b6daefa40f79a0241fcf10c0dac [2019-09-10 02:36:31,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:36:31,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:36:31,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:31,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:36:31,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:36:31,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:31" (1/1) ... [2019-09-10 02:36:31,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff4ec7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:31, skipping insertion in model container [2019-09-10 02:36:31,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:36:31" (1/1) ... [2019-09-10 02:36:31,692 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:36:31,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:36:32,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:32,502 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:36:32,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:36:32,740 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:36:32,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:32 WrapperNode [2019-09-10 02:36:32,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:36:32,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:36:32,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:36:32,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:36:32,758 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:32" (1/1) ... [2019-09-10 02:36:32,759 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:32" (1/1) ... [2019-09-10 02:36:32,792 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:32" (1/1) ... [2019-09-10 02:36:32,792 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:32" (1/1) ... [2019-09-10 02:36:32,883 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:32" (1/1) ... [2019-09-10 02:36:32,908 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:32" (1/1) ... [2019-09-10 02:36:32,919 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:32" (1/1) ... [2019-09-10 02:36:32,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:36:32,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:36:32,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:36:32,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:36:32,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:32" (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:33,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:36:33,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:36:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:36:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:36:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:36:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:36:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:36:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:36:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:36:33,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:33,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:36:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:36:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:36:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:36:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:36:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:36:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:36:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:36:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:36:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:36:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:36:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:36:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:36:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:36:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:36:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:36:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:36:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:36:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:36:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:36:33,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:36:33,045 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:36:33,045 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:36:33,045 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:36:33,045 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:33,046 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:36:33,046 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:36:33,046 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-10 02:36:33,047 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:36:33,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-10 02:36:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:36:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:36:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:36:33,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:36:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:36:33,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:36:33,050 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:36:33,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:36:33,051 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:36:33,051 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:36:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:36:33,053 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:36:33,053 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:36:33,054 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:36:33,054 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:36:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:36:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:36:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:36:33,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:36:33,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:36:33,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:36:33,057 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:36:33,057 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:36:33,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:36:33,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:36:33,059 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:36:33,060 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:36:33,060 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:36:33,060 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:36:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:36:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:36:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:36:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:36:33,061 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:36:33,062 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:36:33,063 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:36:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:36:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:36:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:36:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:36:33,066 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:36:33,066 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:36:33,066 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:36:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:36:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:36:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:36:33,067 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:36:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:36:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:36:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:36:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:36:33,070 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:36:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:36:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:36:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-10 02:36:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-10 02:36:33,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:36:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:36:33,075 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:36:33,076 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:36:33,076 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:36:33,076 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:36:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:36:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:36:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:36:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:36:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:36:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:36:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:36:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:36:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:36:33,087 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:36:33,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:36:33,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:36:35,568 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:36:35,569 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:36:35,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:35 BoogieIcfgContainer [2019-09-10 02:36:35,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:36:35,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:36:35,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:36:35,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:36:35,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:36:31" (1/3) ... [2019-09-10 02:36:35,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c38290d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:35, skipping insertion in model container [2019-09-10 02:36:35,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:36:32" (2/3) ... [2019-09-10 02:36:35,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c38290d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:36:35, skipping insertion in model container [2019-09-10 02:36:35,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:36:35" (3/3) ... [2019-09-10 02:36:35,581 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-09-10 02:36:35,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:36:35,606 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:36:35,627 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:36:35,658 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:36:35,659 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:36:35,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:36:35,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:36:35,659 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:36:35,659 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:36:35,659 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:36:35,660 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:36:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2019-09-10 02:36:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 02:36:35,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:35,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:35,744 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:35,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 165755889, now seen corresponding path program 1 times [2019-09-10 02:36:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:35,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:35,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:36,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:36,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:36,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:36,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:36,421 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 4 states. [2019-09-10 02:36:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:36,604 INFO L93 Difference]: Finished difference Result 668 states and 1049 transitions. [2019-09-10 02:36:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:36,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 02:36:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:36,633 INFO L225 Difference]: With dead ends: 668 [2019-09-10 02:36:36,633 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 02:36:36,635 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:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 02:36:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-10 02:36:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:36:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-09-10 02:36:36,755 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 87 [2019-09-10 02:36:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:36,755 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-09-10 02:36:36,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-09-10 02:36:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:36:36,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:36,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:36,764 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1802747224, now seen corresponding path program 1 times [2019-09-10 02:36:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:36,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:36,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:36,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:37,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:37,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:37,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:37,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:37,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:37,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:37,023 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-09-10 02:36:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:37,105 INFO L93 Difference]: Finished difference Result 659 states and 1038 transitions. [2019-09-10 02:36:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:37,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:36:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:37,120 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:36:37,121 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 02:36:37,122 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:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 02:36:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-10 02:36:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:36:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-09-10 02:36:37,151 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 90 [2019-09-10 02:36:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:37,151 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-09-10 02:36:37,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-09-10 02:36:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:36:37,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:37,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:37,154 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:37,154 INFO L82 PathProgramCache]: Analyzing trace with hash 464088220, now seen corresponding path program 1 times [2019-09-10 02:36:37,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:37,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:37,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:37,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:37,288 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-09-10 02:36:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:37,383 INFO L93 Difference]: Finished difference Result 659 states and 1037 transitions. [2019-09-10 02:36:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:37,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:36:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:37,388 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:36:37,389 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 02:36:37,389 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:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 02:36:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-10 02:36:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:36:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-09-10 02:36:37,422 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 91 [2019-09-10 02:36:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:37,422 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-09-10 02:36:37,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-09-10 02:36:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:36:37,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:37,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:37,425 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1512177068, now seen corresponding path program 1 times [2019-09-10 02:36:37,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:37,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:37,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:37,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:37,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:37,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:37,583 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 4 states. [2019-09-10 02:36:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:37,647 INFO L93 Difference]: Finished difference Result 659 states and 1036 transitions. [2019-09-10 02:36:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:37,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:36:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:37,657 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:36:37,657 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 02:36:37,657 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:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 02:36:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-10 02:36:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:36:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-09-10 02:36:37,686 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-09-10 02:36:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:37,687 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-09-10 02:36:37,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-09-10 02:36:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:36:37,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:37,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:37,695 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1779400680, now seen corresponding path program 1 times [2019-09-10 02:36:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:37,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:37,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:37,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:37,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:37,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:37,861 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-09-10 02:36:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:37,905 INFO L93 Difference]: Finished difference Result 659 states and 1035 transitions. [2019-09-10 02:36:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:37,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 02:36:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:37,919 INFO L225 Difference]: With dead ends: 659 [2019-09-10 02:36:37,920 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 02:36:37,920 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:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 02:36:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-10 02:36:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 02:36:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1033 transitions. [2019-09-10 02:36:37,946 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1033 transitions. Word has length 93 [2019-09-10 02:36:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:37,947 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1033 transitions. [2019-09-10 02:36:37,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1033 transitions. [2019-09-10 02:36:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:36:37,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:37,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:37,950 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash -605939888, now seen corresponding path program 1 times [2019-09-10 02:36:37,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:37,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:37,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:38,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:38,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:36:38,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:38,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:36:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:36:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:36:38,137 INFO L87 Difference]: Start difference. First operand 657 states and 1033 transitions. Second operand 10 states. [2019-09-10 02:36:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:38,308 INFO L93 Difference]: Finished difference Result 666 states and 1044 transitions. [2019-09-10 02:36:38,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:36:38,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-10 02:36:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:38,317 INFO L225 Difference]: With dead ends: 666 [2019-09-10 02:36:38,317 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:36:38,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:36:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:36:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-09-10 02:36:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-10 02:36:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1042 transitions. [2019-09-10 02:36:38,409 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1042 transitions. Word has length 94 [2019-09-10 02:36:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:38,413 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1042 transitions. [2019-09-10 02:36:38,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:36:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1042 transitions. [2019-09-10 02:36:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:36:38,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:38,417 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:38,418 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1758408303, now seen corresponding path program 1 times [2019-09-10 02:36:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:38,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:38,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:38,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:38,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:38,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:38,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:38,534 INFO L87 Difference]: Start difference. First operand 664 states and 1042 transitions. Second operand 4 states. [2019-09-10 02:36:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:38,592 INFO L93 Difference]: Finished difference Result 662 states and 1037 transitions. [2019-09-10 02:36:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:36:38,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-10 02:36:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:38,599 INFO L225 Difference]: With dead ends: 662 [2019-09-10 02:36:38,600 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 02:36:38,600 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:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 02:36:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-10 02:36:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 02:36:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1019 transitions. [2019-09-10 02:36:38,623 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1019 transitions. Word has length 94 [2019-09-10 02:36:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:38,625 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1019 transitions. [2019-09-10 02:36:38,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1019 transitions. [2019-09-10 02:36:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:36:38,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:38,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:38,628 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:38,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -795855418, now seen corresponding path program 1 times [2019-09-10 02:36:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:38,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:38,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:38,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:38,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:38,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:38,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:38,751 INFO L87 Difference]: Start difference. First operand 651 states and 1019 transitions. Second operand 6 states. [2019-09-10 02:36:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:38,994 INFO L93 Difference]: Finished difference Result 654 states and 1022 transitions. [2019-09-10 02:36:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:38,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:36:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:39,002 INFO L225 Difference]: With dead ends: 654 [2019-09-10 02:36:39,004 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 02:36:39,004 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:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 02:36:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-10 02:36:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 02:36:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1015 transitions. [2019-09-10 02:36:39,044 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1015 transitions. Word has length 95 [2019-09-10 02:36:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:39,045 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1015 transitions. [2019-09-10 02:36:39,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1015 transitions. [2019-09-10 02:36:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:36:39,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:39,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:39,047 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:39,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:39,047 INFO L82 PathProgramCache]: Analyzing trace with hash 26339251, now seen corresponding path program 1 times [2019-09-10 02:36:39,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:39,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:39,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:39,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:39,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:39,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:39,193 INFO L87 Difference]: Start difference. First operand 651 states and 1015 transitions. Second operand 6 states. [2019-09-10 02:36:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:39,455 INFO L93 Difference]: Finished difference Result 654 states and 1018 transitions. [2019-09-10 02:36:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:39,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:36:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:39,461 INFO L225 Difference]: With dead ends: 654 [2019-09-10 02:36:39,461 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 02:36:39,462 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:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 02:36:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-10 02:36:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 02:36:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-09-10 02:36:39,487 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 96 [2019-09-10 02:36:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:39,487 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-09-10 02:36:39,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-09-10 02:36:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:36:39,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:39,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:39,490 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1115555883, now seen corresponding path program 1 times [2019-09-10 02:36:39,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:39,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:39,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:39,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:39,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:39,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:39,608 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 6 states. [2019-09-10 02:36:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:39,785 INFO L93 Difference]: Finished difference Result 654 states and 1014 transitions. [2019-09-10 02:36:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:39,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:36:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:39,791 INFO L225 Difference]: With dead ends: 654 [2019-09-10 02:36:39,791 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 02:36:39,792 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:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 02:36:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-10 02:36:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 02:36:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-09-10 02:36:39,816 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 97 [2019-09-10 02:36:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:39,816 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-09-10 02:36:39,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-09-10 02:36:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:36:39,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:39,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:39,819 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1213864789, now seen corresponding path program 1 times [2019-09-10 02:36:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:39,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:39,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:39,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:39,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:36:39,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:39,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:36:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:36:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:36:39,944 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 7 states. [2019-09-10 02:36:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:40,024 INFO L93 Difference]: Finished difference Result 654 states and 1010 transitions. [2019-09-10 02:36:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:36:40,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 02:36:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,030 INFO L225 Difference]: With dead ends: 654 [2019-09-10 02:36:40,030 INFO L226 Difference]: Without dead ends: 630 [2019-09-10 02:36:40,031 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:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-10 02:36:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-10 02:36:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-10 02:36:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-09-10 02:36:40,061 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 97 [2019-09-10 02:36:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:40,062 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-09-10 02:36:40,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:36:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-09-10 02:36:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:36:40,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:40,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:40,064 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1892518776, now seen corresponding path program 1 times [2019-09-10 02:36:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:40,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:40,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:40,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:40,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:40,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:40,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:40,190 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 6 states. [2019-09-10 02:36:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:40,284 INFO L93 Difference]: Finished difference Result 633 states and 976 transitions. [2019-09-10 02:36:40,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:40,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 02:36:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,289 INFO L225 Difference]: With dead ends: 633 [2019-09-10 02:36:40,289 INFO L226 Difference]: Without dead ends: 630 [2019-09-10 02:36:40,290 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:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-10 02:36:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-10 02:36:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-10 02:36:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-09-10 02:36:40,314 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 98 [2019-09-10 02:36:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:40,316 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-09-10 02:36:40,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-09-10 02:36:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:36:40,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:40,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:40,318 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1579550352, now seen corresponding path program 1 times [2019-09-10 02:36:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:40,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:40,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:40,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:40,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:40,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:40,481 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 6 states. [2019-09-10 02:36:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:40,567 INFO L93 Difference]: Finished difference Result 633 states and 975 transitions. [2019-09-10 02:36:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:40,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:36:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,572 INFO L225 Difference]: With dead ends: 633 [2019-09-10 02:36:40,572 INFO L226 Difference]: Without dead ends: 630 [2019-09-10 02:36:40,573 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:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-10 02:36:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-10 02:36:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-10 02:36:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 971 transitions. [2019-09-10 02:36:40,598 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 971 transitions. Word has length 99 [2019-09-10 02:36:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:40,598 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 971 transitions. [2019-09-10 02:36:40,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 971 transitions. [2019-09-10 02:36:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 02:36:40,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:40,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:40,600 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1838449469, now seen corresponding path program 1 times [2019-09-10 02:36:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:40,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:40,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:40,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:36:40,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:40,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:36:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:36:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:36:40,779 INFO L87 Difference]: Start difference. First operand 630 states and 971 transitions. Second operand 12 states. [2019-09-10 02:36:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:40,976 INFO L93 Difference]: Finished difference Result 634 states and 974 transitions. [2019-09-10 02:36:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:36:40,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 02:36:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:40,981 INFO L225 Difference]: With dead ends: 634 [2019-09-10 02:36:40,982 INFO L226 Difference]: Without dead ends: 630 [2019-09-10 02:36:40,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:36:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-10 02:36:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-10 02:36:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-10 02:36:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-09-10 02:36:41,000 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 100 [2019-09-10 02:36:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:41,001 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-09-10 02:36:41,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:36:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-09-10 02:36:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 02:36:41,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:41,003 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:41,003 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1351924293, now seen corresponding path program 1 times [2019-09-10 02:36:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:41,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:41,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:36:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:36:41,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:41,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:36:41,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:36:41,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:36:41,160 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 6 states. [2019-09-10 02:36:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:45,246 INFO L93 Difference]: Finished difference Result 1299 states and 2052 transitions. [2019-09-10 02:36:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:36:45,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-10 02:36:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:45,258 INFO L225 Difference]: With dead ends: 1299 [2019-09-10 02:36:45,258 INFO L226 Difference]: Without dead ends: 1299 [2019-09-10 02:36:45,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:36:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-09-10 02:36:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1172. [2019-09-10 02:36:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-09-10 02:36:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1850 transitions. [2019-09-10 02:36:45,304 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1850 transitions. Word has length 101 [2019-09-10 02:36:45,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:45,304 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1850 transitions. [2019-09-10 02:36:45,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:36:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1850 transitions. [2019-09-10 02:36:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:36:45,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:45,310 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 02:36:45,310 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1530865345, now seen corresponding path program 1 times [2019-09-10 02:36:45,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:45,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:45,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:45,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:36:45,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:45,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:36:45,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:45,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:36:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:36:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:36:45,499 INFO L87 Difference]: Start difference. First operand 1172 states and 1850 transitions. Second operand 12 states. [2019-09-10 02:36:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:57,734 INFO L93 Difference]: Finished difference Result 2742 states and 4276 transitions. [2019-09-10 02:36:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:36:57,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-09-10 02:36:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:57,763 INFO L225 Difference]: With dead ends: 2742 [2019-09-10 02:36:57,763 INFO L226 Difference]: Without dead ends: 2742 [2019-09-10 02:36:57,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:36:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-09-10 02:36:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2684. [2019-09-10 02:36:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-09-10 02:36:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4196 transitions. [2019-09-10 02:36:57,874 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4196 transitions. Word has length 159 [2019-09-10 02:36:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:57,874 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 4196 transitions. [2019-09-10 02:36:57,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:36:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4196 transitions. [2019-09-10 02:36:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 02:36:57,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:57,880 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 02:36:57,880 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:57,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1845349951, now seen corresponding path program 1 times [2019-09-10 02:36:57,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:57,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:57,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:36:58,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:36:58,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:36:58,058 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2019-09-10 02:36:58,060 INFO L207 CegarAbsIntRunner]: [218], [220], [222], [237], [256], [258], [261], [263], [267], [709], [711], [714], [719], [727], [760], [761], [843], [844], [1138], [1139], [1212], [1216], [1219], [1254], [1256], [1257], [1265], [1272], [1274], [1283], [1285], [1298], [1311], [1316], [1317], [1318], [1323], [1324], [1326], [1328], [1331], [1402], [1405], [1435], [1436], [1544], [1546], [1549], [1551], [1557], [1561], [1562], [1598], [1601], [1606], [1611], [1616], [1621], [1626], [1629], [1745], [1754], [1759], [1762], [1781], [1970], [1974], [1978], [1982], [1986], [1990], [1993], [1995], [1996], [2009], [2012], [2018], [2022], [2023], [2026], [2048], [2249], [2253], [2256], [2274], [2366], [2368], [2465], [2468], [2473], [2476], [2494], [2513], [2514], [2515], [2516], [2545], [2546], [2547], [2548], [2595], [2596], [2597], [2598], [2601], [2602], [2757], [2758], [2759], [2760], [2761], [2762], [2763], [2764], [2765], [2771], [2772], [2777], [2778], [2779], [2780], [2781], [2782], [2791], [2792], [2793], [2794], [2797], [2813], [2814], [2815], [2816], [2821], [2822], [2829], [2830], [2831], [2832], [2833], [2843], [2844], [2845], [2859], [2860], [2889], [2890], [2891], [2892] [2019-09-10 02:36:58,143 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:36:58,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:36:58,290 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:36:58,293 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 0. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-09-10 02:36:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:58,298 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:36:58,439 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:36:58,439 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:36:58,453 INFO L420 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2019-09-10 02:36:58,454 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:36:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:36:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-10 02:36:58,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:58,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:36:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:36:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:36:58,457 INFO L87 Difference]: Start difference. First operand 2684 states and 4196 transitions. Second operand 2 states. [2019-09-10 02:36:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:36:58,458 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:36:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:36:58,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 160 [2019-09-10 02:36:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:36:58,459 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:36:58,459 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:36:58,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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:36:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:36:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:36:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:36:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:36:58,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2019-09-10 02:36:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:58,462 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:36:58,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:36:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:36:58,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:36:58,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:36:58 BoogieIcfgContainer [2019-09-10 02:36:58,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:36:58,477 INFO L168 Benchmark]: Toolchain (without parser) took 26795.61 ms. Allocated memory was 136.3 MB in the beginning and 589.8 MB in the end (delta: 453.5 MB). Free memory was 89.1 MB in the beginning and 175.9 MB in the end (delta: -86.8 MB). Peak memory consumption was 366.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:36:58,479 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 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:36:58,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1063.63 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 138.6 MB in the end (delta: -49.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:36:58,488 INFO L168 Benchmark]: Boogie Preprocessor took 201.74 ms. Allocated memory is still 203.4 MB. Free memory was 138.6 MB in the beginning and 128.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:36:58,490 INFO L168 Benchmark]: RCFGBuilder took 2626.50 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 128.7 MB in the beginning and 123.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 87.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:36:58,491 INFO L168 Benchmark]: TraceAbstraction took 22899.40 ms. Allocated memory was 255.3 MB in the beginning and 589.8 MB in the end (delta: 334.5 MB). Free memory was 123.9 MB in the beginning and 175.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 282.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:36:58,505 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 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1063.63 ms. Allocated memory was 136.3 MB in the beginning and 203.4 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 138.6 MB in the end (delta: -49.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 201.74 ms. Allocated memory is still 203.4 MB. Free memory was 138.6 MB in the beginning and 128.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2626.50 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 128.7 MB in the beginning and 123.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 87.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22899.40 ms. Allocated memory was 255.3 MB in the beginning and 589.8 MB in the end (delta: 334.5 MB). Free memory was 123.9 MB in the beginning and 175.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 282.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 711]: 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 83 procedures, 954 locations, 1 error locations. SAFE Result, 22.8s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 18.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16597 SDtfs, 4713 SDslu, 55946 SDs, 0 SdLazy, 17518 SolverSat, 1434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2684occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.628930817610063 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1726 ConstructedInterpolants, 0 QuantifiedInterpolants, 279657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 31/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...