./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig2-TACAS2011-Fig3_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig2-TACAS2011-Fig3_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 588716e5dd1c3d01882e1bf0a06b3529d9c3d880 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:33:26,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:33:26,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:33:26,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:33:26,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:33:26,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:33:26,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:33:26,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:33:26,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:33:26,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:33:26,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:33:26,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:33:26,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:33:26,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:33:26,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:33:26,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:33:26,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:33:26,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:33:26,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:33:26,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:33:26,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:33:26,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:33:26,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:33:26,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:33:26,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:33:26,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:33:26,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:33:26,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:33:26,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:33:26,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:33:26,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:33:26,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:33:26,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:33:26,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:33:26,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:33:26,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:33:26,485 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 00:33:26,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:33:26,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:33:26,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:33:26,496 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:33:26,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:33:26,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:33:26,497 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:33:26,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:33:26,497 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:33:26,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:33:26,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:33:26,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:33:26,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:33:26,499 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:33:26,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:33:26,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:33:26,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588716e5dd1c3d01882e1bf0a06b3529d9c3d880 [2018-11-23 00:33:26,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:33:26,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:33:26,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:33:26,533 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:33:26,533 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:33:26,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig2-TACAS2011-Fig3_false-no-overflow.c [2018-11-23 00:33:26,570 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/data/7661829b1/e364b2fd0e7847a3b727f2393fad2bac/FLAG742dcd3c1 [2018-11-23 00:33:26,965 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:33:26,965 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-LICS2004-Fig2-TACAS2011-Fig3_false-no-overflow.c [2018-11-23 00:33:26,969 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/data/7661829b1/e364b2fd0e7847a3b727f2393fad2bac/FLAG742dcd3c1 [2018-11-23 00:33:26,981 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/data/7661829b1/e364b2fd0e7847a3b727f2393fad2bac [2018-11-23 00:33:26,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:33:26,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:33:26,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:33:26,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:33:26,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:33:26,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:26" (1/1) ... [2018-11-23 00:33:26,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108971e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:26, skipping insertion in model container [2018-11-23 00:33:26,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:33:26" (1/1) ... [2018-11-23 00:33:26,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:33:27,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:33:27,123 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:33:27,125 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:33:27,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:33:27,142 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:33:27,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27 WrapperNode [2018-11-23 00:33:27,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:33:27,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:33:27,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:33:27,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:33:27,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:33:27,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:33:27,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:33:27,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:33:27,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... [2018-11-23 00:33:27,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:33:27,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:33:27,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:33:27,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:33:27,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/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 00:33:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:33:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:33:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:33:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:33:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:33:27,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:33:27,339 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:33:27,340 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:33:27,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:27 BoogieIcfgContainer [2018-11-23 00:33:27,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:33:27,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:33:27,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:33:27,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:33:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:33:26" (1/3) ... [2018-11-23 00:33:27,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec26de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:27, skipping insertion in model container [2018-11-23 00:33:27,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:33:27" (2/3) ... [2018-11-23 00:33:27,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec26de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:33:27, skipping insertion in model container [2018-11-23 00:33:27,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:27" (3/3) ... [2018-11-23 00:33:27,346 INFO L112 eAbstractionObserver]: Analyzing ICFG PodelskiRybalchenko-LICS2004-Fig2-TACAS2011-Fig3_false-no-overflow.c [2018-11-23 00:33:27,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:33:27,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 00:33:27,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 00:33:27,392 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:33:27,392 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:33:27,392 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:33:27,392 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:33:27,392 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:33:27,393 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:33:27,393 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:33:27,393 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:33:27,393 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:33:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 00:33:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:33:27,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:27,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:27,408 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:33:27,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -623924281, now seen corresponding path program 1 times [2018-11-23 00:33:27,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:33:27,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:33:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,518 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 00:33:27,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:27,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:33:27,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:33:27,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:33:27,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:33:27,532 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-11-23 00:33:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:27,606 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 00:33:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:33:27,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 00:33:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:27,613 INFO L225 Difference]: With dead ends: 52 [2018-11-23 00:33:27,613 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 00:33:27,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:33:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 00:33:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-11-23 00:33:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 00:33:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 00:33:27,638 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2018-11-23 00:33:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:27,638 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 00:33:27,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:33:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 00:33:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:33:27,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:27,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:27,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:33:27,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,640 INFO L82 PathProgramCache]: Analyzing trace with hash -623924089, now seen corresponding path program 1 times [2018-11-23 00:33:27,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:33:27,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:33:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:27,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,670 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 00:33:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:27,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:33:27,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:33:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:33:27,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:33:27,672 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2018-11-23 00:33:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:27,720 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 00:33:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:33:27,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 00:33:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:27,722 INFO L225 Difference]: With dead ends: 38 [2018-11-23 00:33:27,722 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 00:33:27,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:33:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 00:33:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-11-23 00:33:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 00:33:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 00:33:27,727 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2018-11-23 00:33:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:27,727 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 00:33:27,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:33:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 00:33:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:33:27,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:27,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:27,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:33:27,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2133183819, now seen corresponding path program 1 times [2018-11-23 00:33:27,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:33:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:33:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,748 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 00:33:27,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:27,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:33:27,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:33:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:33:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:33:27,750 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 00:33:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:27,762 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 00:33:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:33:27,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 00:33:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:27,763 INFO L225 Difference]: With dead ends: 26 [2018-11-23 00:33:27,763 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 00:33:27,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:33:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 00:33:27,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 00:33:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 00:33:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 00:33:27,768 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2018-11-23 00:33:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:27,768 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 00:33:27,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:33:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 00:33:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:33:27,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:27,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:27,769 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:33:27,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2133189777, now seen corresponding path program 1 times [2018-11-23 00:33:27,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:33:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:33:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:27,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,783 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 00:33:27,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:33:27,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:33:27,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:33:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:33:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:33:27,784 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 00:33:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:33:27,791 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 00:33:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:33:27,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 00:33:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:33:27,792 INFO L225 Difference]: With dead ends: 24 [2018-11-23 00:33:27,792 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 00:33:27,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:33:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 00:33:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 00:33:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 00:33:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 00:33:27,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2018-11-23 00:33:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:33:27,796 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 00:33:27,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:33:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 00:33:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:33:27,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:33:27,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:33:27,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:33:27,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1704373705, now seen corresponding path program 1 times [2018-11-23 00:33:27,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:33:27,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:33:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:33:27,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:33:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:33:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:33:27,825 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~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~oldx~0;havoc ~oldy~0;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=2147483647, main_~y~0=1] [?] assume !!(~x~0 > 0 && ~y~0 > 0);~oldx~0 := ~x~0;~oldy~0 := ~y~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1] [?] assume ~oldy~0 - 2 <= 2147483647; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1] [?] assume ~oldy~0 - 2 >= -2147483648;~x~0 := ~oldy~0 - 2; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=(- 1), main_~y~0=1] [?] assume !(1 + ~oldx~0 <= 2147483647); VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=(- 1), main_~y~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] assume !!(~x~0 > 0 && ~y~0 > 0); [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24-L30] assume !(0 != #t~nondet2); [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] assume !!(~x~0 > 0 && ~y~0 > 0); [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24-L30] assume !(0 != #t~nondet2); [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L18] int x, y, oldx, oldy; [L19] x = __VERIFIER_nondet_int() [L20] y = __VERIFIER_nondet_int() [L21] COND TRUE x > 0 && y > 0 [L22] oldx = x [L23] oldy = y [L24] COND FALSE !(__VERIFIER_nondet_int() != 0) [L28] EXPR oldy - 2 [L28] x = oldy - 2 VAL [x=-1, x=2147483647, y=1, y=1] [L29] oldx + 1 VAL [x=2147483647, x=-1, y=1, y=1] ----- [2018-11-23 00:33:27,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:33:27 BoogieIcfgContainer [2018-11-23 00:33:27,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:33:27,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:33:27,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:33:27,848 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:33:27,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:33:27" (3/4) ... [2018-11-23 00:33:27,850 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~ret3 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~oldx~0;havoc ~oldy~0;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=2147483647, main_~y~0=1] [?] assume !!(~x~0 > 0 && ~y~0 > 0);~oldx~0 := ~x~0;~oldy~0 := ~y~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1] [?] assume ~oldy~0 - 2 <= 2147483647; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=2147483647, main_~y~0=1] [?] assume ~oldy~0 - 2 >= -2147483648;~x~0 := ~oldy~0 - 2; VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=(- 1), main_~y~0=1] [?] assume !(1 + ~oldx~0 <= 2147483647); VAL [main_~oldx~0=2147483647, main_~oldy~0=1, main_~x~0=(- 1), main_~y~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] assume !!(~x~0 > 0 && ~y~0 > 0); [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24-L30] assume !(0 != #t~nondet2); [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] assume !!(~x~0 > 0 && ~y~0 > 0); [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24-L30] assume !(0 != #t~nondet2); [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L18] havoc ~x~0; [L18] havoc ~y~0; [L18] havoc ~oldx~0; [L18] havoc ~oldy~0; [L19] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L19] ~x~0 := #t~nondet0; [L19] havoc #t~nondet0; [L20] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L20] ~y~0 := #t~nondet1; [L20] havoc #t~nondet1; VAL [~x~0=2147483647, ~y~0=1] [L21-L31] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L22] ~oldx~0 := ~x~0; [L23] ~oldy~0 := ~y~0; [L24] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#t~nondet2=0, ~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L24] COND FALSE !(0 != #t~nondet2) [L24] havoc #t~nondet2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=2147483647, ~y~0=1] [L28] assert ~oldy~0 - 2 >= -2147483648; [L28] ~x~0 := ~oldy~0 - 2; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L29] assert 1 + ~oldx~0 <= 2147483647; VAL [~oldx~0=2147483647, ~oldy~0=1, ~x~0=-1, ~y~0=1] [L18] int x, y, oldx, oldy; [L19] x = __VERIFIER_nondet_int() [L20] y = __VERIFIER_nondet_int() [L21] COND TRUE x > 0 && y > 0 [L22] oldx = x [L23] oldy = y [L24] COND FALSE !(__VERIFIER_nondet_int() != 0) [L28] EXPR oldy - 2 [L28] x = oldy - 2 VAL [x=-1, x=2147483647, y=1, y=1] [L29] oldx + 1 VAL [x=-1, x=2147483647, y=1, y=1] ----- [2018-11-23 00:33:27,888 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e5072004-a111-42ff-a88c-be07e5889966/bin-2019/uautomizer/witness.graphml [2018-11-23 00:33:27,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:33:27,889 INFO L168 Benchmark]: Toolchain (without parser) took 905.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -57.3 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,890 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:27,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:27,891 INFO L168 Benchmark]: Boogie Preprocessor took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,891 INFO L168 Benchmark]: RCFGBuilder took 171.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,892 INFO L168 Benchmark]: TraceAbstraction took 507.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,892 INFO L168 Benchmark]: Witness Printer took 40.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,894 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 12.56 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 507.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.6 MB). Peak memory consumption was 59.6 MB. Max. memory is 11.5 GB. * Witness Printer took 40.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: integer overflow possible integer overflow possible We found a FailurePath: [L18] int x, y, oldx, oldy; [L19] x = __VERIFIER_nondet_int() [L20] y = __VERIFIER_nondet_int() [L21] COND TRUE x > 0 && y > 0 [L22] oldx = x [L23] oldy = y [L24] COND FALSE !(__VERIFIER_nondet_int() != 0) [L28] EXPR oldy - 2 [L28] x = oldy - 2 VAL [x=-1, x=2147483647, y=1, y=1] [L29] oldx + 1 VAL [x=2147483647, x=-1, y=1, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. UNSAFE Result, 0.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 69 SDslu, 70 SDs, 0 SdLazy, 49 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, 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, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...