./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_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_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2227825b094336cea9cd81768b48348a309a725b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:28:16,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:28:16,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:28:16,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:28:16,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:28:16,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:28:16,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:28:16,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:28:16,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:28:16,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:28:16,949 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:28:16,949 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:28:16,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:28:16,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:28:16,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:28:16,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:28:16,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:28:16,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:28:16,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:28:16,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:28:16,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:28:16,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:28:16,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:28:16,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:28:16,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:28:16,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:28:16,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:28:16,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:28:16,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:28:16,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:28:16,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:28:16,964 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:28:16,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:28:16,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:28:16,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:28:16,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:28:16,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 00:28:16,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:28:16,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:28:16,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:28:16,978 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:28:16,978 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:28:16,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:28:16,978 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:28:16,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:28:16,979 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:28:16,979 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:28:16,979 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:28:16,979 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:28:16,979 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:28:16,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:28:16,980 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:28:16,981 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:28:16,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:28:16,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:28:16,982 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2227825b094336cea9cd81768b48348a309a725b [2018-11-23 00:28:17,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:28:17,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:28:17,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:28:17,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:28:17,024 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:28:17,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c [2018-11-23 00:28:17,073 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/data/67e32c799/d73aebdf2d45456c93abebee6ea0879e/FLAG6538719a5 [2018-11-23 00:28:17,415 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:28:17,415 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c [2018-11-23 00:28:17,421 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/data/67e32c799/d73aebdf2d45456c93abebee6ea0879e/FLAG6538719a5 [2018-11-23 00:28:17,836 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/data/67e32c799/d73aebdf2d45456c93abebee6ea0879e [2018-11-23 00:28:17,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:28:17,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:28:17,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:28:17,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:28:17,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:28:17,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:17,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17, skipping insertion in model container [2018-11-23 00:28:17,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:17,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:28:17,861 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:28:17,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:28:17,972 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:28:17,985 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:28:17,993 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:28:17,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17 WrapperNode [2018-11-23 00:28:17,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:28:17,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:28:17,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:28:17,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:28:18,000 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:28:17" (1/1) ... [2018-11-23 00:28:18,003 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:28:17" (1/1) ... [2018-11-23 00:28:18,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:28:18,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:28:18,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:28:18,008 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:28:18,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... [2018-11-23 00:28:18,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:28:18,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:28:18,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:28:18,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:28:18,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:28:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:28:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:28:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:28:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:28:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:28:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:28:18,202 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:28:18,203 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:28:18,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:18 BoogieIcfgContainer [2018-11-23 00:28:18,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:28:18,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:28:18,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:28:18,205 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:28:18,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:28:17" (1/3) ... [2018-11-23 00:28:18,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6790a1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:18, skipping insertion in model container [2018-11-23 00:28:18,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:28:17" (2/3) ... [2018-11-23 00:28:18,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6790a1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:28:18, skipping insertion in model container [2018-11-23 00:28:18,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:18" (3/3) ... [2018-11-23 00:28:18,208 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c [2018-11-23 00:28:18,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:28:18,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 00:28:18,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 00:28:18,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:28:18,254 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:28:18,254 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:28:18,254 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:28:18,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:28:18,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:28:18,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:28:18,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:28:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 00:28:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 00:28:18,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:28:18,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:28:18,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:28:18,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:28:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash -37667266, now seen corresponding path program 1 times [2018-11-23 00:28:18,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:28:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:28:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:28:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:28:18,392 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:28:18,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:28:18,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:28:18,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:28:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:28:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:28:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:28:18,407 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-23 00:28:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:28:18,427 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 00:28:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:28:18,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 00:28:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:28:18,434 INFO L225 Difference]: With dead ends: 28 [2018-11-23 00:28:18,435 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 00:28:18,437 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:28:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 00:28:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 00:28:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 00:28:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 00:28:18,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2018-11-23 00:28:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:28:18,463 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 00:28:18,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:28:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 00:28:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:28:18,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:28:18,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:28:18,464 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:28:18,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:28:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1167685199, now seen corresponding path program 1 times [2018-11-23 00:28:18,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:28:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:28:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:28:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:28:18,511 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:28:18,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:28:18,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:28:18,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:28:18,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 00:28:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:28:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:28:18,513 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-11-23 00:28:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:28:18,538 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 00:28:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:28:18,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 00:28:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:28:18,540 INFO L225 Difference]: With dead ends: 22 [2018-11-23 00:28:18,540 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 00:28:18,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:28:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 00:28:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-11-23 00:28:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 00:28:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 00:28:18,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2018-11-23 00:28:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:28:18,544 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 00:28:18,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 00:28:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 00:28:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:28:18,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:28:18,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:28:18,544 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:28:18,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:28:18,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1838502752, now seen corresponding path program 1 times [2018-11-23 00:28:18,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:28:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:28:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:28:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:28:18,566 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:28:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:28:18,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:28:18,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:28:18,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:28:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:28:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:28:18,567 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 00:28:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:28:18,582 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 00:28:18,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:28:18,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 00:28:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:28:18,583 INFO L225 Difference]: With dead ends: 16 [2018-11-23 00:28:18,584 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 00:28:18,584 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:28:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 00:28:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 00:28:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 00:28:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 00:28:18,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 9 [2018-11-23 00:28:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:28:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 00:28:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:28:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 00:28:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:28:18,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:28:18,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:28:18,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 00:28:18,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:28:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1159010413, now seen corresponding path program 1 times [2018-11-23 00:28:18,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:28:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:28:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:28:18,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:28:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:28:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:28:18,625 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #28#return; [?] CALL call #t~ret3 := main(); [?] havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~ell~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~i~0=0, main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0);~ell~0 := ~i~0;~i~0 := ~j~0; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume 1 + ~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume 1 + ~ell~0 >= -2147483648;~j~0 := 1 + ~ell~0; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] assume ~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] assume !(~k~0 - 1 >= -2147483648); VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0); [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0); [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j VAL [ell=0, i=-2147483648, j=-2147483648, k=-2147483648] [L21] EXPR ell + 1 [L21] j = ell + 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] [L22] k - 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] ----- [2018-11-23 00:28:18,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:28:18 BoogieIcfgContainer [2018-11-23 00:28:18,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:28:18,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:28:18,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:28:18,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:28:18,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:28:18" (3/4) ... [2018-11-23 00:28:18,654 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 #28#return; [?] CALL call #t~ret3 := main(); [?] havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~ell~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~i~0=0, main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0);~ell~0 := ~i~0;~i~0 := ~j~0; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume 1 + ~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=(- 2147483648), main_~k~0=(- 2147483648)] [?] assume 1 + ~ell~0 >= -2147483648;~j~0 := 1 + ~ell~0; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] assume ~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] assume !(~k~0 - 1 >= -2147483648); VAL [main_~ell~0=0, main_~i~0=(- 2147483648), main_~j~0=1, main_~k~0=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0); [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] assume !!(~i~0 <= 100 && ~j~0 <= ~k~0); [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~i~0=0, ~j~0=-2147483648, ~k~0=-2147483648] [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=-2147483648, ~k~0=-2147483648] [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 <= 2147483647; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L22] assert ~k~0 - 1 >= -2147483648; VAL [~ell~0=0, ~i~0=-2147483648, ~j~0=1, ~k~0=-2147483648] [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j VAL [ell=0, i=-2147483648, j=-2147483648, k=-2147483648] [L21] EXPR ell + 1 [L21] j = ell + 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] [L22] k - 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] ----- [2018-11-23 00:28:18,690 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7a6b7fb3-7887-44e7-838d-b917c3ed0cc1/bin-2019/utaipan/witness.graphml [2018-11-23 00:28:18,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:28:18,690 INFO L168 Benchmark]: Toolchain (without parser) took 852.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:28:18,692 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:28:18,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.55 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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:28:18,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.46 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:28:18,693 INFO L168 Benchmark]: Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 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:28:18,693 INFO L168 Benchmark]: RCFGBuilder took 181.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:28:18,694 INFO L168 Benchmark]: TraceAbstraction took 447.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:28:18,694 INFO L168 Benchmark]: Witness Printer took 39.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:28:18,696 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.55 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.46 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 447.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. * Witness Printer took 39.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j VAL [ell=0, i=-2147483648, j=-2147483648, k=-2147483648] [L21] EXPR ell + 1 [L21] j = ell + 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] [L22] k - 1 VAL [ell=0, i=-2147483648, j=1, k=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 4 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 18 SDslu, 31 SDs, 0 SdLazy, 20 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...