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_spec1_product45.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:47:58,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:47:58,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:47:58,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:47:58,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:47:58,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:47:58,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:47:58,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:47:58,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:47:58,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:47:58,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:47:58,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:47:58,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:47:58,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:47:58,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:47:58,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:47:58,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:47:58,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:47:58,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:47:58,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:47:58,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:47:58,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:47:58,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:47:58,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:47:58,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:47:58,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:47:58,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:47:58,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:47:58,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:47:58,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:47:58,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:47:58,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:47:58,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:47:58,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:47:58,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:47:58,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:47:58,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:47:58,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:47:58,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:47:58,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:47:58,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:47:58,146 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:47:58,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:47:58,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:47:58,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:47:58,180 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:47:58,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:47:58,181 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:47:58,181 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:47:58,182 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:47:58,182 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:47:58,182 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:47:58,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:47:58,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:47:58,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:47:58,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:47:58,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:47:58,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:47:58,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:47:58,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:47:58,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:47:58,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:47:58,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:47:58,185 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:47:58,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:47:58,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:47:58,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:47:58,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:47:58,188 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:47:58,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:47:58,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:47:58,189 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:47:58,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:47:58,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:47:58,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:47:58,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:47:58,263 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:47:58,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec1_product45.cil.c [2019-09-10 02:47:58,323 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271f7ded/2e4e4fe37fc8450f90c32f4286248011/FLAG69806ce80 [2019-09-10 02:47:58,783 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:47:58,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec1_product45.cil.c [2019-09-10 02:47:58,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271f7ded/2e4e4fe37fc8450f90c32f4286248011/FLAG69806ce80 [2019-09-10 02:47:59,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d271f7ded/2e4e4fe37fc8450f90c32f4286248011 [2019-09-10 02:47:59,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:47:59,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:47:59,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:47:59,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:47:59,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:47:59,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4a666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59, skipping insertion in model container [2019-09-10 02:47:59,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,168 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:47:59,222 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:47:59,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:47:59,725 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:47:59,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:47:59,861 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:47:59,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59 WrapperNode [2019-09-10 02:47:59,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:47:59,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:47:59,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:47:59,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:47:59,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (1/1) ... [2019-09-10 02:47:59,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:47:59,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:47:59,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:47:59,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:47:59,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47: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-09-10 02:48:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:48:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:48:00,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure printEnvironment [2019-09-10 02:48:00,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2019-09-10 02:48:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2019-09-10 02:48:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:48:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-10 02:48:00,018 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:48:00,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:48:00,019 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:48:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:48:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:48:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:48:00,020 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:48:00,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2019-09-10 02:48:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump__wrappee__highWaterSensor [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure printPump [2019-09-10 02:48:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2019-09-10 02:48:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:48:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure printEnvironment [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:48:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure printPump [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:48:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:48:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:48:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:48:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:48:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:48:00,026 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:48:00,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:48:00,028 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:48:00,029 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2019-09-10 02:48:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2019-09-10 02:48:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump__wrappee__highWaterSensor [2019-09-10 02:48:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:48:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:48:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:48:01,128 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:48:01,128 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-10 02:48:01,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:48:01 BoogieIcfgContainer [2019-09-10 02:48:01,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:48:01,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:48:01,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:48:01,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:48:01,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:47:59" (1/3) ... [2019-09-10 02:48:01,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a421f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:48:01, skipping insertion in model container [2019-09-10 02:48:01,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:47:59" (2/3) ... [2019-09-10 02:48:01,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a421f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:48:01, skipping insertion in model container [2019-09-10 02:48:01,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:48:01" (3/3) ... [2019-09-10 02:48:01,138 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product45.cil.c [2019-09-10 02:48:01,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:48:01,157 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:48:01,175 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:48:01,206 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:48:01,206 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:48:01,206 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:48:01,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:48:01,207 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:48:01,207 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:48:01,207 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:48:01,207 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:48:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-10 02:48:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-10 02:48:01,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:01,238 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] [2019-09-10 02:48:01,241 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1763081390, now seen corresponding path program 1 times [2019-09-10 02:48:01,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:01,593 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:48:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:01,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:48:01,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:01,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:48:01,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:48:01,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:48:01,622 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 2 states. [2019-09-10 02:48:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:01,672 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2019-09-10 02:48:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:48:01,678 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 46 [2019-09-10 02:48:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:01,697 INFO L225 Difference]: With dead ends: 141 [2019-09-10 02:48:01,702 INFO L226 Difference]: Without dead ends: 130 [2019-09-10 02:48:01,705 INFO L628 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-09-10 02:48:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-10 02:48:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-09-10 02:48:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:48:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-09-10 02:48:01,771 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 46 [2019-09-10 02:48:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:01,771 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-09-10 02:48:01,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:48:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-09-10 02:48:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 02:48:01,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:01,775 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] [2019-09-10 02:48:01,776 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1948835968, now seen corresponding path program 1 times [2019-09-10 02:48:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:01,918 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:48:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:48:01,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:01,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:48:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:48:01,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:48:01,923 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 3 states. [2019-09-10 02:48:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:01,939 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2019-09-10 02:48:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:48:01,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-10 02:48:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:01,942 INFO L225 Difference]: With dead ends: 121 [2019-09-10 02:48:01,942 INFO L226 Difference]: Without dead ends: 121 [2019-09-10 02:48:01,943 INFO L628 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-09-10 02:48:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-10 02:48:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-10 02:48:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 02:48:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-09-10 02:48:01,955 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 47 [2019-09-10 02:48:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:01,956 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-09-10 02:48:01,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:48:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2019-09-10 02:48:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 02:48:01,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:01,958 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] [2019-09-10 02:48:01,959 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:01,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash -970175768, now seen corresponding path program 1 times [2019-09-10 02:48:01,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:01,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:02,087 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:48:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:02,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:48:02,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:02,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:48:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:48:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:48:02,089 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 7 states. [2019-09-10 02:48:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:02,434 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2019-09-10 02:48:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:48:02,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-10 02:48:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:02,437 INFO L225 Difference]: With dead ends: 121 [2019-09-10 02:48:02,437 INFO L226 Difference]: Without dead ends: 121 [2019-09-10 02:48:02,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-09-10 02:48:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-10 02:48:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-09-10 02:48:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 02:48:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2019-09-10 02:48:02,448 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 51 [2019-09-10 02:48:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:02,449 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2019-09-10 02:48:02,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:48:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2019-09-10 02:48:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 02:48:02,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:02,452 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] [2019-09-10 02:48:02,452 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:02,452 INFO L82 PathProgramCache]: Analyzing trace with hash 137025886, now seen corresponding path program 1 times [2019-09-10 02:48:02,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:02,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:02,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:02,607 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:48:02,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:02,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:48:02,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:02,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:48:02,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:48:02,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:48:02,609 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 5 states. [2019-09-10 02:48:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:03,148 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2019-09-10 02:48:03,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:48:03,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 02:48:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:03,151 INFO L225 Difference]: With dead ends: 222 [2019-09-10 02:48:03,152 INFO L226 Difference]: Without dead ends: 222 [2019-09-10 02:48:03,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:48:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-10 02:48:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 204. [2019-09-10 02:48:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-10 02:48:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2019-09-10 02:48:03,194 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 64 [2019-09-10 02:48:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:03,194 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2019-09-10 02:48:03,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:48:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2019-09-10 02:48:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 02:48:03,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:03,203 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] [2019-09-10 02:48:03,203 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash -274572639, now seen corresponding path program 1 times [2019-09-10 02:48:03,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:03,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:03,348 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:48:03,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:03,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:48:03,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:03,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:48:03,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:48:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:48:03,350 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 6 states. [2019-09-10 02:48:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:03,579 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-09-10 02:48:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:48:03,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 02:48:03,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:03,587 INFO L225 Difference]: With dead ends: 369 [2019-09-10 02:48:03,588 INFO L226 Difference]: Without dead ends: 369 [2019-09-10 02:48:03,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:48:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-10 02:48:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2019-09-10 02:48:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-10 02:48:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 416 transitions. [2019-09-10 02:48:03,644 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 416 transitions. Word has length 78 [2019-09-10 02:48:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:03,645 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 416 transitions. [2019-09-10 02:48:03,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:48:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 416 transitions. [2019-09-10 02:48:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 02:48:03,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:03,648 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] [2019-09-10 02:48:03,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:03,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1223934493, now seen corresponding path program 1 times [2019-09-10 02:48:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:03,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:03,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:03,811 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:48:03,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:03,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:48:03,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:03,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:48:03,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:48:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:48:03,813 INFO L87 Difference]: Start difference. First operand 363 states and 416 transitions. Second operand 7 states. [2019-09-10 02:48:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:04,540 INFO L93 Difference]: Finished difference Result 393 states and 463 transitions. [2019-09-10 02:48:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:48:04,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-10 02:48:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:04,543 INFO L225 Difference]: With dead ends: 393 [2019-09-10 02:48:04,544 INFO L226 Difference]: Without dead ends: 393 [2019-09-10 02:48:04,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:48:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-10 02:48:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 363. [2019-09-10 02:48:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-10 02:48:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 415 transitions. [2019-09-10 02:48:04,562 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 415 transitions. Word has length 82 [2019-09-10 02:48:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:04,563 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 415 transitions. [2019-09-10 02:48:04,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:48:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 415 transitions. [2019-09-10 02:48:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:48:04,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:04,566 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:48:04,566 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1913348729, now seen corresponding path program 1 times [2019-09-10 02:48:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:04,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:04,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:48:04,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:48:04,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:04,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:48:04,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:48:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:48:04,638 INFO L87 Difference]: Start difference. First operand 363 states and 415 transitions. Second operand 6 states. [2019-09-10 02:48:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:04,665 INFO L93 Difference]: Finished difference Result 377 states and 429 transitions. [2019-09-10 02:48:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:48:04,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 02:48:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:04,668 INFO L225 Difference]: With dead ends: 377 [2019-09-10 02:48:04,669 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 02:48:04,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:48:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 02:48:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 373. [2019-09-10 02:48:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-10 02:48:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 425 transitions. [2019-09-10 02:48:04,685 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 425 transitions. Word has length 98 [2019-09-10 02:48:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:04,686 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 425 transitions. [2019-09-10 02:48:04,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:48:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 425 transitions. [2019-09-10 02:48:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:48:04,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:04,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:48:04,689 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1019862391, now seen corresponding path program 1 times [2019-09-10 02:48:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:04,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:48:04,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:04,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:48:04,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:04,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:48:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:48:04,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:48:04,836 INFO L87 Difference]: Start difference. First operand 373 states and 425 transitions. Second operand 8 states. [2019-09-10 02:48:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:04,875 INFO L93 Difference]: Finished difference Result 387 states and 439 transitions. [2019-09-10 02:48:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:48:04,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-09-10 02:48:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:04,882 INFO L225 Difference]: With dead ends: 387 [2019-09-10 02:48:04,882 INFO L226 Difference]: Without dead ends: 387 [2019-09-10 02:48:04,883 INFO L628 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-09-10 02:48:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-10 02:48:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2019-09-10 02:48:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-09-10 02:48:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 433 transitions. [2019-09-10 02:48:04,909 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 433 transitions. Word has length 98 [2019-09-10 02:48:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:04,910 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 433 transitions. [2019-09-10 02:48:04,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:48:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 433 transitions. [2019-09-10 02:48:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:48:04,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:04,916 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:48:04,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1027621750, now seen corresponding path program 1 times [2019-09-10 02:48:04,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:04,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:48:05,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:48:05,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:48:05,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:05,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:48:05,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:48:05,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:48:05,073 INFO L87 Difference]: Start difference. First operand 381 states and 433 transitions. Second operand 4 states. [2019-09-10 02:48:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:05,280 INFO L93 Difference]: Finished difference Result 766 states and 913 transitions. [2019-09-10 02:48:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:48:05,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-10 02:48:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:05,289 INFO L225 Difference]: With dead ends: 766 [2019-09-10 02:48:05,289 INFO L226 Difference]: Without dead ends: 766 [2019-09-10 02:48:05,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:48:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-09-10 02:48:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 751. [2019-09-10 02:48:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-10 02:48:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 881 transitions. [2019-09-10 02:48:05,334 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 881 transitions. Word has length 98 [2019-09-10 02:48:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:05,336 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 881 transitions. [2019-09-10 02:48:05,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:48:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 881 transitions. [2019-09-10 02:48:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 02:48:05,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:05,339 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:48:05,340 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1865521988, now seen corresponding path program 1 times [2019-09-10 02:48:05,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:48:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:05,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:48:05,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:48:05,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:48:05,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 02:48:05,501 INFO L207 CegarAbsIntRunner]: [50], [51], [52], [56], [59], [83], [99], [103], [104], [105], [120], [123], [125], [134], [138], [142], [145], [150], [153], [158], [161], [185], [187], [192], [195], [198], [200], [205], [207], [208], [209], [210], [216], [220], [262], [266], [267], [270], [271], [274], [276], [279], [289], [290], [291], [314], [316], [317], [335], [336], [386], [387], [392], [394], [397], [401], [403], [406], [408], [411], [424], [425], [426], [427], [428], [429], [430], [431], [432], [470], [471], [472], [473], [474], [475], [476], [480], [481], [482], [483], [484], [485], [488], [489], [490], [496], [497], [498], [499], [506], [508], [509], [514], [515], [516], [518], [519], [520], [521], [522] [2019-09-10 02:48:05,558 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:48:05,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:48:05,630 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:48:05,632 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 0. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 126 variables. [2019-09-10 02:48:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:05,637 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:48:05,685 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:48:05,685 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:48:05,688 INFO L420 sIntCurrentIteration]: We unified 101 AI predicates to 101 [2019-09-10 02:48:05,688 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:48:05,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:48:05,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 13 [2019-09-10 02:48:05,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:05,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:48:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:48:05,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:48:05,691 INFO L87 Difference]: Start difference. First operand 751 states and 881 transitions. Second operand 2 states. [2019-09-10 02:48:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:05,691 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:48:05,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:48:05,692 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 102 [2019-09-10 02:48:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:05,692 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:48:05,692 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:48:05,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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:48:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:48:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:48:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:48:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:48:05,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2019-09-10 02:48:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:05,694 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:48:05,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:48:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:48:05,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:48:05,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:48:05 BoogieIcfgContainer [2019-09-10 02:48:05,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:48:05,708 INFO L168 Benchmark]: Toolchain (without parser) took 6559.91 ms. Allocated memory was 132.6 MB in the beginning and 322.4 MB in the end (delta: 189.8 MB). Free memory was 86.4 MB in the beginning and 199.7 MB in the end (delta: -113.3 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,709 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.52 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.1 MB in the beginning and 164.1 MB in the end (delta: -78.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,712 INFO L168 Benchmark]: Boogie Preprocessor took 89.33 ms. Allocated memory is still 199.8 MB. Free memory was 164.1 MB in the beginning and 159.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,713 INFO L168 Benchmark]: RCFGBuilder took 1178.20 ms. Allocated memory was 199.8 MB in the beginning and 223.3 MB in the end (delta: 23.6 MB). Free memory was 159.7 MB in the beginning and 192.9 MB in the end (delta: -33.2 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,716 INFO L168 Benchmark]: TraceAbstraction took 4573.74 ms. Allocated memory was 223.3 MB in the beginning and 322.4 MB in the end (delta: 99.1 MB). Free memory was 191.6 MB in the beginning and 199.7 MB in the end (delta: -8.1 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:05,721 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.21 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.52 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 86.1 MB in the beginning and 164.1 MB in the end (delta: -78.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.33 ms. Allocated memory is still 199.8 MB. Free memory was 164.1 MB in the beginning and 159.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1178.20 ms. Allocated memory was 199.8 MB in the beginning and 223.3 MB in the end (delta: 23.6 MB). Free memory was 159.7 MB in the beginning and 192.9 MB in the end (delta: -33.2 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4573.74 ms. Allocated memory was 223.3 MB in the beginning and 322.4 MB in the end (delta: 99.1 MB). Free memory was 191.6 MB in the beginning and 199.7 MB in the end (delta: -8.1 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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 39 procedures, 232 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1396 SDtfs, 771 SDslu, 2899 SDs, 0 SdLazy, 1012 SolverSat, 235 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred 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, 1.0693069306930694 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 79 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 764 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 100151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...