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/minepump_spec5_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:58:57,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:58:57,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:58:57,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:58:57,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:58:57,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:58:57,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:58:57,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:58:57,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:58:57,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:58:57,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:58:57,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:58:57,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:58:57,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:58:57,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:58:57,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:58:57,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:58:57,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:58:57,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:58:57,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:58:57,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:58:57,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:58:57,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:58:57,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:58:57,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:58:57,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:58:57,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:58:57,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:58:57,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:58:57,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:58:57,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:58:57,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:58:57,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:58:57,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:58:57,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:58:57,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:58:57,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:58:57,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:58:57,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:58:57,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:58:57,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:58:57,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:58:57,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:58:57,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:58:57,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:58:57,570 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:58:57,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:58:57,571 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:58:57,572 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:58:57,572 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:58:57,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:58:57,572 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:58:57,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:58:57,573 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:58:57,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:58:57,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:58:57,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:58:57,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:58:57,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:58:57,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:58:57,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:58:57,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:58:57,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:58:57,575 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:58:57,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:58:57,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:58:57,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:58:57,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:58:57,576 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:58:57,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:58:57,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:58:57,577 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:58:57,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:58:57,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:58:57,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:58:57,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:58:57,623 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:58:57,624 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec5_product34.cil.c [2019-10-03 02:58:57,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c3879f0/c61ccb5d0bef448bb66821b940cf79ac/FLAG0f1973fec [2019-10-03 02:58:58,261 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:58:58,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product34.cil.c [2019-10-03 02:58:58,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c3879f0/c61ccb5d0bef448bb66821b940cf79ac/FLAG0f1973fec [2019-10-03 02:58:58,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c3879f0/c61ccb5d0bef448bb66821b940cf79ac [2019-10-03 02:58:58,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:58:58,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:58:58,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:58:58,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:58:58,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:58:58,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:58:58" (1/1) ... [2019-10-03 02:58:58,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:58, skipping insertion in model container [2019-10-03 02:58:58,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:58:58" (1/1) ... [2019-10-03 02:58:58,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:58:58,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:58:59,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:58:59,112 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:58:59,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:58:59,250 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:58:59,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59 WrapperNode [2019-10-03 02:58:59,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:58:59,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:58:59,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:58:59,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:58:59,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... [2019-10-03 02:58:59,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:58:59,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:58:59,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:58:59,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:58:59,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:58:59,451 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:58:59,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:58:59,453 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure printEnvironment [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2019-10-03 02:58:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2019-10-03 02:58:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2019-10-03 02:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2019-10-03 02:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2019-10-03 02:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure printPump [2019-10-03 02:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2019-10-03 02:58:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure startSystem [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__1 [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__2 [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__3 [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:58:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:58:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:58:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:58:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:58:59,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:58:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2019-10-03 02:58:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure printEnvironment [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure startSystem [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:58:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure printPump [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__2 [2019-10-03 02:58:59,464 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__3 [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__1 [2019-10-03 02:58:59,465 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:58:59,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:00,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:00,528 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-03 02:59:00,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:00 BoogieIcfgContainer [2019-10-03 02:59:00,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:00,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:00,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:00,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:00,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:58:58" (1/3) ... [2019-10-03 02:59:00,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5fccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:00, skipping insertion in model container [2019-10-03 02:59:00,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:58:59" (2/3) ... [2019-10-03 02:59:00,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5fccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:00, skipping insertion in model container [2019-10-03 02:59:00,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:00" (3/3) ... [2019-10-03 02:59:00,539 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product34.cil.c [2019-10-03 02:59:00,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:00,560 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:00,577 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:00,609 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:00,609 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:00,609 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:00,609 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:00,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:00,610 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:00,610 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:00,610 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-10-03 02:59:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:59:00,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:00,654 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:00,656 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1468621358, now seen corresponding path program 1 times [2019-10-03 02:59:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:00,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:00,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:00,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:01,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:01,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:01,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:01,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:01,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:01,095 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 2 states. [2019-10-03 02:59:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:01,137 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-10-03 02:59:01,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:01,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 59 [2019-10-03 02:59:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:01,159 INFO L225 Difference]: With dead ends: 130 [2019-10-03 02:59:01,159 INFO L226 Difference]: Without dead ends: 119 [2019-10-03 02:59:01,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-03 02:59:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-03 02:59:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-10-03 02:59:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-03 02:59:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2019-10-03 02:59:01,245 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 59 [2019-10-03 02:59:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:01,246 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2019-10-03 02:59:01,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2019-10-03 02:59:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:59:01,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:01,257 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:01,257 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 732022184, now seen corresponding path program 1 times [2019-10-03 02:59:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:01,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:01,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:01,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:01,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:01,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:01,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:01,444 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 3 states. [2019-10-03 02:59:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:01,470 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-10-03 02:59:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:01,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 02:59:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:01,477 INFO L225 Difference]: With dead ends: 110 [2019-10-03 02:59:01,477 INFO L226 Difference]: Without dead ends: 110 [2019-10-03 02:59:01,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-03 02:59:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-03 02:59:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-03 02:59:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2019-10-03 02:59:01,500 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 60 [2019-10-03 02:59:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:01,501 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2019-10-03 02:59:01,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2019-10-03 02:59:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:59:01,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:01,507 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:01,507 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -69452161, now seen corresponding path program 1 times [2019-10-03 02:59:01,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:01,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:59:01,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:01,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:01,714 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 7 states. [2019-10-03 02:59:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:02,025 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2019-10-03 02:59:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:02,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-03 02:59:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:02,027 INFO L225 Difference]: With dead ends: 110 [2019-10-03 02:59:02,028 INFO L226 Difference]: Without dead ends: 110 [2019-10-03 02:59:02,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:59:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-03 02:59:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-03 02:59:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-03 02:59:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2019-10-03 02:59:02,048 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 65 [2019-10-03 02:59:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:02,057 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2019-10-03 02:59:02,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2019-10-03 02:59:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 02:59:02,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:02,059 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:02,059 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash -752044170, now seen corresponding path program 1 times [2019-10-03 02:59:02,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:02,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:02,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:02,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:02,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:59:02,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:02,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:59:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:59:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:59:02,212 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 5 states. [2019-10-03 02:59:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:02,725 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2019-10-03 02:59:02,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:02,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-10-03 02:59:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:02,730 INFO L225 Difference]: With dead ends: 205 [2019-10-03 02:59:02,731 INFO L226 Difference]: Without dead ends: 205 [2019-10-03 02:59:02,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-03 02:59:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2019-10-03 02:59:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-03 02:59:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2019-10-03 02:59:02,767 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 73 [2019-10-03 02:59:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:02,767 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2019-10-03 02:59:02,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:59:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2019-10-03 02:59:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:59:02,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:02,770 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:02,771 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1770960597, now seen corresponding path program 1 times [2019-10-03 02:59:02,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:02,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:02,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:02,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:02,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:59:02,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:02,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:02,900 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand 7 states. [2019-10-03 02:59:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:03,578 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2019-10-03 02:59:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:59:03,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-10-03 02:59:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:03,581 INFO L225 Difference]: With dead ends: 204 [2019-10-03 02:59:03,581 INFO L226 Difference]: Without dead ends: 204 [2019-10-03 02:59:03,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:59:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-03 02:59:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2019-10-03 02:59:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-03 02:59:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2019-10-03 02:59:03,596 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 87 [2019-10-03 02:59:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:03,596 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2019-10-03 02:59:03,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2019-10-03 02:59:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:59:03,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:03,598 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:03,598 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1107726217, now seen corresponding path program 1 times [2019-10-03 02:59:03,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:03,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:59:03,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:03,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:59:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:59:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:03,670 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand 6 states. [2019-10-03 02:59:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:03,703 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-10-03 02:59:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:03,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-10-03 02:59:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:03,706 INFO L225 Difference]: With dead ends: 190 [2019-10-03 02:59:03,706 INFO L226 Difference]: Without dead ends: 190 [2019-10-03 02:59:03,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-03 02:59:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-10-03 02:59:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-03 02:59:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2019-10-03 02:59:03,718 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 88 [2019-10-03 02:59:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:03,718 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2019-10-03 02:59:03,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:59:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2019-10-03 02:59:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:59:03,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:03,720 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:03,720 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1801037685, now seen corresponding path program 1 times [2019-10-03 02:59:03,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:03,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:03,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:59:03,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:03,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:59:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:59:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:03,808 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand 8 states. [2019-10-03 02:59:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:03,840 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-10-03 02:59:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:59:03,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-10-03 02:59:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:03,843 INFO L225 Difference]: With dead ends: 197 [2019-10-03 02:59:03,844 INFO L226 Difference]: Without dead ends: 197 [2019-10-03 02:59:03,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-03 02:59:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-10-03 02:59:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-03 02:59:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2019-10-03 02:59:03,853 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 88 [2019-10-03 02:59:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:03,854 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2019-10-03 02:59:03,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:59:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2019-10-03 02:59:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:59:03,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:03,856 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:03,856 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 310252684, now seen corresponding path program 1 times [2019-10-03 02:59:03,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:03,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:03,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:03,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:59:03,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:03,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:59:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:59:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:03,934 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand 4 states. [2019-10-03 02:59:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:04,136 INFO L93 Difference]: Finished difference Result 396 states and 468 transitions. [2019-10-03 02:59:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:59:04,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:59:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:04,141 INFO L225 Difference]: With dead ends: 396 [2019-10-03 02:59:04,141 INFO L226 Difference]: Without dead ends: 396 [2019-10-03 02:59:04,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-03 02:59:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 387. [2019-10-03 02:59:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-03 02:59:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 451 transitions. [2019-10-03 02:59:04,161 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 451 transitions. Word has length 88 [2019-10-03 02:59:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:04,162 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 451 transitions. [2019-10-03 02:59:04,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:59:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 451 transitions. [2019-10-03 02:59:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:59:04,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:04,164 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:04,164 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1394429222, now seen corresponding path program 1 times [2019-10-03 02:59:04,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:04,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:04,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:04,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:04,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:59:04,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:04,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:59:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:59:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:59:04,355 INFO L87 Difference]: Start difference. First operand 387 states and 451 transitions. Second operand 9 states. [2019-10-03 02:59:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:05,377 INFO L93 Difference]: Finished difference Result 730 states and 848 transitions. [2019-10-03 02:59:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:59:05,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-03 02:59:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:05,385 INFO L225 Difference]: With dead ends: 730 [2019-10-03 02:59:05,385 INFO L226 Difference]: Without dead ends: 730 [2019-10-03 02:59:05,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:59:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-03 02:59:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 652. [2019-10-03 02:59:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-03 02:59:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 751 transitions. [2019-10-03 02:59:05,429 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 751 transitions. Word has length 92 [2019-10-03 02:59:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:05,430 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 751 transitions. [2019-10-03 02:59:05,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:59:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 751 transitions. [2019-10-03 02:59:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:59:05,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:05,433 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:05,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1563029790, now seen corresponding path program 1 times [2019-10-03 02:59:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:05,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:05,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 02:59:05,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:05,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:05,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-10-03 02:59:05,585 INFO L207 CegarAbsIntRunner]: [50], [51], [52], [56], [59], [83], [99], [103], [104], [105], [108], [110], [113], [120], [123], [124], [125], [134], [138], [142], [145], [148], [150], [156], [158], [164], [167], [186], [187], [188], [189], [190], [192], [197], [199], [200], [206], [209], [213], [219], [248], [252], [257], [261], [262], [265], [266], [267], [269], [270], [271], [273], [276], [278], [281], [284], [293], [295], [296], [297], [391], [392], [402], [410], [411], [412], [413], [414], [415], [416], [417], [418], [450], [451], [452], [453], [456], [457], [458], [459], [464], [465], [468], [469], [470], [471], [472], [473], [474], [475], [476], [477], [482], [483], [484], [485], [486], [487], [488], [492], [493], [494], [502], [503], [504] [2019-10-03 02:59:05,636 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:05,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:05,734 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:59:05,736 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 0. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 128 variables. [2019-10-03 02:59:05,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:05,741 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:59:05,801 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:59:05,801 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:59:05,810 INFO L420 sIntCurrentIteration]: We unified 135 AI predicates to 135 [2019-10-03 02:59:05,810 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:59:05,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:59:05,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:59:05,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:05,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:05,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:05,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:05,814 INFO L87 Difference]: Start difference. First operand 652 states and 751 transitions. Second operand 2 states. [2019-10-03 02:59:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:05,816 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:59:05,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:05,817 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 136 [2019-10-03 02:59:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:05,817 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:59:05,817 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:59:05,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-10-03 02:59:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:59:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:59:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:59:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:59:05,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2019-10-03 02:59:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:05,819 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:59:05,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:59:05,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:59:05,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:59:05 BoogieIcfgContainer [2019-10-03 02:59:05,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:59:05,830 INFO L168 Benchmark]: Toolchain (without parser) took 7285.70 ms. Allocated memory was 138.4 MB in the beginning and 329.8 MB in the end (delta: 191.4 MB). Free memory was 83.8 MB in the beginning and 93.7 MB in the end (delta: -9.9 MB). Peak memory consumption was 181.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,831 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.48 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 83.6 MB in the beginning and 164.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,835 INFO L168 Benchmark]: Boogie Preprocessor took 138.44 ms. Allocated memory is still 198.7 MB. Free memory was 164.7 MB in the beginning and 160.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,843 INFO L168 Benchmark]: RCFGBuilder took 1139.34 ms. Allocated memory was 198.7 MB in the beginning and 220.7 MB in the end (delta: 22.0 MB). Free memory was 160.9 MB in the beginning and 191.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,844 INFO L168 Benchmark]: TraceAbstraction took 5295.49 ms. Allocated memory was 220.7 MB in the beginning and 329.8 MB in the end (delta: 109.1 MB). Free memory was 191.6 MB in the beginning and 93.7 MB in the end (delta: 97.9 MB). Peak memory consumption was 207.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:05,856 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.27 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.48 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 83.6 MB in the beginning and 164.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.44 ms. Allocated memory is still 198.7 MB. Free memory was 164.7 MB in the beginning and 160.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1139.34 ms. Allocated memory was 198.7 MB in the beginning and 220.7 MB in the end (delta: 22.0 MB). Free memory was 160.9 MB in the beginning and 191.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5295.49 ms. Allocated memory was 220.7 MB in the beginning and 329.8 MB in the end (delta: 109.1 MB). Free memory was 191.6 MB in the beginning and 93.7 MB in the end (delta: 97.9 MB). Peak memory consumption was 207.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 82]: 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 40 procedures, 229 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1299 SDtfs, 934 SDslu, 2535 SDs, 0 SdLazy, 1488 SolverSat, 347 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.8888888888888888 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 128 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 826 ConstructedInterpolants, 0 QuantifiedInterpolants, 124120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 61/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...