./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/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_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/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-aa41828 [2018-11-23 13:11:00,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:11:00,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:11:00,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:11:00,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:11:00,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:11:00,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:11:00,384 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:11:00,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:11:00,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:11:00,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:11:00,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:11:00,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:11:00,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:11:00,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:11:00,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:11:00,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:11:00,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:11:00,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:11:00,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:11:00,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:11:00,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:11:00,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:11:00,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:11:00,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:11:00,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:11:00,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:11:00,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:11:00,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:11:00,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:11:00,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:11:00,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:11:00,400 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:11:00,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:11:00,401 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:11:00,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:11:00,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:11:00,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:11:00,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:11:00,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:11:00,411 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:11:00,411 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:11:00,411 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:11:00,411 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:11:00,412 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:11:00,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:11:00,413 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:11:00,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:11:00,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:11:00,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:11:00,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:11:00,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:11:00,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:11:00,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:11:00,415 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:11:00,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:11:00,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:11:00,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:11:00,416 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_a6a00d4d-989f-409d-aa00-da2246fd36e3/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-11-23 13:11:00,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:11:00,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:11:00,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:11:00,452 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:11:00,452 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:11:00,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 13:11:00,495 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/data/4d4dc9430/bc48cefeab8f4cb3a0acb4b10afede51/FLAG57f116b57 [2018-11-23 13:11:00,901 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:11:00,902 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 13:11:00,906 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/data/4d4dc9430/bc48cefeab8f4cb3a0acb4b10afede51/FLAG57f116b57 [2018-11-23 13:11:00,918 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/data/4d4dc9430/bc48cefeab8f4cb3a0acb4b10afede51 [2018-11-23 13:11:00,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:11:00,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:11:00,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:00,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:11:00,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:11:00,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:00, skipping insertion in model container [2018-11-23 13:11:00,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:11:00" (1/1) ... [2018-11-23 13:11:00,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:11:00,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:11:01,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:01,083 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:11:01,098 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:11:01,109 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:11:01,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01 WrapperNode [2018-11-23 13:11:01,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:11:01,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:01,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:11:01,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:11:01,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:11:01,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:11:01,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:11:01,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:11:01,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... [2018-11-23 13:11:01,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:11:01,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:11:01,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:11:01,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:11:01,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/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-11-23 13:11:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:11:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:11:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:11:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:11:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:11:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:11:01,386 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:11:01,386 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:11:01,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01 BoogieIcfgContainer [2018-11-23 13:11:01,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:11:01,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:11:01,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:11:01,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:11:01,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:11:00" (1/3) ... [2018-11-23 13:11:01,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8e6ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 13:11:01,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:11:01" (2/3) ... [2018-11-23 13:11:01,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8e6ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:11:01, skipping insertion in model container [2018-11-23 13:11:01,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/3) ... [2018-11-23 13:11:01,392 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 13:11:01,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:11:01,402 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:11:01,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:11:01,441 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:11:01,442 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:11:01,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:11:01,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:11:01,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:11:01,442 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:11:01,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:11:01,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:11:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 13:11:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:11:01,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:01,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:01,459 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:01,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2018-11-23 13:11:01,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:01,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:01,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:01,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:01,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:01,575 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 13:11:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:01,647 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2018-11-23 13:11:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:01,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:11:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:01,654 INFO L225 Difference]: With dead ends: 136 [2018-11-23 13:11:01,655 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 13:11:01,657 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-11-23 13:11:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 13:11:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 13:11:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:11:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2018-11-23 13:11:01,687 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 8 [2018-11-23 13:11:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:01,688 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2018-11-23 13:11:01,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-11-23 13:11:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:11:01,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:01,688 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:01,689 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:01,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2018-11-23 13:11:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:01,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:01,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:01,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:01,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:01,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:01,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:01,719 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 3 states. [2018-11-23 13:11:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:01,776 INFO L93 Difference]: Finished difference Result 161 states and 253 transitions. [2018-11-23 13:11:01,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:01,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:11:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:01,778 INFO L225 Difference]: With dead ends: 161 [2018-11-23 13:11:01,778 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 13:11:01,779 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-11-23 13:11:01,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 13:11:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-23 13:11:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 13:11:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2018-11-23 13:11:01,788 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 13 [2018-11-23 13:11:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:01,788 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2018-11-23 13:11:01,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2018-11-23 13:11:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:11:01,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:01,789 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:01,789 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:01,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2018-11-23 13:11:01,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:01,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:01,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:11:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:01,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:01,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:01,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:01,824 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand 3 states. [2018-11-23 13:11:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:01,906 INFO L93 Difference]: Finished difference Result 237 states and 369 transitions. [2018-11-23 13:11:01,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:01,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 13:11:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:01,907 INFO L225 Difference]: With dead ends: 237 [2018-11-23 13:11:01,907 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 13:11:01,908 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-11-23 13:11:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 13:11:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-23 13:11:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 13:11:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2018-11-23 13:11:01,920 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 19 [2018-11-23 13:11:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:01,920 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2018-11-23 13:11:01,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-11-23 13:11:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:11:01,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:01,921 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-11-23 13:11:01,921 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:01,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2018-11-23 13:11:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:01,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:11:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:01,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:01,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:01,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:01,960 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 3 states. [2018-11-23 13:11:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,025 INFO L93 Difference]: Finished difference Result 371 states and 583 transitions. [2018-11-23 13:11:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:02,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 13:11:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:02,027 INFO L225 Difference]: With dead ends: 371 [2018-11-23 13:11:02,027 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 13:11:02,028 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-11-23 13:11:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 13:11:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-11-23 13:11:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-23 13:11:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. [2018-11-23 13:11:02,042 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 295 transitions. Word has length 34 [2018-11-23 13:11:02,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,043 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 295 transitions. [2018-11-23 13:11:02,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 295 transitions. [2018-11-23 13:11:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:02,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:02,044 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-11-23 13:11:02,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:02,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:02,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2018-11-23 13:11:02,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:11:02,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:02,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:02,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:02,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:02,077 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. Second operand 3 states. [2018-11-23 13:11:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,132 INFO L93 Difference]: Finished difference Result 419 states and 592 transitions. [2018-11-23 13:11:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:02,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 13:11:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:02,133 INFO L225 Difference]: With dead ends: 419 [2018-11-23 13:11:02,133 INFO L226 Difference]: Without dead ends: 264 [2018-11-23 13:11:02,134 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-11-23 13:11:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-23 13:11:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-11-23 13:11:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 13:11:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 369 transitions. [2018-11-23 13:11:02,144 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 369 transitions. Word has length 48 [2018-11-23 13:11:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,144 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 369 transitions. [2018-11-23 13:11:02,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 369 transitions. [2018-11-23 13:11:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:11:02,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:02,145 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-11-23 13:11:02,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:02,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2018-11-23 13:11:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:11:02,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:02,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:02,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:02,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:02,185 INFO L87 Difference]: Start difference. First operand 262 states and 369 transitions. Second operand 3 states. [2018-11-23 13:11:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,251 INFO L93 Difference]: Finished difference Result 527 states and 756 transitions. [2018-11-23 13:11:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:02,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 13:11:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:02,253 INFO L225 Difference]: With dead ends: 527 [2018-11-23 13:11:02,253 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 13:11:02,254 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-11-23 13:11:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 13:11:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-11-23 13:11:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 13:11:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-11-23 13:11:02,264 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 51 [2018-11-23 13:11:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,264 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-11-23 13:11:02,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-11-23 13:11:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 13:11:02,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:02,268 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-11-23 13:11:02,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:02,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1939547864, now seen corresponding path program 1 times [2018-11-23 13:11:02,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:11:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:11:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:02,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:11:02,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:11:02,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:11:02,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:11:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:11:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:11:02,326 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 3 states. [2018-11-23 13:11:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,338 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2018-11-23 13:11:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:11:02,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-23 13:11:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:02,339 INFO L225 Difference]: With dead ends: 310 [2018-11-23 13:11:02,339 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:11:02,340 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-11-23 13:11:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:11:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:11:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:11:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:11:02,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-11-23 13:11:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,341 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:11:02,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:11:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:11:02,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:02,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:11:02,508 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:11:02,508 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:02,508 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:11:02,508 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:11:02,508 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:11:02,508 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 13:11:02,509 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-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-11-23 13:11:02,509 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-11-23 13:11:02,509 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-11-23 13:11:02,510 INFO L444 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,510 INFO L444 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,510 INFO L444 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,510 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-11-23 13:11:02,510 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-11-23 13:11:02,510 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 13:11:02,510 INFO L444 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,510 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-11-23 13:11:02,510 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-11-23 13:11:02,510 INFO L444 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,511 INFO L444 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-23 13:11:02,511 INFO L451 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 13:11:02,512 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-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-11-23 13:11:02,512 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-11-23 13:11:02,512 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-11-23 13:11:02,512 INFO L444 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,512 INFO L444 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,513 INFO L444 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-11-23 13:11:02,513 INFO L444 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,513 INFO L444 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-23 13:11:02,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:11:02 BoogieIcfgContainer [2018-11-23 13:11:02,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:11:02,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:11:02,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:11:02,525 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:11:02,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:11:01" (3/4) ... [2018-11-23 13:11:02,527 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:11:02,531 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:11:02,532 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:11:02,535 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:11:02,536 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:11:02,536 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:11:02,577 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a6a00d4d-989f-409d-aa00-da2246fd36e3/bin-2019/utaipan/witness.graphml [2018-11-23 13:11:02,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:11:02,578 INFO L168 Benchmark]: Toolchain (without parser) took 1657.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 960.3 MB in the beginning and 941.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,579 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:11:02,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.07 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:11:02,579 INFO L168 Benchmark]: Boogie Preprocessor took 53.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,580 INFO L168 Benchmark]: RCFGBuilder took 208.36 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,580 INFO L168 Benchmark]: TraceAbstraction took 1137.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.6 MB in the end (delta: 163.3 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,580 INFO L168 Benchmark]: Witness Printer took 52.89 ms. Allocated memory is still 1.2 GB. Free memory was 946.6 MB in the beginning and 941.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:11:02,581 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.07 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.36 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1137.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 946.6 MB in the end (delta: 163.3 MB). Peak memory consumption was 163.3 MB. Max. memory is 11.5 GB. * Witness Printer took 52.89 ms. Allocated memory is still 1.2 GB. Free memory was 946.6 MB in the beginning and 941.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. 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, 1.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.4s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.1s 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...