./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/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 253410f53553d69ef02e4dba1b07bb26de7bec75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:11:32,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:11:32,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:11:32,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:11:32,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:11:32,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:11:32,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:11:32,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:11:32,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:11:32,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:11:32,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:11:32,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:11:32,601 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:11:32,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:11:32,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:11:32,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:11:32,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:11:32,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:11:32,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:11:32,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:11:32,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:11:32,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:11:32,607 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:11:32,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:11:32,607 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:11:32,608 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:11:32,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:11:32,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:11:32,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:11:32,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:11:32,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:11:32,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:11:32,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:11:32,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:11:32,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:11:32,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:11:32,611 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:11:32,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:11:32,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:11:32,619 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:11:32,619 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:11:32,619 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:11:32,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:11:32,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:11:32,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:11:32,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:11:32,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:11:32,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:11:32,622 INFO L133 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/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/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 -> 253410f53553d69ef02e4dba1b07bb26de7bec75 [2018-12-09 10:11:32,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:11:32,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:11:32,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:11:32,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:11:32,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:11:32,655 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-12-09 10:11:32,693 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/data/8a7ac2ef2/b28939b0a8aa4c13bc2510863e77e56e/FLAGeda888b8c [2018-12-09 10:11:33,101 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:11:33,101 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-12-09 10:11:33,105 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/data/8a7ac2ef2/b28939b0a8aa4c13bc2510863e77e56e/FLAGeda888b8c [2018-12-09 10:11:33,113 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/data/8a7ac2ef2/b28939b0a8aa4c13bc2510863e77e56e [2018-12-09 10:11:33,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:11:33,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:11:33,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:11:33,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:11:33,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:11:33,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be7578c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33, skipping insertion in model container [2018-12-09 10:11:33,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:11:33,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:11:33,230 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:11:33,232 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:11:33,246 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:11:33,255 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:11:33,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33 WrapperNode [2018-12-09 10:11:33,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:11:33,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:11:33,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:11:33,256 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:11:33,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:11:33,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:11:33,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:11:33,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:11:33,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... [2018-12-09 10:11:33,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:11:33,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:11:33,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:11:33,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:11:33,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/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 [2018-12-09 10:11:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 10:11:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 10:11:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:11:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:11:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 10:11:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 10:11:33,486 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:11:33,486 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 10:11:33,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:11:33 BoogieIcfgContainer [2018-12-09 10:11:33,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:11:33,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:11:33,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:11:33,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:11:33,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:11:33" (1/3) ... [2018-12-09 10:11:33,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3510e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:11:33, skipping insertion in model container [2018-12-09 10:11:33,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:11:33" (2/3) ... [2018-12-09 10:11:33,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3510e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:11:33, skipping insertion in model container [2018-12-09 10:11:33,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:11:33" (3/3) ... [2018-12-09 10:11:33,490 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-12-09 10:11:33,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:11:33,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 10:11:33,508 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 10:11:33,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:11:33,526 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:11:33,526 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:11:33,526 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:11:33,526 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:11:33,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:11:33,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:11:33,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:11:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 10:11:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 10:11:33,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:33,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:11:33,542 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:33,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2018-12-09 10:11:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:33,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:33,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:11:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:33,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:33,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:33,642 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 10:11:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:33,699 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2018-12-09 10:11:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:33,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-09 10:11:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:33,707 INFO L225 Difference]: With dead ends: 136 [2018-12-09 10:11:33,707 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 10:11:33,709 INFO L631 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 [2018-12-09 10:11:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 10:11:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-09 10:11:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 10:11:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2018-12-09 10:11:33,737 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2018-12-09 10:11:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:33,737 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2018-12-09 10:11:33,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-12-09 10:11:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 10:11:33,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:33,738 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:11:33,738 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:33,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2018-12-09 10:11:33,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:11:33,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:33,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:33,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:33,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:33,761 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2018-12-09 10:11:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:33,803 INFO L93 Difference]: Finished difference Result 161 states and 253 transitions. [2018-12-09 10:11:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:33,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 10:11:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:33,805 INFO L225 Difference]: With dead ends: 161 [2018-12-09 10:11:33,805 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 10:11:33,806 INFO L631 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 [2018-12-09 10:11:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 10:11:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-09 10:11:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 10:11:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2018-12-09 10:11:33,819 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2018-12-09 10:11:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:33,819 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2018-12-09 10:11:33,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-12-09 10:11:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 10:11:33,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:33,820 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:11:33,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:33,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2018-12-09 10:11:33,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 10:11:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:33,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:33,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:33,843 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2018-12-09 10:11:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:33,887 INFO L93 Difference]: Finished difference Result 237 states and 369 transitions. [2018-12-09 10:11:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:33,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 10:11:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:33,889 INFO L225 Difference]: With dead ends: 237 [2018-12-09 10:11:33,889 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 10:11:33,889 INFO L631 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 [2018-12-09 10:11:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 10:11:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-09 10:11:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-09 10:11:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2018-12-09 10:11:33,902 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2018-12-09 10:11:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:33,902 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2018-12-09 10:11:33,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-12-09 10:11:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 10:11:33,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:33,904 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-12-09 10:11:33,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:33,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2018-12-09 10:11:33,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:33,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 10:11:33,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:33,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:33,930 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2018-12-09 10:11:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:33,990 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2018-12-09 10:11:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:33,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 10:11:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:33,992 INFO L225 Difference]: With dead ends: 371 [2018-12-09 10:11:33,992 INFO L226 Difference]: Without dead ends: 217 [2018-12-09 10:11:33,993 INFO L631 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 [2018-12-09 10:11:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-09 10:11:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-12-09 10:11:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-09 10:11:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2018-12-09 10:11:34,001 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2018-12-09 10:11:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:34,002 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2018-12-09 10:11:34,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2018-12-09 10:11:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 10:11:34,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:34,003 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-12-09 10:11:34,003 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:34,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2018-12-09 10:11:34,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:34,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:34,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 10:11:34,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:34,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:34,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:34,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:34,026 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2018-12-09 10:11:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:34,054 INFO L93 Difference]: Finished difference Result 419 states and 592 transitions. [2018-12-09 10:11:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:34,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 10:11:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:34,056 INFO L225 Difference]: With dead ends: 419 [2018-12-09 10:11:34,056 INFO L226 Difference]: Without dead ends: 264 [2018-12-09 10:11:34,056 INFO L631 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 [2018-12-09 10:11:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-09 10:11:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-12-09 10:11:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-09 10:11:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2018-12-09 10:11:34,064 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2018-12-09 10:11:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:34,064 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2018-12-09 10:11:34,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2018-12-09 10:11:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 10:11:34,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:34,065 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2018-12-09 10:11:34,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:34,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2018-12-09 10:11:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 10:11:34,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:34,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:34,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:34,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:34,083 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2018-12-09 10:11:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:34,139 INFO L93 Difference]: Finished difference Result 527 states and 756 transitions. [2018-12-09 10:11:34,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:34,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-09 10:11:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:34,141 INFO L225 Difference]: With dead ends: 527 [2018-12-09 10:11:34,141 INFO L226 Difference]: Without dead ends: 192 [2018-12-09 10:11:34,142 INFO L631 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 [2018-12-09 10:11:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-09 10:11:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-12-09 10:11:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-09 10:11:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-12-09 10:11:34,151 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2018-12-09 10:11:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:34,152 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-12-09 10:11:34,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-12-09 10:11:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 10:11:34,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:11:34,154 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:11:34,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:11:34,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:11:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2018-12-09 10:11:34,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:11:34,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:11:34,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:11:34,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:11:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:11:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 10:11:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:11:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:11:34,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:11:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:11:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:11:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:11:34,194 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-12-09 10:11:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:11:34,206 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2018-12-09 10:11:34,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:11:34,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-12-09 10:11:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:11:34,207 INFO L225 Difference]: With dead ends: 310 [2018-12-09 10:11:34,207 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 10:11:34,208 INFO L631 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 [2018-12-09 10:11:34,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 10:11:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 10:11:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 10:11:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 10:11:34,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-12-09 10:11:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:11:34,209 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:11:34,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:11:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:11:34,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 10:11:34,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 10:11:34,335 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 10:11:34,335 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-12-09 10:11:34,335 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L444 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (<= main_~blastFlag~0 3))) (or (and (<= 8640 main_~s__state~0) .cse0 (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2) (and .cse0 (<= 8672 main_~s__state~0)))) [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L444 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L444 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,336 INFO L444 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,336 INFO L444 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-12-09 10:11:34,336 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L444 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-12-09 10:11:34,337 INFO L444 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,337 INFO L444 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L451 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-12-09 10:11:34,337 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= main_~blastFlag~0 3) (<= 8672 main_~s__state~0)) [2018-12-09 10:11:34,338 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-12-09 10:11:34,338 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,338 INFO L444 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-12-09 10:11:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:11:34 BoogieIcfgContainer [2018-12-09 10:11:34,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:11:34,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:11:34,348 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:11:34,348 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:11:34,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:11:33" (3/4) ... [2018-12-09 10:11:34,351 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 10:11:34,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 10:11:34,355 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 10:11:34,358 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 10:11:34,358 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 10:11:34,358 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 10:11:34,391 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1391cac0-53a6-4424-a748-ddf38378d43e/bin-2019/utaipan/witness.graphml [2018-12-09 10:11:34,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:11:34,392 INFO L168 Benchmark]: Toolchain (without parser) took 1276.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.1 MB in the beginning and 898.5 MB in the end (delta: 49.6 MB). Peak memory consumption was 148.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,393 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:11:34,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 936.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 936.3 MB in the beginning and 930.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,393 INFO L168 Benchmark]: Boogie Preprocessor took 48.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 930.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,393 INFO L168 Benchmark]: RCFGBuilder took 169.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,394 INFO L168 Benchmark]: TraceAbstraction took 861.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 898.5 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. [2018-12-09 10:11:34,394 INFO L168 Benchmark]: Witness Printer took 43.11 ms. Allocated memory is still 1.1 GB. Free memory is still 898.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:11:34,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 936.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.45 ms. Allocated memory is still 1.0 GB. Free memory was 936.3 MB in the beginning and 930.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 930.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 861.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 898.5 MB in the end (delta: 173.8 MB). Peak memory consumption was 173.8 MB. Max. memory is 11.5 GB. * Witness Printer took 43.11 ms. Allocated memory is still 1.1 GB. Free memory is still 898.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: 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: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2) || (blastFlag <= 3 && 8672 <= s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: blastFlag <= 3 && 8672 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 0.8s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 250 SDslu, 321 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 86 NumberOfFragments, 106 HoareAnnotationTreeSize, 21 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 25301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...