./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 571733b9b2b4edd3beb90cbc1a974d2015477291 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:55:09,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:55:09,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:55:09,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:55:09,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:55:09,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:55:09,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:55:09,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:55:09,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:55:09,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:55:09,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:55:09,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:55:09,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:55:09,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:55:09,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:55:09,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:55:09,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:55:09,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:55:09,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:55:09,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:55:09,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:55:09,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:55:09,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:55:09,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:55:09,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:55:09,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:55:09,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:55:09,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:55:09,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:55:09,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:55:09,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:55:09,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:55:09,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:55:09,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:55:09,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:55:09,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:55:09,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:55:09,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:55:09,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:55:09,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:55:09,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:55:09,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:55:09,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:55:09,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:55:09,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:55:09,117 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:55:09,117 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:55:09,118 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:55:09,118 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:55:09,118 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:55:09,118 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:55:09,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:55:09,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:55:09,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:55:09,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:55:09,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:55:09,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:55:09,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:55:09,122 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 571733b9b2b4edd3beb90cbc1a974d2015477291 [2019-12-07 14:55:09,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:55:09,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:55:09,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:55:09,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:55:09,232 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:55:09,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label27.c [2019-12-07 14:55:09,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/data/b5f8e6276/3d0ac6816aa14f588783038e6dc7df14/FLAG031bea305 [2019-12-07 14:55:09,639 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:55:09,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/sv-benchmarks/c/eca-rers2012/Problem02_label27.c [2019-12-07 14:55:09,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/data/b5f8e6276/3d0ac6816aa14f588783038e6dc7df14/FLAG031bea305 [2019-12-07 14:55:09,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/data/b5f8e6276/3d0ac6816aa14f588783038e6dc7df14 [2019-12-07 14:55:09,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:55:09,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:55:09,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:55:09,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:55:09,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:55:09,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:55:09" (1/1) ... [2019-12-07 14:55:09,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b67bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:09, skipping insertion in model container [2019-12-07 14:55:09,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:55:09" (1/1) ... [2019-12-07 14:55:09,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:55:09,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:55:09,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:55:09,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:55:10,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:55:10,029 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:55:10,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10 WrapperNode [2019-12-07 14:55:10,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:55:10,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:55:10,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:55:10,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:55:10,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:55:10,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:55:10,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:55:10,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:55:10,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... [2019-12-07 14:55:10,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:55:10,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:55:10,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:55:10,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:55:10,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/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-12-07 14:55:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:55:10,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:55:11,273 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:55:11,273 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:55:11,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:55:11 BoogieIcfgContainer [2019-12-07 14:55:11,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:55:11,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:55:11,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:55:11,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:55:11,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:55:09" (1/3) ... [2019-12-07 14:55:11,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4fedc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:55:11, skipping insertion in model container [2019-12-07 14:55:11,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:55:10" (2/3) ... [2019-12-07 14:55:11,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4fedc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:55:11, skipping insertion in model container [2019-12-07 14:55:11,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:55:11" (3/3) ... [2019-12-07 14:55:11,282 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label27.c [2019-12-07 14:55:11,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:55:11,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:55:11,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:55:11,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:55:11,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:55:11,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:55:11,318 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:55:11,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:55:11,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:55:11,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:55:11,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:55:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 14:55:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:55:11,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:11,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:55:11,337 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 925946249, now seen corresponding path program 1 times [2019-12-07 14:55:11,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:11,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686039882] [2019-12-07 14:55:11,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:55:11,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686039882] [2019-12-07 14:55:11,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:11,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:55:11,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356270937] [2019-12-07 14:55:11,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:11,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:11,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:11,597 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 14:55:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:12,008 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 14:55:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:12,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:55:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:12,020 INFO L225 Difference]: With dead ends: 333 [2019-12-07 14:55:12,020 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 14:55:12,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 14:55:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 14:55:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 14:55:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-12-07 14:55:12,062 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-12-07 14:55:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:12,063 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-12-07 14:55:12,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-12-07 14:55:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 14:55:12,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:12,067 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:55:12,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:12,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2010252716, now seen corresponding path program 1 times [2019-12-07 14:55:12,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:12,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926307131] [2019-12-07 14:55:12,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:55:12,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926307131] [2019-12-07 14:55:12,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:12,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:55:12,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601560824] [2019-12-07 14:55:12,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:12,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:12,148 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 4 states. [2019-12-07 14:55:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:12,459 INFO L93 Difference]: Finished difference Result 805 states and 1286 transitions. [2019-12-07 14:55:12,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:12,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 14:55:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:12,464 INFO L225 Difference]: With dead ends: 805 [2019-12-07 14:55:12,464 INFO L226 Difference]: Without dead ends: 563 [2019-12-07 14:55:12,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-07 14:55:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-12-07 14:55:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 14:55:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-12-07 14:55:12,488 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 89 [2019-12-07 14:55:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:12,489 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-12-07 14:55:12,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-12-07 14:55:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 14:55:12,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:12,492 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:55:12,492 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1900024184, now seen corresponding path program 1 times [2019-12-07 14:55:12,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:12,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275819142] [2019-12-07 14:55:12,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:55:12,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275819142] [2019-12-07 14:55:12,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:12,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:55:12,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267454305] [2019-12-07 14:55:12,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:55:12,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:55:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:12,549 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-12-07 14:55:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:12,765 INFO L93 Difference]: Finished difference Result 1285 states and 2020 transitions. [2019-12-07 14:55:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:55:12,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-12-07 14:55:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:12,769 INFO L225 Difference]: With dead ends: 1285 [2019-12-07 14:55:12,769 INFO L226 Difference]: Without dead ends: 803 [2019-12-07 14:55:12,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 14:55:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-12-07 14:55:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2019-12-07 14:55:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 14:55:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1153 transitions. [2019-12-07 14:55:12,788 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1153 transitions. Word has length 113 [2019-12-07 14:55:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:12,788 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1153 transitions. [2019-12-07 14:55:12,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:55:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1153 transitions. [2019-12-07 14:55:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 14:55:12,790 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:12,790 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 14:55:12,790 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1735822193, now seen corresponding path program 1 times [2019-12-07 14:55:12,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:12,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751858548] [2019-12-07 14:55:12,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:55:12,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751858548] [2019-12-07 14:55:12,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:12,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:12,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340607129] [2019-12-07 14:55:12,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:12,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:12,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:12,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:12,846 INFO L87 Difference]: Start difference. First operand 803 states and 1153 transitions. Second operand 4 states. [2019-12-07 14:55:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:13,242 INFO L93 Difference]: Finished difference Result 2005 states and 2890 transitions. [2019-12-07 14:55:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:13,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 14:55:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:13,248 INFO L225 Difference]: With dead ends: 2005 [2019-12-07 14:55:13,248 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 14:55:13,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 14:55:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 803. [2019-12-07 14:55:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 14:55:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1058 transitions. [2019-12-07 14:55:13,270 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1058 transitions. Word has length 118 [2019-12-07 14:55:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:13,271 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1058 transitions. [2019-12-07 14:55:13,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1058 transitions. [2019-12-07 14:55:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:55:13,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:13,272 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 14:55:13,272 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:13,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1692477709, now seen corresponding path program 1 times [2019-12-07 14:55:13,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:13,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391867206] [2019-12-07 14:55:13,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:55:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391867206] [2019-12-07 14:55:13,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:13,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:55:13,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750371043] [2019-12-07 14:55:13,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:55:13,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:55:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:13,315 INFO L87 Difference]: Start difference. First operand 803 states and 1058 transitions. Second operand 3 states. [2019-12-07 14:55:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:13,569 INFO L93 Difference]: Finished difference Result 2085 states and 2741 transitions. [2019-12-07 14:55:13,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:55:13,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-12-07 14:55:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:13,576 INFO L225 Difference]: With dead ends: 2085 [2019-12-07 14:55:13,576 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 14:55:13,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 14:55:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-12-07 14:55:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-07 14:55:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1345 transitions. [2019-12-07 14:55:13,601 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1345 transitions. Word has length 131 [2019-12-07 14:55:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:13,601 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1345 transitions. [2019-12-07 14:55:13,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:55:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1345 transitions. [2019-12-07 14:55:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 14:55:13,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:13,604 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:55:13,604 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1947459782, now seen corresponding path program 1 times [2019-12-07 14:55:13,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:13,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152745591] [2019-12-07 14:55:13,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 14:55:13,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152745591] [2019-12-07 14:55:13,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:13,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:55:13,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251888519] [2019-12-07 14:55:13,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:55:13,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:55:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:13,669 INFO L87 Difference]: Start difference. First operand 1043 states and 1345 transitions. Second operand 3 states. [2019-12-07 14:55:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:13,913 INFO L93 Difference]: Finished difference Result 2485 states and 3180 transitions. [2019-12-07 14:55:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:55:13,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-12-07 14:55:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:13,918 INFO L225 Difference]: With dead ends: 2485 [2019-12-07 14:55:13,918 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 14:55:13,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 14:55:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-12-07 14:55:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 14:55:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1153 transitions. [2019-12-07 14:55:13,934 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1153 transitions. Word has length 140 [2019-12-07 14:55:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:13,934 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1153 transitions. [2019-12-07 14:55:13,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:55:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1153 transitions. [2019-12-07 14:55:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 14:55:13,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:13,936 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:55:13,936 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 283710413, now seen corresponding path program 1 times [2019-12-07 14:55:13,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:13,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629330712] [2019-12-07 14:55:13,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 14:55:13,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629330712] [2019-12-07 14:55:13,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:13,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:55:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794575378] [2019-12-07 14:55:13,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:55:13,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:55:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:13,980 INFO L87 Difference]: Start difference. First operand 963 states and 1153 transitions. Second operand 3 states. [2019-12-07 14:55:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:14,172 INFO L93 Difference]: Finished difference Result 2005 states and 2387 transitions. [2019-12-07 14:55:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:55:14,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-12-07 14:55:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:14,176 INFO L225 Difference]: With dead ends: 2005 [2019-12-07 14:55:14,176 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 14:55:14,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:55:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 14:55:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-12-07 14:55:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 14:55:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1138 transitions. [2019-12-07 14:55:14,195 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1138 transitions. Word has length 150 [2019-12-07 14:55:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:14,195 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1138 transitions. [2019-12-07 14:55:14,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:55:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2019-12-07 14:55:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 14:55:14,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:14,197 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:55:14,197 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -275473213, now seen corresponding path program 1 times [2019-12-07 14:55:14,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:55:14,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978818542] [2019-12-07 14:55:14,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-07 14:55:14,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978818542] [2019-12-07 14:55:14,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514530808] [2019-12-07 14:55:14,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:55:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:14,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:55:14,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:55:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 14:55:14,422 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:55:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 14:55:14,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:55:14,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-12-07 14:55:14,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119391248] [2019-12-07 14:55:14,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:14,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:55:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:55:14,456 INFO L87 Difference]: Start difference. First operand 963 states and 1138 transitions. Second operand 4 states. [2019-12-07 14:55:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:14,691 INFO L93 Difference]: Finished difference Result 1683 states and 1954 transitions. [2019-12-07 14:55:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 14:55:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:14,692 INFO L225 Difference]: With dead ends: 1683 [2019-12-07 14:55:14,692 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:55:14,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:55:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:55:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:55:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:55:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:55:14,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2019-12-07 14:55:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:14,694 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:55:14,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:55:14,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:55:14,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:55:14,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:55:15,048 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-07 14:55:15,144 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 14:55:15,145 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 14:55:15,146 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 14:55:15,147 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 457) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 14:55:15,148 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 14:55:15,149 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse4 (= ~a19~0 1)) (.cse6 (not (= ~a28~0 11))) (.cse5 (= ~a17~0 8))) (let ((.cse0 (or (and (not .cse4) .cse6) (and (<= ~a19~0 0) .cse5))) (.cse2 (<= ~a17~0 7)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (or (and .cse0 .cse1) (and .cse2 (= ~a28~0 7) .cse1) (and (< ~a17~0 9) .cse0) (and .cse2 (not .cse3) .cse4 .cse1) (and .cse5 .cse4 .cse3) (and .cse5 .cse6)))) [2019-12-07 14:55:15,149 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 14:55:15,149 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 14:55:15,149 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 14:55:15,149 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 14:55:15,149 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 14:55:15,149 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a19~0 1)) (.cse6 (not (= ~a28~0 11))) (.cse5 (= ~a17~0 8))) (let ((.cse0 (or (and (not .cse4) .cse6) (and (<= ~a19~0 0) .cse5))) (.cse2 (<= ~a17~0 7)) (.cse1 (= ~a11~0 1)) (.cse3 (= ~a25~0 1))) (or (and .cse0 .cse1) (and .cse2 (= ~a28~0 7) .cse1) (and (< ~a17~0 9) .cse0) (and .cse2 (not .cse3) .cse4 .cse1) (and .cse5 .cse4 .cse3) (and .cse5 .cse6)))) [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 14:55:15,150 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 14:55:15,151 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 14:55:15,152 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 14:55:15,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:55:15 BoogieIcfgContainer [2019-12-07 14:55:15,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:55:15,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:55:15,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:55:15,170 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:55:15,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:55:11" (3/4) ... [2019-12-07 14:55:15,172 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:55:15,189 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 14:55:15,191 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 14:55:15,192 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 14:55:15,194 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:55:15,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_257da68b-a20b-4298-afd8-1ad5baecb592/bin/utaipan/witness.graphml [2019-12-07 14:55:15,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:55:15,305 INFO L168 Benchmark]: Toolchain (without parser) took 5639.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 117.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,305 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:55:15,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,306 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,307 INFO L168 Benchmark]: RCFGBuilder took 1156.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 220.7 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,307 INFO L168 Benchmark]: TraceAbstraction took 3893.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 884.7 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:55:15,307 INFO L168 Benchmark]: Witness Printer took 134.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:55:15,309 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1156.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.7 MB in the end (delta: 220.7 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3893.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 111.1 MB). Free memory was 884.7 MB in the beginning and 1.1 GB in the end (delta: -211.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 134.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 457]: 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 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1) || ((a17 <= 7 && a28 == 7) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a17 == 8 && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1) || ((a17 <= 7 && a28 == 7) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a17 == 8 && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 589 SDtfs, 1009 SDslu, 71 SDs, 0 SdLazy, 2426 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 800 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 171 HoareAnnotationTreeSize, 3 FomulaSimplifications, 558 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 406 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1273 ConstructedInterpolants, 0 QuantifiedInterpolants, 316326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 859/862 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...