./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_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_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b51d3ff9a76866bd9c6637bca261a8433dd4524e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:45:46,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:45:46,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:45:46,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:45:46,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:45:46,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:45:46,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:45:46,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:45:46,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:45:46,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:45:46,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:45:46,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:45:46,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:45:46,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:45:46,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:45:46,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:45:46,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:45:46,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:45:46,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:45:46,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:45:46,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:45:46,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:45:46,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:45:46,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:45:46,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:45:46,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:45:46,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:45:46,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:45:46,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:45:46,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:45:46,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:45:46,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:45:46,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:45:46,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:45:46,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:45:46,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:45:46,771 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 03:45:46,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:45:46,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:45:46,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:45:46,782 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:45:46,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:45:46,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:45:46,783 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:45:46,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:45:46,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:45:46,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:45:46,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:45:46,786 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:45:46,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:45:46,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:45:46,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b51d3ff9a76866bd9c6637bca261a8433dd4524e [2018-11-23 03:45:46,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:45:46,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:45:46,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:45:46,819 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:45:46,819 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:45:46,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c [2018-11-23 03:45:46,857 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/data/828ae3efd/44e05f1415f14e8187a19ec373657abb/FLAG2ef6aee8f [2018-11-23 03:45:47,194 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:45:47,194 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c [2018-11-23 03:45:47,200 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/data/828ae3efd/44e05f1415f14e8187a19ec373657abb/FLAG2ef6aee8f [2018-11-23 03:45:47,618 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/data/828ae3efd/44e05f1415f14e8187a19ec373657abb [2018-11-23 03:45:47,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:45:47,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:45:47,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:45:47,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:45:47,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:45:47,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588e9167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47, skipping insertion in model container [2018-11-23 03:45:47,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:45:47,644 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:45:47,769 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:45:47,771 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:45:47,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:45:47,790 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:45:47,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47 WrapperNode [2018-11-23 03:45:47,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:45:47,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:45:47,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:45:47,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:45:47,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:45:47,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:45:47,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:45:47,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:45:47,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... [2018-11-23 03:45:47,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:45:47,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:45:47,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:45:47,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:45:47,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:45:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:45:47,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:45:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:45:47,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:45:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:45:47,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:45:48,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:45:48,013 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 03:45:48,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:48 BoogieIcfgContainer [2018-11-23 03:45:48,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:45:48,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:45:48,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:45:48,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:45:48,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:45:47" (1/3) ... [2018-11-23 03:45:48,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d43dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:48, skipping insertion in model container [2018-11-23 03:45:48,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:45:47" (2/3) ... [2018-11-23 03:45:48,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d43dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:48, skipping insertion in model container [2018-11-23 03:45:48,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:48" (3/3) ... [2018-11-23 03:45:48,019 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c [2018-11-23 03:45:48,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:45:48,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 03:45:48,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 03:45:48,056 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:45:48,057 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:45:48,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:45:48,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:45:48,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:45:48,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:45:48,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:45:48,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:45:48,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:45:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 03:45:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 03:45:48,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 257117704, now seen corresponding path program 1 times [2018-11-23 03:45:48,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:48,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:45:48,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:45:48,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:45:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:45:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:45:48,166 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 03:45:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:45:48,178 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-11-23 03:45:48,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:45:48,179 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-23 03:45:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:45:48,186 INFO L225 Difference]: With dead ends: 53 [2018-11-23 03:45:48,186 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:45:48,189 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 03:45:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:45:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 03:45:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:45:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 03:45:48,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2018-11-23 03:45:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:45:48,213 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 03:45:48,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:45:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 03:45:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:45:48,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,214 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2018510573, now seen corresponding path program 1 times [2018-11-23 03:45:48,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:48,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:45:48,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:45:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:45:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:45:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:45:48,254 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 03:45:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:45:48,272 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 03:45:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:45:48,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 03:45:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:45:48,274 INFO L225 Difference]: With dead ends: 24 [2018-11-23 03:45:48,274 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 03:45:48,274 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 03:45:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 03:45:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 03:45:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:45:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 03:45:48,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2018-11-23 03:45:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:45:48,278 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 03:45:48,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:45:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 03:45:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:45:48,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2018510518, now seen corresponding path program 1 times [2018-11-23 03:45:48,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:48,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:45:48,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:45:48,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:45:48,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:45:48,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:45:48,305 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 03:45:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:45:48,351 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 03:45:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:45:48,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 03:45:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:45:48,352 INFO L225 Difference]: With dead ends: 38 [2018-11-23 03:45:48,352 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 03:45:48,353 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 03:45:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 03:45:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 03:45:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 03:45:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-11-23 03:45:48,357 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 10 [2018-11-23 03:45:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:45:48,357 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-23 03:45:48,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:45:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2018-11-23 03:45:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:45:48,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,358 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1850681747, now seen corresponding path program 1 times [2018-11-23 03:45:48,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:48,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:45:48,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:45:48,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:45:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:45:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:45:48,390 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 3 states. [2018-11-23 03:45:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:45:48,396 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-11-23 03:45:48,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:45:48,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 03:45:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:45:48,397 INFO L225 Difference]: With dead ends: 34 [2018-11-23 03:45:48,397 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 03:45:48,397 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 03:45:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 03:45:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 03:45:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 03:45:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-11-23 03:45:48,400 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 11 [2018-11-23 03:45:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:45:48,400 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-23 03:45:48,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:45:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 03:45:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:45:48,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1850683445, now seen corresponding path program 1 times [2018-11-23 03:45:48,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:45:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:45:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:45:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:45:48,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:45:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:45:48,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:45:48,425 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 4 states. [2018-11-23 03:45:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:45:48,490 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2018-11-23 03:45:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:45:48,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 03:45:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:45:48,491 INFO L225 Difference]: With dead ends: 54 [2018-11-23 03:45:48,491 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 03:45:48,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:45:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 03:45:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 03:45:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 03:45:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-11-23 03:45:48,496 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 11 [2018-11-23 03:45:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:45:48,497 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-11-23 03:45:48,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:45:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-11-23 03:45:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 03:45:48,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:45:48,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:45:48,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 03:45:48,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:45:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -120754312, now seen corresponding path program 1 times [2018-11-23 03:45:48,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:45:48,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:45:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:45:48,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:45:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:45:48,524 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #70#return; [?] CALL call #t~ret7 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume !!(~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] #t~short4 := ~y~0 >= 0; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647, |main_#t~short4|=true] [?] assume #t~short4;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;#t~short4 := 0 != #t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647, |main_#t~nondet3|=0, |main_#t~short4|=false] [?] assume !#t~short4;havoc #t~nondet3;havoc #t~short4; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] #t~short6 := ~y~0 <= ~n~0; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647, |main_#t~short6|=true] [?] assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647, |main_#t~nondet5|=1, |main_#t~short6|=true] [?] assume !!#t~short6;havoc #t~nondet5;havoc #t~short6; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] assume !(1 + ~y~0 <= 2147483647); VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] assume !!(~x~0 >= 0); VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] assume #t~short4; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] assume !#t~short4; [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] assume #t~short6; [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] assume !!#t~short6; [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] assume !!(~x~0 >= 0); VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] assume #t~short4; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] assume !#t~short4; [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] assume #t~short6; [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] assume !!#t~short6; [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 VAL [n=2147483647, x=0, y=2147483647] [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=0, n=2147483647, x=0, y=2147483647, y >= 0 && __VERIFIER_nondet_int() != 0=0] [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 VAL [n=2147483647, x=-1, y=2147483647] [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, n=2147483647, x=-1, y=2147483647, y <= n && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 VAL [n=2147483647, x=-1, y=2147483647] ----- [2018-11-23 03:45:48,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:45:48 BoogieIcfgContainer [2018-11-23 03:45:48,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:45:48,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:45:48,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:45:48,549 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:45:48,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:48" (3/4) ... [2018-11-23 03:45:48,552 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 #70#return; [?] CALL call #t~ret7 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~n~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume !!(~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] #t~short4 := ~y~0 >= 0; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647, |main_#t~short4|=true] [?] assume #t~short4;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;#t~short4 := 0 != #t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647, |main_#t~nondet3|=0, |main_#t~short4|=false] [?] assume !#t~short4;havoc #t~nondet3;havoc #t~short4; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [?] assume ~x~0 - 1 >= -2147483648;~x~0 := ~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] #t~short6 := ~y~0 <= ~n~0; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647, |main_#t~short6|=true] [?] assume #t~short6;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;#t~short6 := 0 != #t~nondet5; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647, |main_#t~nondet5|=1, |main_#t~short6|=true] [?] assume !!#t~short6;havoc #t~nondet5;havoc #t~short6; VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] assume !(1 + ~y~0 <= 2147483647); VAL [main_~n~0=2147483647, main_~x~0=(- 1), main_~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] assume !!(~x~0 >= 0); VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] assume #t~short4; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] assume !#t~short4; [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] assume #t~short6; [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] assume !!#t~short6; [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] assume !!(~x~0 >= 0); VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] assume #t~short4; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] assume !#t~short4; [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] assume #t~short6; [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] assume !!#t~short6; [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret7 := main(); [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L18-L26] COND FALSE !(!(~x~0 >= 0)) VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] #t~short4 := ~y~0 >= 0; VAL [#t~short4=true, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; VAL [#t~nondet3=0, #t~short4=false, ~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~nondet3; [L19] havoc #t~short4; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 <= 2147483647; VAL [~n~0=2147483647, ~x~0=0, ~y~0=2147483647] [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] #t~short6 := ~y~0 <= ~n~0; VAL [#t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; VAL [#t~nondet5=1, #t~short6=true, ~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L24] assert 1 + ~y~0 <= 2147483647; VAL [~n~0=2147483647, ~x~0=-1, ~y~0=2147483647] [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 VAL [n=2147483647, x=0, y=2147483647] [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=0, n=2147483647, x=0, y=2147483647, y >= 0 && __VERIFIER_nondet_int() != 0=0] [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 VAL [n=2147483647, x=-1, y=2147483647] [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, n=2147483647, x=-1, y=2147483647, y <= n && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 VAL [n=2147483647, x=-1, y=2147483647] ----- [2018-11-23 03:45:48,587 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_19a6134e-6891-426c-bb06-a1b8c06423d7/bin-2019/uautomizer/witness.graphml [2018-11-23 03:45:48,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:45:48,588 INFO L168 Benchmark]: Toolchain (without parser) took 967.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:45:48,589 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:45:48,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.21 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:45:48,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.08 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:45:48,590 INFO L168 Benchmark]: Boogie Preprocessor took 14.57 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:45:48,590 INFO L168 Benchmark]: RCFGBuilder took 195.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:45:48,591 INFO L168 Benchmark]: TraceAbstraction took 535.05 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:45:48,591 INFO L168 Benchmark]: Witness Printer took 38.28 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 03:45:48,593 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.21 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 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.08 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.57 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 535.05 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: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.28 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: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 VAL [n=2147483647, x=0, y=2147483647] [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=0, n=2147483647, x=0, y=2147483647, y >= 0 && __VERIFIER_nondet_int() != 0=0] [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 VAL [n=2147483647, x=-1, y=2147483647] [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 VAL [__VERIFIER_nondet_int()=1, n=2147483647, x=-1, y=2147483647, y <= n && __VERIFIER_nondet_int() != 0=1] [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 VAL [n=2147483647, x=-1, y=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 6 error locations. UNSAFE Result, 0.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 67 SDslu, 44 SDs, 0 SdLazy, 43 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...