./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_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/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 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 12:36:30,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:36:30,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:36:30,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:36:30,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:36:30,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:36:30,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:36:30,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:36:30,704 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:36:30,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:36:30,705 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:36:30,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:36:30,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:36:30,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:36:30,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:36:30,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:36:30,709 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:36:30,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:36:30,711 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:36:30,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:36:30,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:36:30,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:36:30,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:36:30,716 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:36:30,716 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:36:30,717 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:36:30,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:36:30,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:36:30,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:36:30,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:36:30,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:36:30,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:36:30,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:36:30,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:36:30,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:36:30,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:36:30,721 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 12:36:30,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:36:30,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:36:30,732 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:36:30,732 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:36:30,733 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:36:30,733 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:36:30,734 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:36:30,734 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:36:30,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:36:30,734 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 12:36:30,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:36:30,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:36:30,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:36:30,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:36:30,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:36:30,737 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_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/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 -> 9f16087843ad8a83da47d6a6a4e9d674fa79150d [2018-11-23 12:36:30,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:36:30,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:36:30,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:36:30,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:36:30,774 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:36:30,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-23 12:36:30,819 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/data/a80785d52/7508c655697d4cd68a16b02dd41b1ed0/FLAG375e14b7f [2018-11-23 12:36:31,213 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:36:31,214 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-23 12:36:31,218 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/data/a80785d52/7508c655697d4cd68a16b02dd41b1ed0/FLAG375e14b7f [2018-11-23 12:36:31,228 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/data/a80785d52/7508c655697d4cd68a16b02dd41b1ed0 [2018-11-23 12:36:31,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:36:31,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:36:31,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:36:31,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:36:31,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:36:31,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213ccf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31, skipping insertion in model container [2018-11-23 12:36:31,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:36:31,255 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:36:31,359 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:36:31,361 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:36:31,370 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:36:31,378 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:36:31,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31 WrapperNode [2018-11-23 12:36:31,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:36:31,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:36:31,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:36:31,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:36:31,384 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:36:31" (1/1) ... [2018-11-23 12:36:31,387 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:36:31" (1/1) ... [2018-11-23 12:36:31,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:36:31,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:36:31,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:36:31,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:36:31,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... [2018-11-23 12:36:31,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:36:31,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:36:31,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:36:31,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:36:31,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/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 12:36:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:36:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:36:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:36:31,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:36:31,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:36:31,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:36:31,582 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:36:31,582 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:36:31,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:31 BoogieIcfgContainer [2018-11-23 12:36:31,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:36:31,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:36:31,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:36:31,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:36:31,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:36:31" (1/3) ... [2018-11-23 12:36:31,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c87c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:31, skipping insertion in model container [2018-11-23 12:36:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:36:31" (2/3) ... [2018-11-23 12:36:31,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c87c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:36:31, skipping insertion in model container [2018-11-23 12:36:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:31" (3/3) ... [2018-11-23 12:36:31,589 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-complex_false-no-overflow.c [2018-11-23 12:36:31,597 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:36:31,603 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2018-11-23 12:36:31,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2018-11-23 12:36:31,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:36:31,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:36:31,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:36:31,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:36:31,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:36:31,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:36:31,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:36:31,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:36:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 12:36:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:36:31,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:31,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:31,652 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:31,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1007359530, now seen corresponding path program 1 times [2018-11-23 12:36:31,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:31,730 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 12:36:31,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:31,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:31,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:36:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:36:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:36:31,744 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 12:36:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:31,757 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 12:36:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:36:31,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-23 12:36:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:31,765 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:36:31,765 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:36:31,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:36:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:36:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:36:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:36:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 12:36:31,791 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 8 [2018-11-23 12:36:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:31,792 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 12:36:31,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:36:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 12:36:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:36:31,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:31,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:31,793 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:31,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1007358538, now seen corresponding path program 1 times [2018-11-23 12:36:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:31,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:31,830 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 12:36:31,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:31,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:31,832 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 3 states. [2018-11-23 12:36:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:31,884 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-23 12:36:31,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:31,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 12:36:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:31,886 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:36:31,886 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:36:31,886 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 12:36:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:36:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-11-23 12:36:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:36:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 12:36:31,890 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 8 [2018-11-23 12:36:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:31,891 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 12:36:31,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:36:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 12:36:31,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:31,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:31,891 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1163343693, now seen corresponding path program 1 times [2018-11-23 12:36:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:31,917 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 12:36:31,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:31,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:31,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:31,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:31,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:31,918 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2018-11-23 12:36:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:31,960 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:36:31,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:31,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 12:36:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:31,961 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:36:31,961 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:36:31,961 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 12:36:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:36:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:36:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:36:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-11-23 12:36:31,964 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 9 [2018-11-23 12:36:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:31,964 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-23 12:36:31,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-11-23 12:36:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 12:36:31,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:31,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:31,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1163344655, now seen corresponding path program 1 times [2018-11-23 12:36:31,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:31,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:31,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:31,984 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 12:36:31,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:31,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:36:31,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:31,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:36:31,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:36:31,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:36:31,985 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 4 states. [2018-11-23 12:36:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:32,130 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 12:36:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:36:32,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 12:36:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:32,131 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:36:32,131 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:36:32,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:36:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:36:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-11-23 12:36:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:36:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-23 12:36:32,136 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 9 [2018-11-23 12:36:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:32,136 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-23 12:36:32,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:36:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-23 12:36:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:36:32,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:32,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:32,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:32,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1703916204, now seen corresponding path program 1 times [2018-11-23 12:36:32,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:32,150 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 12:36:32,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:32,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:32,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:32,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:32,151 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-23 12:36:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:32,175 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 12:36:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:32,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 12:36:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:32,177 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:36:32,177 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:36:32,177 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 12:36:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:36:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-23 12:36:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:36:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-23 12:36:32,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 10 [2018-11-23 12:36:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:32,183 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-23 12:36:32,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-23 12:36:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:36:32,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:32,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:32,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:32,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1703945996, now seen corresponding path program 1 times [2018-11-23 12:36:32,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:32,198 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 12:36:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:32,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:32,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:32,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:32,199 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-23 12:36:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:32,224 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2018-11-23 12:36:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:32,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 12:36:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:32,225 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:36:32,225 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:36:32,225 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 12:36:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:36:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-23 12:36:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:36:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-11-23 12:36:32,231 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 10 [2018-11-23 12:36:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:32,231 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-23 12:36:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:36:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:36:32,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:32,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:32,233 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:32,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1703951954, now seen corresponding path program 1 times [2018-11-23 12:36:32,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:36:32,249 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 12:36:32,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:36:32,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:36:32,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:36:32,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:36:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:36:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:36:32,250 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 3 states. [2018-11-23 12:36:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:36:32,287 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2018-11-23 12:36:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:36:32,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 12:36:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:36:32,287 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:36:32,288 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:36:32,288 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 12:36:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:36:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:36:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:36:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2018-11-23 12:36:32,292 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 10 [2018-11-23 12:36:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:36:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-11-23 12:36:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:36:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-11-23 12:36:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:36:32,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:36:32,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:36:32,293 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:36:32,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:36:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1281794863, now seen corresponding path program 1 times [2018-11-23 12:36:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:36:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:36:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:36:32,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:36:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:36:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:36:32,312 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #68#return; [?] CALL call #t~ret2 := main(); [?] havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume !!(~a~0 < 30); VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume !(~b~0 < ~a~0); VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume 2 + ~a~0 <= 2147483647; VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume 2 + ~a~0 >= -2147483648;~a~0 := 2 + ~a~0; VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] assume ~b~0 - 10 <= 2147483647; VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] assume !(~b~0 - 10 >= -2147483648); VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] assume !!(~a~0 < 30); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] assume !(~b~0 < ~a~0); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] 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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] assume !!(~a~0 < 30); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] assume !(~b~0 < ~a~0); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 VAL [a=-2147483639, b=-2147483639] [L17] COND FALSE !(b < a) VAL [a=-2147483639, b=-2147483639] [L29] EXPR a + 2 [L29] a = a + 2 VAL [a=-2147483637, b=-2147483639] [L30] b - 10 VAL [a=-2147483637, b=-2147483639] ----- [2018-11-23 12:36:32,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:36:32 BoogieIcfgContainer [2018-11-23 12:36:32,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:36:32,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:36:32,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:36:32,329 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:36:32,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:36:31" (3/4) ... [2018-11-23 12:36:32,331 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 #68#return; [?] CALL call #t~ret2 := main(); [?] havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume !!(~a~0 < 30); VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume !(~b~0 < ~a~0); VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume 2 + ~a~0 <= 2147483647; VAL [main_~a~0=(- 2147483639), main_~b~0=(- 2147483639)] [?] assume 2 + ~a~0 >= -2147483648;~a~0 := 2 + ~a~0; VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] assume ~b~0 - 10 <= 2147483647; VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] assume !(~b~0 - 10 >= -2147483648); VAL [main_~a~0=(- 2147483637), main_~b~0=(- 2147483639)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] assume !!(~a~0 < 30); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] assume !(~b~0 < ~a~0); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] 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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] assume !!(~a~0 < 30); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] assume !(~b~0 < ~a~0); VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [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; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L16-L31] COND FALSE !(!(~a~0 < 30)) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L17-L28] COND TRUE !(~b~0 < ~a~0) VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 <= 2147483647; VAL [~a~0=-2147483639, ~b~0=-2147483639] [L29] assert 2 + ~a~0 >= -2147483648; [L29] ~a~0 := 2 + ~a~0; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 <= 2147483647; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L30] assert ~b~0 - 10 >= -2147483648; VAL [~a~0=-2147483637, ~b~0=-2147483639] [L13] int a, b; [L14] a = __VERIFIER_nondet_int() [L15] b = __VERIFIER_nondet_int() [L16] COND TRUE a < 30 VAL [a=-2147483639, b=-2147483639] [L17] COND FALSE !(b < a) VAL [a=-2147483639, b=-2147483639] [L29] EXPR a + 2 [L29] a = a + 2 VAL [a=-2147483637, b=-2147483639] [L30] b - 10 VAL [a=-2147483637, b=-2147483639] ----- [2018-11-23 12:36:32,362 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5e014bc5-53e1-4cd7-93ef-470c94fcbb76/bin-2019/utaipan/witness.graphml [2018-11-23 12:36:32,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:36:32,363 INFO L168 Benchmark]: Toolchain (without parser) took 1131.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 961.1 MB in the beginning and 1.1 GB in the end (delta: -94.1 MB). Peak memory consumption was 77.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,364 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:36:32,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.12 ms. Allocated memory is still 1.0 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:36:32,365 INFO L168 Benchmark]: Boogie Preprocessor took 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,365 INFO L168 Benchmark]: RCFGBuilder took 178.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,365 INFO L168 Benchmark]: TraceAbstraction took 745.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,366 INFO L168 Benchmark]: Witness Printer took 33.25 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:36:32,368 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.69 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.12 ms. Allocated memory is still 1.0 GB. Free memory is still 950.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 745.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. * Witness Printer took 33.25 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 VAL [a=-2147483639, b=-2147483639] [L17] COND FALSE !(b < a) VAL [a=-2147483639, b=-2147483639] [L29] EXPR a + 2 [L29] a = a + 2 VAL [a=-2147483637, b=-2147483639] [L30] b - 10 VAL [a=-2147483637, b=-2147483639] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 12 error locations. UNSAFE Result, 0.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 119 SDslu, 68 SDs, 0 SdLazy, 161 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...