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/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:31:53,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:31:53,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:31:53,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:31:53,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:31:53,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:31:53,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:31:53,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:31:53,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:31:53,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:31:53,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:31:53,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:31:53,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:31:53,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:31:53,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:31:53,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:31:53,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:31:53,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:31:53,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:31:53,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:31:53,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:31:53,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:31:53,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:31:53,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:31:53,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:31:53,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:31:53,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:31:53,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:31:53,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:31:53,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:31:53,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:31:53,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:31:53,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:31:53,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:31:53,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:31:53,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:31:53,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:31:53,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:31:53,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:31:53,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:31:53,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:31:53,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:31:53,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:31:53,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:31:53,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:31:53,150 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:31:53,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:31:53,151 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:31:53,151 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:31:53,151 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:31:53,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:31:53,152 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:31:53,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:31:53,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:31:53,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:31:53,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:31:53,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:31:53,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:31:53,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:31:53,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:31:53,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:31:53,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:31:53,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:31:53,157 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:31:53,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:31:53,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:53,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:31:53,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:31:53,158 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:31:53,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:31:53,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:31:53,159 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:31:53,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:31:53,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:31:53,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:31:53,223 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:31:53,223 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:31:53,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-20 13:31:53,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5f4bb81/7ae7a6f1829d4363ae4cfe8888ee268f/FLAGbdbe8443e [2019-09-20 13:31:53,824 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:31:53,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-20 13:31:53,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5f4bb81/7ae7a6f1829d4363ae4cfe8888ee268f/FLAGbdbe8443e [2019-09-20 13:31:54,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5f4bb81/7ae7a6f1829d4363ae4cfe8888ee268f [2019-09-20 13:31:54,190 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:31:54,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:31:54,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:54,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:31:54,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:31:54,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bab18b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54, skipping insertion in model container [2019-09-20 13:31:54,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,212 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:31:54,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:31:54,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:54,493 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:31:54,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:54,642 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:31:54,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54 WrapperNode [2019-09-20 13:31:54,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:54,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:31:54,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:31:54,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:31:54,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... [2019-09-20 13:31:54,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:31:54,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:31:54,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:31:54,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:31:54,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:54,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:31:54,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:31:54,770 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:31:54,770 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:31:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:31:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:31:54,773 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:31:54,773 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:31:54,773 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:31:54,773 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:31:54,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:31:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:31:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:31:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:31:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:31:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:31:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:31:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:31:55,298 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:31:55,298 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:31:55,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:55 BoogieIcfgContainer [2019-09-20 13:31:55,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:31:55,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:31:55,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:31:55,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:31:55,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:31:54" (1/3) ... [2019-09-20 13:31:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dd6387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:55, skipping insertion in model container [2019-09-20 13:31:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:54" (2/3) ... [2019-09-20 13:31:55,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dd6387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:55, skipping insertion in model container [2019-09-20 13:31:55,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:55" (3/3) ... [2019-09-20 13:31:55,309 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-09-20 13:31:55,318 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:31:55,326 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:31:55,343 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:31:55,369 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:31:55,369 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:31:55,369 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:31:55,369 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:31:55,370 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:31:55,370 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:31:55,370 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:31:55,370 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:31:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-20 13:31:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:55,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,406 INFO L407 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] [2019-09-20 13:31:55,409 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-09-20 13:31:55,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:55,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:55,804 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-20 13:31:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,397 INFO L93 Difference]: Finished difference Result 173 states and 232 transitions. [2019-09-20 13:31:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:31:56,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:56,428 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:31:56,428 INFO L226 Difference]: Without dead ends: 161 [2019-09-20 13:31:56,432 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-20 13:31:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-20 13:31:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:31:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2019-09-20 13:31:56,541 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2019-09-20 13:31:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:56,544 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2019-09-20 13:31:56,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2019-09-20 13:31:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:56,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:56,551 INFO L407 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] [2019-09-20 13:31:56,552 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 246293706, now seen corresponding path program 1 times [2019-09-20 13:31:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:56,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:56,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:56,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:56,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:56,744 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2019-09-20 13:31:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:57,157 INFO L93 Difference]: Finished difference Result 161 states and 219 transitions. [2019-09-20 13:31:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:31:57,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,161 INFO L225 Difference]: With dead ends: 161 [2019-09-20 13:31:57,161 INFO L226 Difference]: Without dead ends: 161 [2019-09-20 13:31:57,162 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-20 13:31:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-20 13:31:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:31:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2019-09-20 13:31:57,176 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2019-09-20 13:31:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,177 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2019-09-20 13:31:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2019-09-20 13:31:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:57,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,179 INFO L407 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] [2019-09-20 13:31:57,179 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1633079116, now seen corresponding path program 1 times [2019-09-20 13:31:57,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:57,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:57,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:57,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:57,263 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2019-09-20 13:31:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:57,627 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2019-09-20 13:31:57,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:31:57,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,631 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:31:57,632 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:31:57,634 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:57,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:31:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2019-09-20 13:31:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:31:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-20 13:31:57,662 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2019-09-20 13:31:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,663 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-20 13:31:57,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-20 13:31:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:57,664 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,665 INFO L407 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] [2019-09-20 13:31:57,665 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2076979790, now seen corresponding path program 1 times [2019-09-20 13:31:57,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:57,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:57,755 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 6 states. [2019-09-20 13:31:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:57,785 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2019-09-20 13:31:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:57,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-20 13:31:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:57,790 INFO L225 Difference]: With dead ends: 145 [2019-09-20 13:31:57,790 INFO L226 Difference]: Without dead ends: 145 [2019-09-20 13:31:57,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-20 13:31:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-09-20 13:31:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:31:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2019-09-20 13:31:57,803 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 77 [2019-09-20 13:31:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:57,804 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2019-09-20 13:31:57,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2019-09-20 13:31:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:57,806 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:57,808 INFO L407 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] [2019-09-20 13:31:57,809 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 705172492, now seen corresponding path program 1 times [2019-09-20 13:31:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:57,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:57,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:57,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:57,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:57,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:57,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:57,927 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 4 states. [2019-09-20 13:31:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:58,108 INFO L93 Difference]: Finished difference Result 253 states and 320 transitions. [2019-09-20 13:31:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:58,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:31:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:58,111 INFO L225 Difference]: With dead ends: 253 [2019-09-20 13:31:58,111 INFO L226 Difference]: Without dead ends: 253 [2019-09-20 13:31:58,112 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-20 13:31:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2019-09-20 13:31:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:31:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2019-09-20 13:31:58,127 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 77 [2019-09-20 13:31:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:58,127 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2019-09-20 13:31:58,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2019-09-20 13:31:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:58,129 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:58,129 INFO L407 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] [2019-09-20 13:31:58,130 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1830432461, now seen corresponding path program 1 times [2019-09-20 13:31:58,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:58,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:58,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:58,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:58,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:58,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:58,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:58,187 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 6 states. [2019-09-20 13:31:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:58,251 INFO L93 Difference]: Finished difference Result 255 states and 324 transitions. [2019-09-20 13:31:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:58,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-20 13:31:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:58,255 INFO L225 Difference]: With dead ends: 255 [2019-09-20 13:31:58,255 INFO L226 Difference]: Without dead ends: 255 [2019-09-20 13:31:58,255 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-20 13:31:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-09-20 13:31:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-20 13:31:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2019-09-20 13:31:58,270 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 77 [2019-09-20 13:31:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:58,271 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2019-09-20 13:31:58,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2019-09-20 13:31:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:58,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:58,275 INFO L407 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] [2019-09-20 13:31:58,275 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1762934961, now seen corresponding path program 1 times [2019-09-20 13:31:58,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:58,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:58,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:58,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:58,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:58,406 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand 5 states. [2019-09-20 13:31:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:58,794 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2019-09-20 13:31:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:58,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:58,798 INFO L225 Difference]: With dead ends: 355 [2019-09-20 13:31:58,798 INFO L226 Difference]: Without dead ends: 355 [2019-09-20 13:31:58,799 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-20 13:31:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2019-09-20 13:31:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-20 13:31:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-09-20 13:31:58,815 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 384 transitions. Word has length 77 [2019-09-20 13:31:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:58,816 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-09-20 13:31:58,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 384 transitions. [2019-09-20 13:31:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:58,817 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:58,818 INFO L407 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] [2019-09-20 13:31:58,818 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:58,818 INFO L82 PathProgramCache]: Analyzing trace with hash 160293073, now seen corresponding path program 1 times [2019-09-20 13:31:58,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:58,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:58,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:58,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:58,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:58,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:58,878 INFO L87 Difference]: Start difference. First operand 313 states and 384 transitions. Second operand 5 states. [2019-09-20 13:31:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:59,149 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2019-09-20 13:31:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:31:59,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:59,152 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:31:59,152 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:31:59,153 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:31:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-09-20 13:31:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-20 13:31:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 380 transitions. [2019-09-20 13:31:59,166 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 380 transitions. Word has length 77 [2019-09-20 13:31:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:59,166 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 380 transitions. [2019-09-20 13:31:59,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 380 transitions. [2019-09-20 13:31:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:31:59,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:59,168 INFO L407 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] [2019-09-20 13:31:59,168 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 222332687, now seen corresponding path program 1 times [2019-09-20 13:31:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:59,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:59,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:59,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:59,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:59,223 INFO L87 Difference]: Start difference. First operand 313 states and 380 transitions. Second operand 5 states. [2019-09-20 13:31:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:59,622 INFO L93 Difference]: Finished difference Result 464 states and 584 transitions. [2019-09-20 13:31:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:31:59,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:31:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:59,626 INFO L225 Difference]: With dead ends: 464 [2019-09-20 13:31:59,626 INFO L226 Difference]: Without dead ends: 464 [2019-09-20 13:31:59,626 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:31:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-20 13:31:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2019-09-20 13:31:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-20 13:31:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2019-09-20 13:31:59,647 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 77 [2019-09-20 13:31:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:59,647 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2019-09-20 13:31:59,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:31:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2019-09-20 13:31:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:31:59,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:59,649 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:59,649 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -835288726, now seen corresponding path program 1 times [2019-09-20 13:31:59,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:59,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:59,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:59,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:59,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:31:59,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:59,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:31:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:31:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:59,721 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 5 states. [2019-09-20 13:32:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:00,056 INFO L93 Difference]: Finished difference Result 363 states and 443 transitions. [2019-09-20 13:32:00,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:00,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-20 13:32:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:00,061 INFO L225 Difference]: With dead ends: 363 [2019-09-20 13:32:00,061 INFO L226 Difference]: Without dead ends: 363 [2019-09-20 13:32:00,062 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-20 13:32:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 333. [2019-09-20 13:32:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-20 13:32:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 392 transitions. [2019-09-20 13:32:00,074 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 392 transitions. Word has length 78 [2019-09-20 13:32:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:00,074 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 392 transitions. [2019-09-20 13:32:00,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 392 transitions. [2019-09-20 13:32:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:32:00,076 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,076 INFO L407 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] [2019-09-20 13:32:00,076 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 362881297, now seen corresponding path program 1 times [2019-09-20 13:32:00,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:00,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:00,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:00,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:00,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:00,152 INFO L87 Difference]: Start difference. First operand 333 states and 392 transitions. Second operand 5 states. [2019-09-20 13:32:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:00,585 INFO L93 Difference]: Finished difference Result 425 states and 521 transitions. [2019-09-20 13:32:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:00,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:32:00,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:00,588 INFO L225 Difference]: With dead ends: 425 [2019-09-20 13:32:00,589 INFO L226 Difference]: Without dead ends: 425 [2019-09-20 13:32:00,589 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-20 13:32:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 364. [2019-09-20 13:32:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:32:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2019-09-20 13:32:00,606 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 77 [2019-09-20 13:32:00,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:00,606 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2019-09-20 13:32:00,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2019-09-20 13:32:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:32:00,608 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,608 INFO L407 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] [2019-09-20 13:32:00,608 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-09-20 13:32:00,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:00,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:00,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:00,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:00,650 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 3 states. [2019-09-20 13:32:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:00,673 INFO L93 Difference]: Finished difference Result 680 states and 792 transitions. [2019-09-20 13:32:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:00,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-20 13:32:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:00,678 INFO L225 Difference]: With dead ends: 680 [2019-09-20 13:32:00,678 INFO L226 Difference]: Without dead ends: 680 [2019-09-20 13:32:00,678 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-20 13:32:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2019-09-20 13:32:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-20 13:32:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 787 transitions. [2019-09-20 13:32:00,703 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 787 transitions. Word has length 77 [2019-09-20 13:32:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:00,703 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 787 transitions. [2019-09-20 13:32:00,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 787 transitions. [2019-09-20 13:32:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:32:00,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,706 INFO L407 BasicCegarLoop]: trace histogram [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, 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] [2019-09-20 13:32:00,707 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2019-09-20 13:32:00,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-20 13:32:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:00,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:00,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:00,770 INFO L87 Difference]: Start difference. First operand 676 states and 787 transitions. Second operand 4 states. [2019-09-20 13:32:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:00,923 INFO L93 Difference]: Finished difference Result 1067 states and 1215 transitions. [2019-09-20 13:32:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:00,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:32:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:00,928 INFO L225 Difference]: With dead ends: 1067 [2019-09-20 13:32:00,929 INFO L226 Difference]: Without dead ends: 805 [2019-09-20 13:32:00,929 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-09-20 13:32:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-09-20 13:32:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-20 13:32:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 897 transitions. [2019-09-20 13:32:00,957 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 897 transitions. Word has length 121 [2019-09-20 13:32:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:00,957 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 897 transitions. [2019-09-20 13:32:00,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:00,957 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 897 transitions. [2019-09-20 13:32:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-20 13:32:00,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,961 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:32:00,961 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-09-20 13:32:00,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-20 13:32:01,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:01,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:01,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2019-09-20 13:32:01,039 INFO L207 CegarAbsIntRunner]: [1], [4], [6], [9], [20], [22], [24], [26], [30], [31], [33], [36], [38], [41], [46], [48], [49], [52], [54], [57], [61], [62], [63], [66], [71], [73], [75], [77], [78], [83], [89], [95], [101], [103], [106], [112], [116], [117], [122], [127], [129], [132], [143], [145], [147], [151], [159], [162], [163], [164], [173], [176], [179], [185], [188], [194], [198], [201], [224], [229], [235], [241], [247], [249], [250], [264], [266], [296], [299], [302], [306], [308], [310], [311], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [354], [355], [356], [358], [359], [360], [361], [362], [363], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [396], [397], [398] [2019-09-20 13:32:01,084 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:01,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:01,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:32:01,673 INFO L272 AbstractInterpreter]: Visited 110 different actions 805 times. Merged at 32 different actions 185 times. Widened at 1 different actions 1 times. Performed 2637 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2637 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 25 fixpoints after 9 different actions. Largest state had 30 variables. [2019-09-20 13:32:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:01,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:32:01,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:01,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:32:01,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:01,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:32:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:01,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:32:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:32:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-20 13:32:01,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:32:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:32:02,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:32:02,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-09-20 13:32:02,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:02,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:02,135 INFO L87 Difference]: Start difference. First operand 797 states and 897 transitions. Second operand 3 states. [2019-09-20 13:32:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:02,167 INFO L93 Difference]: Finished difference Result 1112 states and 1223 transitions. [2019-09-20 13:32:02,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:02,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-20 13:32:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:02,170 INFO L225 Difference]: With dead ends: 1112 [2019-09-20 13:32:02,171 INFO L226 Difference]: Without dead ends: 563 [2019-09-20 13:32:02,171 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-20 13:32:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-09-20 13:32:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:32:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 621 transitions. [2019-09-20 13:32:02,199 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 621 transitions. Word has length 176 [2019-09-20 13:32:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:02,200 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 621 transitions. [2019-09-20 13:32:02,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 621 transitions. [2019-09-20 13:32:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-20 13:32:02,204 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:02,205 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:32:02,205 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-09-20 13:32:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:32:02,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:02,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:02,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:02,385 INFO L87 Difference]: Start difference. First operand 563 states and 621 transitions. Second operand 6 states. [2019-09-20 13:32:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,135 INFO L93 Difference]: Finished difference Result 706 states and 787 transitions. [2019-09-20 13:32:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:32:03,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-20 13:32:03,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,136 INFO L225 Difference]: With dead ends: 706 [2019-09-20 13:32:03,136 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:32:03,137 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:32:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:32:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:32:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:32:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:32:03,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-20 13:32:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,138 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:32:03,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:32:03,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:32:03,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:32:03 BoogieIcfgContainer [2019-09-20 13:32:03,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:32:03,151 INFO L168 Benchmark]: Toolchain (without parser) took 8958.80 ms. Allocated memory was 133.2 MB in the beginning and 357.0 MB in the end (delta: 223.9 MB). Free memory was 87.8 MB in the beginning and 254.5 MB in the end (delta: -166.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,156 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.87 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.6 MB in the beginning and 174.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,161 INFO L168 Benchmark]: Boogie Preprocessor took 54.41 ms. Allocated memory is still 200.3 MB. Free memory was 174.9 MB in the beginning and 173.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,162 INFO L168 Benchmark]: RCFGBuilder took 602.80 ms. Allocated memory is still 200.3 MB. Free memory was 173.1 MB in the beginning and 142.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,166 INFO L168 Benchmark]: TraceAbstraction took 7845.62 ms. Allocated memory was 200.3 MB in the beginning and 357.0 MB in the end (delta: 156.8 MB). Free memory was 141.8 MB in the beginning and 254.5 MB in the end (delta: -112.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:03,172 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.2 MB. Free memory was 106.3 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 447.87 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.6 MB in the beginning and 174.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.41 ms. Allocated memory is still 200.3 MB. Free memory was 174.9 MB in the beginning and 173.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 602.80 ms. Allocated memory is still 200.3 MB. Free memory was 173.1 MB in the beginning and 142.4 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7845.62 ms. Allocated memory was 200.3 MB in the beginning and 357.0 MB in the end (delta: 156.8 MB). Free memory was 141.8 MB in the beginning and 254.5 MB in the end (delta: -112.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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 21 procedures, 144 locations, 1 error locations. SAFE Result, 7.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2960 SDtfs, 3281 SDslu, 2964 SDs, 0 SdLazy, 2574 SolverSat, 1043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 416 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 323 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1733 ConstructedInterpolants, 0 QuantifiedInterpolants, 294029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 445/455 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...