./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_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_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9f16087843ad8a83da47d6a6a4e9d674fa79150d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:24:16,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:24:16,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:24:16,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:24:16,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:24:16,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:24:16,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:24:16,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:24:16,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:24:16,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:24:16,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:24:16,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:24:16,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:24:16,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:24:16,263 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:24:16,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:24:16,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:24:16,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:24:16,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:24:16,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:24:16,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:24:16,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:24:16,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:24:16,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:24:16,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:24:16,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:24:16,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:24:16,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:24:16,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:24:16,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:24:16,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:24:16,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:24:16,274 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:24:16,274 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:24:16,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:24:16,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:24:16,276 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 07:24:16,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:24:16,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:24:16,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:24:16,284 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:24:16,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:24:16,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:24:16,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:24:16,285 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:24:16,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:24:16,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:24:16,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:24:16,287 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:24:16,287 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:24:16,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:24:16,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:24:16,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:24:16,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:24:16,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:24:16,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:24:16,288 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:24:16,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:24:16,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:24:16,288 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_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak 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 -> Kojak 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 -> 9f16087843ad8a83da47d6a6a4e9d674fa79150d [2018-11-23 07:24:16,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:24:16,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:24:16,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:24:16,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:24:16,325 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:24:16,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-23 07:24:16,364 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/data/aca73753d/2cdd1a12be9a4e50a47e7877a2e51e75/FLAG059f5a947 [2018-11-23 07:24:16,764 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:24:16,764 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-23 07:24:16,768 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/data/aca73753d/2cdd1a12be9a4e50a47e7877a2e51e75/FLAG059f5a947 [2018-11-23 07:24:16,779 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/data/aca73753d/2cdd1a12be9a4e50a47e7877a2e51e75 [2018-11-23 07:24:16,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:24:16,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:24:16,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:24:16,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:24:16,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:24:16,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd21f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16, skipping insertion in model container [2018-11-23 07:24:16,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:24:16,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:24:16,912 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:24:16,915 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:24:16,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:24:16,932 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:24:16,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16 WrapperNode [2018-11-23 07:24:16,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:24:16,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:24:16,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:24:16,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:24:16,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:24:16,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:24:16,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:24:16,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:24:16,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... [2018-11-23 07:24:16,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:24:16,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:24:16,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:24:16,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:24:16,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:24:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 07:24:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:24:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:24:17,171 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:24:17,171 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 07:24:17,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:24:17 BoogieIcfgContainer [2018-11-23 07:24:17,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:24:17,172 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:24:17,172 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:24:17,182 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:24:17,182 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:24:17" (1/1) ... [2018-11-23 07:24:17,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:24:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 30 states and 33 transitions. [2018-11-23 07:24:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 07:24:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 07:24:17,225 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,316 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 07:24:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 32 states and 38 transitions. [2018-11-23 07:24:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 07:24:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 07:24:17,349 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,366 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 07:24:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 34 states and 41 transitions. [2018-11-23 07:24:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 07:24:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 07:24:17,404 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,426 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 07:24:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 33 states and 40 transitions. [2018-11-23 07:24:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 07:24:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 07:24:17,451 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,473 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 07:24:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 37 states and 46 transitions. [2018-11-23 07:24:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 07:24:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 07:24:17,552 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,569 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 07:24:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 38 states and 50 transitions. [2018-11-23 07:24:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2018-11-23 07:24:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 07:24:17,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,756 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 07:24:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 40 states and 52 transitions. [2018-11-23 07:24:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2018-11-23 07:24:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 07:24:17,826 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:24:17,871 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 07:24:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:24:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 45 states and 63 transitions. [2018-11-23 07:24:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2018-11-23 07:24:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 07:24:18,093 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:24:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:24:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:24:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:24:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:24:18,119 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 8 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0;havoc main_~a~0;havoc main_~b~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume !!(main_~a~0 < 30); VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~b~0 < main_~a~0);}EndParallelComposition VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume 2 + main_~a~0 <= 2147483647; VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume 2 + main_~a~0 >= -2147483648;main_~a~0 := 2 + main_~a~0; VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume main_~b~0 - 10 <= 2147483647; VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume !(main_~b~0 - 10 >= -2147483648); VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] assume !!(main_~a~0 < 30); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] assume !(main_~b~0 < main_~a~0); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] assume !!(main_~a~0 < 30); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] assume !(main_~b~0 < main_~a~0); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] COND FALSE !(!(main_~a~0 < 30)) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] COND TRUE !(main_~b~0 < main_~a~0) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] COND FALSE !(!(main_~a~0 < 30)) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] COND TRUE !(main_~b~0 < main_~a~0) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L13] havoc ~a~0; [L13] havoc ~b~0; [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~a~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~b~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16-L31] COND FALSE !(!(~a~0 < 30)) [L17-L28] COND TRUE !(~b~0 < ~a~0) [L29] assert 2 + ~a~0 <= 2147483647; [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; [L30] assert ~b~0 - 10 <= 2147483647; [L30] assert ~b~0 - 10 >= -2147483648; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L13] havoc ~b~0; [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~a~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~b~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16-L31] COND FALSE !(!(~a~0 < 30)) [L17-L28] COND TRUE !(~b~0 < ~a~0) [L29] assert 2 + ~a~0 <= 2147483647; [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; [L30] assert ~b~0 - 10 <= 2147483647; [L30] assert ~b~0 - 10 >= -2147483648; [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 [L17] COND FALSE !(b < a) [L29] EXPR a + 2 [L29] a = a + 2 [L30] b - 10 ----- [2018-11-23 07:24:18,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:24:18 ImpRootNode [2018-11-23 07:24:18,143 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:24:18,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:24:18,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:24:18,144 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:24:18,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:24:17" (3/4) ... [2018-11-23 07:24:18,146 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0;havoc main_~a~0;havoc main_~b~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume !!(main_~a~0 < 30); VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~b~0 < main_~a~0);}EndParallelComposition VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume 2 + main_~a~0 <= 2147483647; VAL [ULTIMATE.start_main_~a~0=(- 2147483639), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume 2 + main_~a~0 >= -2147483648;main_~a~0 := 2 + main_~a~0; VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume main_~b~0 - 10 <= 2147483647; VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] assume !(main_~b~0 - 10 >= -2147483648); VAL [ULTIMATE.start_main_~a~0=(- 2147483637), ULTIMATE.start_main_~b~0=(- 2147483639)] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] assume !!(main_~a~0 < 30); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] assume !(main_~b~0 < main_~a~0); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] assume !!(main_~a~0 < 30); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] assume !(main_~b~0 < main_~a~0); VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] COND FALSE !(!(main_~a~0 < 30)) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] COND TRUE !(main_~b~0 < main_~a~0) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_~a~0, main_~b~0; [L13] havoc main_~a~0; [L13] havoc main_~b~0; [L14] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L14] main_~a~0 := main_#t~nondet0; [L14] havoc main_#t~nondet0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~b~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L16-L31] COND FALSE !(!(main_~a~0 < 30)) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L17-L28] COND TRUE !(main_~b~0 < main_~a~0) VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 <= 2147483647; VAL [main_~a~0=-2147483639, main_~b~0=-2147483639] [L29] assert 2 + main_~a~0 >= -2147483648; [L29] main_~a~0 := 2 + main_~a~0; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 <= 2147483647; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L30] assert main_~b~0 - 10 >= -2147483648; VAL [main_~a~0=-2147483637, main_~b~0=-2147483639] [L13] havoc ~a~0; [L13] havoc ~b~0; [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~a~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~b~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16-L31] COND FALSE !(!(~a~0 < 30)) [L17-L28] COND TRUE !(~b~0 < ~a~0) [L29] assert 2 + ~a~0 <= 2147483647; [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; [L30] assert ~b~0 - 10 <= 2147483647; [L30] assert ~b~0 - 10 >= -2147483648; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L13] havoc ~b~0; [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~a~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~b~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16-L31] COND FALSE !(!(~a~0 < 30)) [L17-L28] COND TRUE !(~b~0 < ~a~0) [L29] assert 2 + ~a~0 <= 2147483647; [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; [L30] assert ~b~0 - 10 <= 2147483647; [L30] assert ~b~0 - 10 >= -2147483648; [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 [L17] COND FALSE !(b < a) [L29] EXPR a + 2 [L29] a = a + 2 [L30] b - 10 ----- [2018-11-23 07:24:18,184 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ff7d43a8-1fd8-459a-89a3-b8a474bd4692/bin-2019/ukojak/witness.graphml [2018-11-23 07:24:18,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:24:18,185 INFO L168 Benchmark]: Toolchain (without parser) took 1403.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 960.3 MB in the beginning and 977.4 MB in the end (delta: -17.1 MB). Peak memory consumption was 118.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:24:18,187 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:24:18,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:24:18,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:24:18,189 INFO L168 Benchmark]: Boogie Preprocessor took 11.85 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:24:18,189 INFO L168 Benchmark]: RCFGBuilder took 205.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:24:18,190 INFO L168 Benchmark]: CodeCheck took 970.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:24:18,190 INFO L168 Benchmark]: Witness Printer took 41.23 ms. Allocated memory is still 1.2 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:24:18,195 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 33 locations, 12 error locations. UNSAFE Result, 0.9s OverallTime, 8 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 466 SDslu, 32 SDs, 0 SdLazy, 2442 SolverSat, 524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 30]: integer overflow possible integer overflow possible We found a FailurePath: [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 [L17] COND FALSE !(b < a) [L29] EXPR a + 2 [L29] a = a + 2 [L30] b - 10 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.85 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 205.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * CodeCheck took 970.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 140.8 MB). Peak memory consumption was 140.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.23 ms. Allocated memory is still 1.2 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...