./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/terminator_03_false-unreach-call_true-termination.i --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_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/terminator_03_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/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 52ac1cbbf609460dddc737d444d8d8d12fc803ae .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:16:07,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:16:07,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:16:07,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:16:07,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:16:07,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:16:07,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:16:07,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:16:07,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:16:07,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:16:07,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:16:07,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:16:07,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:16:07,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:16:07,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:16:07,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:16:07,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:16:07,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:16:07,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:16:07,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:16:07,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:16:07,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:16:07,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:16:07,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:16:07,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:16:07,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:16:07,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:16:07,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:16:07,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:16:07,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:16:07,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:16:07,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:16:07,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:16:07,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:16:07,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:16:07,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:16:07,287 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 03:16:07,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:16:07,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:16:07,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:16:07,296 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:16:07,296 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:16:07,297 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 03:16:07,297 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 03:16:07,298 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:16:07,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:16:07,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:16:07,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:16:07,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:16:07,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:16:07,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:16:07,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:16:07,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 03:16:07,302 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_f522d53a-191c-49fa-9e9c-176ef356dcdf/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 -> 52ac1cbbf609460dddc737d444d8d8d12fc803ae [2018-11-23 03:16:07,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:16:07,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:16:07,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:16:07,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:16:07,344 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:16:07,345 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/../../sv-benchmarks/c/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 03:16:07,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/data/454f9b4b7/e8b2bccd0b1647e892fd603b1e04a053/FLAGd74c80167 [2018-11-23 03:16:07,731 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:16:07,731 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/sv-benchmarks/c/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 03:16:07,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/data/454f9b4b7/e8b2bccd0b1647e892fd603b1e04a053/FLAGd74c80167 [2018-11-23 03:16:08,155 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/data/454f9b4b7/e8b2bccd0b1647e892fd603b1e04a053 [2018-11-23 03:16:08,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:16:08,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:16:08,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:16:08,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:16:08,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:16:08,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aa7ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08, skipping insertion in model container [2018-11-23 03:16:08,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:16:08,186 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:16:08,300 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:16:08,303 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:16:08,312 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:16:08,321 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:16:08,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08 WrapperNode [2018-11-23 03:16:08,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:16:08,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:16:08,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:16:08,322 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:16:08,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:16:08,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:16:08,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:16:08,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:16:08,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... [2018-11-23 03:16:08,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:16:08,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:16:08,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:16:08,350 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:16:08,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/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 03:16:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:16:08,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:16:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:16:08,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:16:08,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:16:08,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:16:08,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 03:16:08,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 03:16:08,538 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:16:08,538 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 03:16:08,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:08 BoogieIcfgContainer [2018-11-23 03:16:08,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:16:08,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:16:08,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:16:08,543 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:16:08,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:16:08" (1/3) ... [2018-11-23 03:16:08,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49931b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:08, skipping insertion in model container [2018-11-23 03:16:08,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:16:08" (2/3) ... [2018-11-23 03:16:08,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49931b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:16:08, skipping insertion in model container [2018-11-23 03:16:08,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:08" (3/3) ... [2018-11-23 03:16:08,546 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_03_false-unreach-call_true-termination.i [2018-11-23 03:16:08,552 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:16:08,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:16:08,566 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:16:08,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:16:08,593 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:16:08,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:16:08,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:16:08,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:16:08,593 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:16:08,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:16:08,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:16:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 03:16:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:16:08,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:08,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:08,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:08,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2018-11-23 03:16:08,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:16:08,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:08,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:08,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:16:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:16:08,754 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 03:16:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:16:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:16:08,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:16:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:16:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:16:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:16:08,768 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-11-23 03:16:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:16:08,825 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 03:16:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:16:08,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 03:16:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:16:08,834 INFO L225 Difference]: With dead ends: 39 [2018-11-23 03:16:08,835 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 03:16:08,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:16:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 03:16:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 03:16:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 03:16:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 03:16:08,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 03:16:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:16:08,867 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 03:16:08,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:16:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 03:16:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:16:08,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:16:08,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:16:08,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:16:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:16:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1117320769, now seen corresponding path program 1 times [2018-11-23 03:16:08,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:16:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:16:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:16:08,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:16:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:16:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:16:08,898 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret2 := main(); [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=100, main_~y~0=1] [?] assume ~y~0 > 0; VAL [main_~x~0=100, main_~y~0=1] [?] assume !(~x~0 < 100); VAL [main_~x~0=100, main_~y~0=1] [?] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 03:16:08,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:16:08 BoogieIcfgContainer [2018-11-23 03:16:08,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:16:08,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:16:08,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:16:08,920 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:16:08,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:16:08" (3/4) ... [2018-11-23 03:16:08,922 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret2 := main(); [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=100, main_~y~0=1] [?] assume ~y~0 > 0; VAL [main_~x~0=100, main_~y~0=1] [?] assume !(~x~0 < 100); VAL [main_~x~0=100, main_~y~0=1] [?] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16-L22] assume ~y~0 > 0; VAL [~x~0=100, ~y~0=1] [L18-L21] assume !(~x~0 < 100); VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100, ~y~0=1] [L16] COND TRUE ~y~0 > 0 VAL [~x~0=100, ~y~0=1] [L18-L21] COND TRUE !(~x~0 < 100) VAL [~x~0=100, ~y~0=1] [L23] CALL call __VERIFIER_assert((if ~y~0 <= 0 || (~y~0 < 0 && ~x~0 >= 100) then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 03:16:08,951 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f522d53a-191c-49fa-9e9c-176ef356dcdf/bin-2019/utaipan/witness.graphml [2018-11-23 03:16:08,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:16:08,952 INFO L168 Benchmark]: Toolchain (without parser) took 794.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -136.8 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:16:08,953 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:16:08,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:16:08,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.55 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:16:08,954 INFO L168 Benchmark]: Boogie Preprocessor took 14.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:16:08,954 INFO L168 Benchmark]: RCFGBuilder took 189.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:16:08,954 INFO L168 Benchmark]: TraceAbstraction took 379.34 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:16:08,955 INFO L168 Benchmark]: Witness Printer took 31.73 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:16:08,957 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.55 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 379.34 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Witness Printer took 31.73 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1] [L18] COND FALSE !(x<100) VAL [x=100, y=1] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 7 SDslu, 49 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...