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_spec2_product45.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:57:35,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:57:35,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:57:35,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:57:35,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:57:35,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:57:35,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:57:35,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:57:35,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:57:35,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:57:35,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:57:35,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:57:35,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:57:35,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:57:35,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:57:35,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:57:35,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:57:35,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:57:35,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:57:35,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:57:35,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:57:35,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:57:35,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:57:35,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:57:35,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:57:35,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:57:35,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:57:35,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:57:35,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:57:35,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:57:35,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:57:35,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:57:35,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:57:35,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:57:35,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:57:35,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:57:35,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:57:35,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:57:35,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:57:35,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:57:35,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:57:35,154 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:57:35,169 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:57:35,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:57:35,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:57:35,170 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:57:35,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:57:35,171 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:57:35,171 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:57:35,171 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:57:35,171 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:57:35,172 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:57:35,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:57:35,173 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:57:35,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:57:35,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:57:35,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:57:35,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:57:35,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:57:35,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:57:35,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:57:35,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:57:35,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:57:35,175 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:57:35,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:57:35,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:57:35,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:57:35,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:57:35,176 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:57:35,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:57:35,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:57:35,177 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:57:35,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:57:35,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:57:35,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:57:35,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:57:35,237 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:57:35,237 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec2_product45.cil.c [2019-10-03 02:57:35,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c30532a7/0de9ea5f00874469ab19abf2b32e81c1/FLAGd99046609 [2019-10-03 02:57:35,766 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:57:35,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec2_product45.cil.c [2019-10-03 02:57:35,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c30532a7/0de9ea5f00874469ab19abf2b32e81c1/FLAGd99046609 [2019-10-03 02:57:36,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c30532a7/0de9ea5f00874469ab19abf2b32e81c1 [2019-10-03 02:57:36,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:57:36,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:57:36,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:57:36,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:57:36,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:57:36,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:36,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2979f7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36, skipping insertion in model container [2019-10-03 02:57:36,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:36,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:57:36,225 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:57:36,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:57:36,781 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:57:36,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:57:36,979 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:57:36,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36 WrapperNode [2019-10-03 02:57:36,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:57:36,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:57:36,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:57:36,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:57:36,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (1/1) ... [2019-10-03 02:57:37,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:57:37,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:57:37,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:57:37,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:57:37,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (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:57:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:57:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:57:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:57:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:57:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:57:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:57:37,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:57:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:57:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:57:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:57:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:57:37,191 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:57:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:57:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:57:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:57:37,192 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:57:37,193 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2019-10-03 02:57:37,193 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2019-10-03 02:57:37,193 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2019-10-03 02:57:37,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump__wrappee__highWaterSensor [2019-10-03 02:57:37,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure printPump [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2019-10-03 02:57:37,194 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:57:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2019-10-03 02:57:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2019-10-03 02:57:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2019-10-03 02:57:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2019-10-03 02:57:37,195 INFO L138 BoogieDeclarations]: Found implementation of procedure printEnvironment [2019-10-03 02:57:37,196 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2019-10-03 02:57:37,196 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2019-10-03 02:57:37,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:57:37,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:57:37,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:57:37,197 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:57:37,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:57:37,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:57:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:57:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:57:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:57:37,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:57:37,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:57:37,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:57:37,200 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure printPump [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:57:37,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:57:37,202 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure printEnvironment [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2019-10-03 02:57:37,203 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2019-10-03 02:57:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump__wrappee__highWaterSensor [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:57:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:57:38,320 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:57:38,320 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-03 02:57:38,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:57:38 BoogieIcfgContainer [2019-10-03 02:57:38,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:57:38,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:57:38,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:57:38,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:57:38,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:57:36" (1/3) ... [2019-10-03 02:57:38,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4bfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:57:38, skipping insertion in model container [2019-10-03 02:57:38,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:57:36" (2/3) ... [2019-10-03 02:57:38,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4bfdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:57:38, skipping insertion in model container [2019-10-03 02:57:38,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:57:38" (3/3) ... [2019-10-03 02:57:38,331 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product45.cil.c [2019-10-03 02:57:38,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:57:38,350 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:57:38,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:57:38,397 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:57:38,397 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:57:38,397 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:57:38,398 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:57:38,398 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:57:38,398 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:57:38,398 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:57:38,398 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:57:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2019-10-03 02:57:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:57:38,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:38,435 INFO L411 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-10-03 02:57:38,437 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1016037874, now seen corresponding path program 1 times [2019-10-03 02:57:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:38,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:38,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:38,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:38,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:38,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:57:38,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:38,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:57:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:57:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:57:38,838 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 2 states. [2019-10-03 02:57:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:38,872 INFO L93 Difference]: Finished difference Result 146 states and 172 transitions. [2019-10-03 02:57:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:57:38,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 51 [2019-10-03 02:57:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:38,888 INFO L225 Difference]: With dead ends: 146 [2019-10-03 02:57:38,888 INFO L226 Difference]: Without dead ends: 135 [2019-10-03 02:57:38,890 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:57:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-03 02:57:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-10-03 02:57:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-03 02:57:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2019-10-03 02:57:38,947 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 51 [2019-10-03 02:57:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:38,948 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2019-10-03 02:57:38,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:57:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2019-10-03 02:57:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:57:38,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:38,953 INFO L411 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] [2019-10-03 02:57:38,954 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2062541652, now seen corresponding path program 1 times [2019-10-03 02:57:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:38,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:39,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:57:39,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:57:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:57:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:57:39,117 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand 3 states. [2019-10-03 02:57:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:39,144 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2019-10-03 02:57:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:57:39,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-03 02:57:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:39,151 INFO L225 Difference]: With dead ends: 126 [2019-10-03 02:57:39,152 INFO L226 Difference]: Without dead ends: 126 [2019-10-03 02:57:39,152 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:57:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-03 02:57:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-10-03 02:57:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-03 02:57:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2019-10-03 02:57:39,184 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 52 [2019-10-03 02:57:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:39,185 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2019-10-03 02:57:39,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:57:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2019-10-03 02:57:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:57:39,195 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:39,195 INFO L411 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] [2019-10-03 02:57:39,196 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1086390402, now seen corresponding path program 1 times [2019-10-03 02:57:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:39,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:39,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:39,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:39,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:39,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:39,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:57:39,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:39,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:57:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:57:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:57:39,346 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand 7 states. [2019-10-03 02:57:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:39,767 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2019-10-03 02:57:39,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:57:39,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-03 02:57:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:39,774 INFO L225 Difference]: With dead ends: 126 [2019-10-03 02:57:39,774 INFO L226 Difference]: Without dead ends: 126 [2019-10-03 02:57:39,775 INFO L640 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-10-03 02:57:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-03 02:57:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-10-03 02:57:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-03 02:57:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2019-10-03 02:57:39,798 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 56 [2019-10-03 02:57:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:39,798 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2019-10-03 02:57:39,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:57:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2019-10-03 02:57:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 02:57:39,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:39,808 INFO L411 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] [2019-10-03 02:57:39,808 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -848651131, now seen corresponding path program 1 times [2019-10-03 02:57:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:39,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:39,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:39,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:57:39,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:39,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:57:39,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:57:39,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:57:39,945 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 5 states. [2019-10-03 02:57:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:40,591 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2019-10-03 02:57:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:57:40,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-03 02:57:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:40,599 INFO L225 Difference]: With dead ends: 229 [2019-10-03 02:57:40,599 INFO L226 Difference]: Without dead ends: 229 [2019-10-03 02:57:40,600 INFO L640 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-10-03 02:57:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-03 02:57:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 211. [2019-10-03 02:57:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-03 02:57:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 243 transitions. [2019-10-03 02:57:40,638 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 243 transitions. Word has length 69 [2019-10-03 02:57:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:40,638 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 243 transitions. [2019-10-03 02:57:40,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:57:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 243 transitions. [2019-10-03 02:57:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 02:57:40,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:40,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:40,646 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1442987939, now seen corresponding path program 1 times [2019-10-03 02:57:40,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:40,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:40,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:40,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:57:40,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:40,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:57:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:57:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:57:40,830 INFO L87 Difference]: Start difference. First operand 211 states and 243 transitions. Second operand 6 states. [2019-10-03 02:57:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:41,053 INFO L93 Difference]: Finished difference Result 376 states and 433 transitions. [2019-10-03 02:57:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:57:41,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 02:57:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:41,059 INFO L225 Difference]: With dead ends: 376 [2019-10-03 02:57:41,059 INFO L226 Difference]: Without dead ends: 376 [2019-10-03 02:57:41,059 INFO L640 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-10-03 02:57:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-03 02:57:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 370. [2019-10-03 02:57:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-03 02:57:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 426 transitions. [2019-10-03 02:57:41,090 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 426 transitions. Word has length 83 [2019-10-03 02:57:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:41,091 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 426 transitions. [2019-10-03 02:57:41,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:57:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 426 transitions. [2019-10-03 02:57:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:57:41,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:41,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:41,094 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash -142547263, now seen corresponding path program 1 times [2019-10-03 02:57:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:41,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:57:41,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:41,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:57:41,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:41,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:57:41,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:57:41,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:57:41,231 INFO L87 Difference]: Start difference. First operand 370 states and 426 transitions. Second operand 7 states. [2019-10-03 02:57:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:41,931 INFO L93 Difference]: Finished difference Result 399 states and 471 transitions. [2019-10-03 02:57:41,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:57:41,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-10-03 02:57:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:41,935 INFO L225 Difference]: With dead ends: 399 [2019-10-03 02:57:41,936 INFO L226 Difference]: Without dead ends: 399 [2019-10-03 02:57:41,937 INFO L640 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-10-03 02:57:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-03 02:57:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 369. [2019-10-03 02:57:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-03 02:57:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 423 transitions. [2019-10-03 02:57:41,960 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 423 transitions. Word has length 87 [2019-10-03 02:57:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:41,961 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 423 transitions. [2019-10-03 02:57:41,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:57:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 423 transitions. [2019-10-03 02:57:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:57:41,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:41,963 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:41,964 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1138633269, now seen corresponding path program 1 times [2019-10-03 02:57:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:41,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:41,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:41,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:42,042 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:57:42,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:42,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:57:42,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:42,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:57:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:57:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:57:42,045 INFO L87 Difference]: Start difference. First operand 369 states and 423 transitions. Second operand 6 states. [2019-10-03 02:57:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:42,076 INFO L93 Difference]: Finished difference Result 383 states and 437 transitions. [2019-10-03 02:57:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:57:42,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-10-03 02:57:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:42,079 INFO L225 Difference]: With dead ends: 383 [2019-10-03 02:57:42,079 INFO L226 Difference]: Without dead ends: 383 [2019-10-03 02:57:42,080 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:57:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-03 02:57:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2019-10-03 02:57:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-03 02:57:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 433 transitions. [2019-10-03 02:57:42,096 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 433 transitions. Word has length 103 [2019-10-03 02:57:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:42,097 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 433 transitions. [2019-10-03 02:57:42,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:57:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 433 transitions. [2019-10-03 02:57:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:57:42,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:42,099 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:42,099 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash 789639433, now seen corresponding path program 1 times [2019-10-03 02:57:42,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:42,188 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:57:42,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:42,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:57:42,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:42,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:57:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:57:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:57:42,190 INFO L87 Difference]: Start difference. First operand 379 states and 433 transitions. Second operand 8 states. [2019-10-03 02:57:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:42,223 INFO L93 Difference]: Finished difference Result 393 states and 447 transitions. [2019-10-03 02:57:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:57:42,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-10-03 02:57:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:42,226 INFO L225 Difference]: With dead ends: 393 [2019-10-03 02:57:42,226 INFO L226 Difference]: Without dead ends: 393 [2019-10-03 02:57:42,227 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:57:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-03 02:57:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 387. [2019-10-03 02:57:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-03 02:57:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 441 transitions. [2019-10-03 02:57:42,242 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 441 transitions. Word has length 103 [2019-10-03 02:57:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:42,242 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 441 transitions. [2019-10-03 02:57:42,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:57:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 441 transitions. [2019-10-03 02:57:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:57:42,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:42,245 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:42,245 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 549099304, now seen corresponding path program 1 times [2019-10-03 02:57:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:42,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:42,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:42,319 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:57:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:57:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:57:42,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:42,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:57:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:57:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:57:42,321 INFO L87 Difference]: Start difference. First operand 387 states and 441 transitions. Second operand 4 states. [2019-10-03 02:57:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:42,554 INFO L93 Difference]: Finished difference Result 773 states and 923 transitions. [2019-10-03 02:57:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:57:42,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-03 02:57:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:42,559 INFO L225 Difference]: With dead ends: 773 [2019-10-03 02:57:42,559 INFO L226 Difference]: Without dead ends: 773 [2019-10-03 02:57:42,560 INFO L640 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-10-03 02:57:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-03 02:57:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 758. [2019-10-03 02:57:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-03 02:57:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 891 transitions. [2019-10-03 02:57:42,588 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 891 transitions. Word has length 103 [2019-10-03 02:57:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:42,589 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 891 transitions. [2019-10-03 02:57:42,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:57:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 891 transitions. [2019-10-03 02:57:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:57:42,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:42,592 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:42,592 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash 290063790, now seen corresponding path program 1 times [2019-10-03 02:57:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:42,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:57:42,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:57:42,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:57:42,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-10-03 02:57:42,731 INFO L207 CegarAbsIntRunner]: [50], [51], [52], [56], [59], [83], [99], [103], [104], [105], [120], [123], [125], [134], [138], [142], [145], [150], [153], [158], [161], [176], [178], [181], [183], [186], [189], [201], [202], [212], [214], [219], [222], [223], [225], [230], [232], [233], [241], [245], [278], [279], [289], [293], [294], [297], [298], [301], [303], [306], [316], [317], [318], [342], [344], [345], [363], [364], [414], [415], [422], [424], [425], [433], [434], [435], [436], [437], [438], [439], [440], [441], [479], [480], [481], [482], [483], [484], [485], [489], [490], [491], [492], [493], [495], [496], [497], [498], [499], [500], [503], [504], [505], [511], [512], [513], [514], [521], [522], [523], [525], [526], [531], [532], [533] [2019-10-03 02:57:42,778 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:57:42,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:57:42,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:57:42,857 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:57:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:42,862 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:57:42,907 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:57:42,908 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:57:42,911 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-10-03 02:57:42,911 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:57:42,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:57:42,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 13 [2019-10-03 02:57:42,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:42,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:57:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:57:42,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:57:42,914 INFO L87 Difference]: Start difference. First operand 758 states and 891 transitions. Second operand 2 states. [2019-10-03 02:57:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:42,914 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:57:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:57:42,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 107 [2019-10-03 02:57:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:42,915 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:57:42,915 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:57:42,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 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:57:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:57:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:57:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:57:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:57:42,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2019-10-03 02:57:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:42,916 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:57:42,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:57:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:57:42,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:57:42,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:57:42 BoogieIcfgContainer [2019-10-03 02:57:42,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:57:42,925 INFO L168 Benchmark]: Toolchain (without parser) took 6771.50 ms. Allocated memory was 136.8 MB in the beginning and 358.1 MB in the end (delta: 221.2 MB). Free memory was 83.1 MB in the beginning and 243.8 MB in the end (delta: -160.7 MB). Peak memory consumption was 60.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:42,926 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.7 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:57:42,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.56 ms. Allocated memory was 136.8 MB in the beginning and 196.6 MB in the end (delta: 59.8 MB). Free memory was 82.9 MB in the beginning and 159.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:42,928 INFO L168 Benchmark]: Boogie Preprocessor took 143.64 ms. Allocated memory is still 196.6 MB. Free memory was 159.4 MB in the beginning and 155.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:42,929 INFO L168 Benchmark]: RCFGBuilder took 1191.32 ms. Allocated memory was 196.6 MB in the beginning and 214.4 MB in the end (delta: 17.8 MB). Free memory was 155.5 MB in the beginning and 184.8 MB in the end (delta: -29.3 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:42,930 INFO L168 Benchmark]: TraceAbstraction took 4598.97 ms. Allocated memory was 214.4 MB in the beginning and 358.1 MB in the end (delta: 143.7 MB). Free memory was 184.8 MB in the beginning and 243.8 MB in the end (delta: -59.0 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:42,934 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.56 ms. Allocated memory was 136.8 MB in the beginning and 196.6 MB in the end (delta: 59.8 MB). Free memory was 82.9 MB in the beginning and 159.4 MB in the end (delta: -76.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.64 ms. Allocated memory is still 196.6 MB. Free memory was 159.4 MB in the beginning and 155.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1191.32 ms. Allocated memory was 196.6 MB in the beginning and 214.4 MB in the end (delta: 17.8 MB). Free memory was 155.5 MB in the beginning and 184.8 MB in the end (delta: -29.3 MB). Peak memory consumption was 94.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4598.97 ms. Allocated memory was 214.4 MB in the beginning and 358.1 MB in the end (delta: 143.7 MB). Free memory was 184.8 MB in the beginning and 243.8 MB in the end (delta: -59.0 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 410]: 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, 237 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1465 SDtfs, 801 SDslu, 3017 SDs, 0 SdLazy, 1052 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=758occurred 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.0377358490566038 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.8s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 111212 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...