java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/minepump_spec5_product58.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:59:14,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:14,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:14,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:14,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:14,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:14,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:14,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:14,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:14,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:14,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:14,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:14,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:14,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:14,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:14,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:14,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:14,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:14,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:14,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:14,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:14,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:14,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:14,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:14,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:14,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:14,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:14,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:14,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:14,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:14,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:14,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:14,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:14,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:14,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:14,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:14,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:14,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:14,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:14,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:14,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:14,491 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:59:14,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:14,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:14,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:14,506 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:14,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:14,507 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:14,507 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:14,507 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:14,508 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:14,508 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:14,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:14,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:14,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:14,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:14,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:14,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:14,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:14,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:14,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:14,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:14,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:14,511 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:14,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:14,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:14,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:14,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:14,512 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:14,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:14,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:14,512 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:14,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:14,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:14,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:14,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:14,556 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:14,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/minepump_spec5_product58.cil.c [2019-10-03 02:59:14,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aae60eb/9d01e2a4baf94135a576f7e3f8d5907d/FLAGbed24683b [2019-10-03 02:59:15,144 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:15,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/minepump_spec5_product58.cil.c [2019-10-03 02:59:15,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aae60eb/9d01e2a4baf94135a576f7e3f8d5907d/FLAGbed24683b [2019-10-03 02:59:15,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43aae60eb/9d01e2a4baf94135a576f7e3f8d5907d [2019-10-03 02:59:15,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:15,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:15,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:15,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:15,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:15,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:15" (1/1) ... [2019-10-03 02:59:15,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a266f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:15, skipping insertion in model container [2019-10-03 02:59:15,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:15" (1/1) ... [2019-10-03 02:59:15,462 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:15,522 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:15,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:15,955 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:16,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:16,148 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:16,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16 WrapperNode [2019-10-03 02:59:16,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:16,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:16,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:16,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:16,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (1/1) ... [2019-10-03 02:59:16,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:16,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:16,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:16,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:16,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (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:59:16,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:59:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure lowerWaterLevel [2019-10-03 02:59:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2019-10-03 02:59:16,290 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure printEnvironment [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure getWaterLevel [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterSensorDry [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterSensorDry [2019-10-03 02:59:16,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__1 [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__2 [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification5_spec__3 [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:59:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:59:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2019-10-03 02:59:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump__wrappee__lowWaterSensor [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure activatePump [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2019-10-03 02:59:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure printPump [2019-10-03 02:59:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isHighWaterLevel [2019-10-03 02:59:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isLowWaterLevel [2019-10-03 02:59:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure startSystem [2019-10-03 02:59:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:59:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:59:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:59:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:59:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:59:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure lowerWaterLevel [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure getWaterLevel [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure printEnvironment [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterSensorDry [2019-10-03 02:59:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterSensorDry [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__1 [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__2 [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification5_spec__3 [2019-10-03 02:59:16,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:59:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:59:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure printPump [2019-10-03 02:59:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:59:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure startSystem [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2019-10-03 02:59:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure isHighWaterLevel [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure isLowWaterLevel [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure activatePump__wrappee__lowWaterSensor [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:59:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:59:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:17,353 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:17,353 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-03 02:59:17,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:17 BoogieIcfgContainer [2019-10-03 02:59:17,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:17,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:17,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:17,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:17,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:15" (1/3) ... [2019-10-03 02:59:17,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5276efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:17, skipping insertion in model container [2019-10-03 02:59:17,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:16" (2/3) ... [2019-10-03 02:59:17,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5276efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:17, skipping insertion in model container [2019-10-03 02:59:17,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:17" (3/3) ... [2019-10-03 02:59:17,363 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product58.cil.c [2019-10-03 02:59:17,372 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:17,381 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:17,397 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:17,423 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:17,424 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:17,424 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:17,424 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:17,424 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:17,425 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:17,425 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:17,425 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states. [2019-10-03 02:59:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:59:17,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:17,459 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:17,462 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash -229262266, now seen corresponding path program 1 times [2019-10-03 02:59:17,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:17,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:17,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:17,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:17,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:17,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:17,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:17,892 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 2 states. [2019-10-03 02:59:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:17,921 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2019-10-03 02:59:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:17,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 59 [2019-10-03 02:59:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:17,938 INFO L225 Difference]: With dead ends: 168 [2019-10-03 02:59:17,938 INFO L226 Difference]: Without dead ends: 157 [2019-10-03 02:59:17,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-03 02:59:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-03 02:59:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-03 02:59:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-10-03 02:59:17,999 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 59 [2019-10-03 02:59:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:18,000 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-10-03 02:59:18,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-10-03 02:59:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:59:18,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:18,004 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:18,005 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash -751857026, now seen corresponding path program 1 times [2019-10-03 02:59:18,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:18,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:18,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:18,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:18,114 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 3 states. [2019-10-03 02:59:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:18,131 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2019-10-03 02:59:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 02:59:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:18,134 INFO L225 Difference]: With dead ends: 148 [2019-10-03 02:59:18,135 INFO L226 Difference]: Without dead ends: 148 [2019-10-03 02:59:18,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-03 02:59:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-10-03 02:59:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-03 02:59:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2019-10-03 02:59:18,150 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 60 [2019-10-03 02:59:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:18,150 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2019-10-03 02:59:18,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2019-10-03 02:59:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:59:18,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:18,153 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:18,154 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:18,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:18,154 INFO L82 PathProgramCache]: Analyzing trace with hash -8533593, now seen corresponding path program 1 times [2019-10-03 02:59:18,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:18,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:59:18,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:18,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:18,308 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 7 states. [2019-10-03 02:59:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:18,667 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2019-10-03 02:59:18,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:18,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-03 02:59:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:18,670 INFO L225 Difference]: With dead ends: 148 [2019-10-03 02:59:18,671 INFO L226 Difference]: Without dead ends: 148 [2019-10-03 02:59:18,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:59:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-03 02:59:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-10-03 02:59:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-03 02:59:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2019-10-03 02:59:18,688 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 65 [2019-10-03 02:59:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:18,690 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2019-10-03 02:59:18,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:18,691 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2019-10-03 02:59:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 02:59:18,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:18,694 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] [2019-10-03 02:59:18,695 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2138732759, now seen corresponding path program 1 times [2019-10-03 02:59:18,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:18,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:18,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:18,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:18,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:59:18,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:18,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:59:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:59:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:59:18,917 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 5 states. [2019-10-03 02:59:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:19,479 INFO L93 Difference]: Finished difference Result 256 states and 296 transitions. [2019-10-03 02:59:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:59:19,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-03 02:59:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:19,482 INFO L225 Difference]: With dead ends: 256 [2019-10-03 02:59:19,483 INFO L226 Difference]: Without dead ends: 256 [2019-10-03 02:59:19,483 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:59:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-03 02:59:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2019-10-03 02:59:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-03 02:59:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 270 transitions. [2019-10-03 02:59:19,519 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 270 transitions. Word has length 78 [2019-10-03 02:59:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:19,520 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 270 transitions. [2019-10-03 02:59:19,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:59:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 270 transitions. [2019-10-03 02:59:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:59:19,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:19,526 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:19,529 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2116914143, now seen corresponding path program 1 times [2019-10-03 02:59:19,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:19,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:19,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 02:59:19,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:19,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:59:19,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:19,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:59:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:59:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:19,687 INFO L87 Difference]: Start difference. First operand 237 states and 270 transitions. Second operand 7 states. [2019-10-03 02:59:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:20,361 INFO L93 Difference]: Finished difference Result 255 states and 296 transitions. [2019-10-03 02:59:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:59:20,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-03 02:59:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:20,365 INFO L225 Difference]: With dead ends: 255 [2019-10-03 02:59:20,365 INFO L226 Difference]: Without dead ends: 255 [2019-10-03 02:59:20,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:59:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-03 02:59:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 236. [2019-10-03 02:59:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-03 02:59:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2019-10-03 02:59:20,380 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 92 [2019-10-03 02:59:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:20,381 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2019-10-03 02:59:20,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:59:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2019-10-03 02:59:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:59:20,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:20,383 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, 1] [2019-10-03 02:59:20,383 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:20,384 INFO L82 PathProgramCache]: Analyzing trace with hash 660673946, now seen corresponding path program 1 times [2019-10-03 02:59:20,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:20,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:20,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:59:20,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:20,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:59:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:59:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:59:20,459 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand 6 states. [2019-10-03 02:59:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:20,487 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2019-10-03 02:59:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:59:20,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-03 02:59:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:20,490 INFO L225 Difference]: With dead ends: 243 [2019-10-03 02:59:20,491 INFO L226 Difference]: Without dead ends: 243 [2019-10-03 02:59:20,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:59:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-03 02:59:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-10-03 02:59:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-03 02:59:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2019-10-03 02:59:20,503 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 108 [2019-10-03 02:59:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:20,503 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2019-10-03 02:59:20,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:59:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2019-10-03 02:59:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:59:20,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:20,505 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, 1] [2019-10-03 02:59:20,506 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1706020648, now seen corresponding path program 1 times [2019-10-03 02:59:20,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:20,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:20,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:59:20,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:20,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:59:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:59:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:20,635 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand 8 states. [2019-10-03 02:59:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:20,692 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2019-10-03 02:59:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:59:20,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-10-03 02:59:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:20,696 INFO L225 Difference]: With dead ends: 248 [2019-10-03 02:59:20,697 INFO L226 Difference]: Without dead ends: 248 [2019-10-03 02:59:20,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:59:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-03 02:59:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-10-03 02:59:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-03 02:59:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2019-10-03 02:59:20,719 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 108 [2019-10-03 02:59:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:20,719 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2019-10-03 02:59:20,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:59:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2019-10-03 02:59:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:59:20,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:20,721 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, 1] [2019-10-03 02:59:20,721 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1946560777, now seen corresponding path program 1 times [2019-10-03 02:59:20,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:20,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:20,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:20,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:59:20,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:20,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:59:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:59:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:59:20,799 INFO L87 Difference]: Start difference. First operand 245 states and 276 transitions. Second operand 4 states. [2019-10-03 02:59:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:21,021 INFO L93 Difference]: Finished difference Result 484 states and 567 transitions. [2019-10-03 02:59:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:59:21,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-03 02:59:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:21,025 INFO L225 Difference]: With dead ends: 484 [2019-10-03 02:59:21,025 INFO L226 Difference]: Without dead ends: 484 [2019-10-03 02:59:21,026 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:59:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-10-03 02:59:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 475. [2019-10-03 02:59:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-10-03 02:59:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 550 transitions. [2019-10-03 02:59:21,051 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 550 transitions. Word has length 108 [2019-10-03 02:59:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:21,052 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 550 transitions. [2019-10-03 02:59:21,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:59:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 550 transitions. [2019-10-03 02:59:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:59:21,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:21,054 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, 1, 1, 1, 1, 1] [2019-10-03 02:59:21,054 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash 79738257, now seen corresponding path program 1 times [2019-10-03 02:59:21,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:21,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:59:21,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:21,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:59:21,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:21,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:59:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:59:21,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:59:21,249 INFO L87 Difference]: Start difference. First operand 475 states and 550 transitions. Second operand 9 states. [2019-10-03 02:59:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:22,357 INFO L93 Difference]: Finished difference Result 879 states and 1019 transitions. [2019-10-03 02:59:22,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:59:22,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-10-03 02:59:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:22,366 INFO L225 Difference]: With dead ends: 879 [2019-10-03 02:59:22,366 INFO L226 Difference]: Without dead ends: 879 [2019-10-03 02:59:22,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:59:22,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-10-03 02:59:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 798. [2019-10-03 02:59:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-10-03 02:59:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 913 transitions. [2019-10-03 02:59:22,410 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 913 transitions. Word has length 112 [2019-10-03 02:59:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:22,411 INFO L475 AbstractCegarLoop]: Abstraction has 798 states and 913 transitions. [2019-10-03 02:59:22,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:59:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 913 transitions. [2019-10-03 02:59:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-03 02:59:22,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:22,414 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:22,415 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash -992810877, now seen corresponding path program 1 times [2019-10-03 02:59:22,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:22,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:22,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 02:59:22,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:59:22,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:59:22,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2019-10-03 02:59:22,581 INFO L207 CegarAbsIntRunner]: [50], [51], [52], [56], [59], [83], [85], [88], [92], [93], [94], [110], [114], [115], [116], [119], [121], [127], [131], [134], [135], [136], [145], [149], [153], [156], [159], [161], [167], [169], [175], [178], [188], [189], [190], [191], [201], [203], [208], [211], [212], [213], [214], [216], [221], [223], [224], [225], [226], [230], [233], [237], [243], [272], [276], [279], [282], [284], [287], [294], [297], [300], [304], [305], [308], [309], [310], [312], [313], [314], [316], [319], [321], [324], [327], [336], [338], [339], [340], [364], [366], [367], [434], [435], [445], [453], [454], [455], [456], [457], [458], [459], [460], [461], [493], [494], [495], [496], [499], [500], [501], [502], [503], [504], [509], [510], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [531], [532], [533], [534], [537], [538], [539], [540], [541], [542], [543], [544], [545], [549], [550], [551], [553], [554], [559], [560], [561] [2019-10-03 02:59:22,630 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:59:22,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:59:22,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:59:22,704 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 69 root evaluator evaluations with a maximum evaluation depth of 0. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 128 variables. [2019-10-03 02:59:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:22,708 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:59:22,763 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:59:22,763 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:59:22,768 INFO L420 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2019-10-03 02:59:22,768 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:59:22,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:59:22,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:59:22,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:22,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:22,771 INFO L87 Difference]: Start difference. First operand 798 states and 913 transitions. Second operand 2 states. [2019-10-03 02:59:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:22,771 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:59:22,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:22,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 174 [2019-10-03 02:59:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:22,772 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:59:22,772 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:59:22,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:59:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:59:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:59:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:59:22,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2019-10-03 02:59:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:22,773 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:59:22,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:59:22,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:59:22,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:59:22 BoogieIcfgContainer [2019-10-03 02:59:22,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:59:22,781 INFO L168 Benchmark]: Toolchain (without parser) took 7336.12 ms. Allocated memory was 133.7 MB in the beginning and 321.4 MB in the end (delta: 187.7 MB). Free memory was 87.8 MB in the beginning and 124.4 MB in the end (delta: -36.6 MB). Peak memory consumption was 151.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,782 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.49 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 87.6 MB in the beginning and 167.2 MB in the end (delta: -79.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,784 INFO L168 Benchmark]: Boogie Preprocessor took 81.40 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 162.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,785 INFO L168 Benchmark]: RCFGBuilder took 1123.48 ms. Allocated memory was 201.3 MB in the beginning and 227.5 MB in the end (delta: 26.2 MB). Free memory was 162.2 MB in the beginning and 191.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,786 INFO L168 Benchmark]: TraceAbstraction took 5422.90 ms. Allocated memory was 227.5 MB in the beginning and 321.4 MB in the end (delta: 93.8 MB). Free memory was 189.7 MB in the beginning and 124.4 MB in the end (delta: 65.3 MB). Peak memory consumption was 159.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:59:22,790 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 133.7 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.49 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 87.6 MB in the beginning and 167.2 MB in the end (delta: -79.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.40 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 162.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1123.48 ms. Allocated memory was 201.3 MB in the beginning and 227.5 MB in the end (delta: 26.2 MB). Free memory was 162.2 MB in the beginning and 191.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5422.90 ms. Allocated memory was 227.5 MB in the beginning and 321.4 MB in the end (delta: 93.8 MB). Free memory was 189.7 MB in the beginning and 124.4 MB in the end (delta: 65.3 MB). Peak memory consumption was 159.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 675]: 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 44 procedures, 256 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1702 SDtfs, 1311 SDslu, 3342 SDs, 0 SdLazy, 1921 SolverSat, 504 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.8265895953757225 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 133 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 166111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 63/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...