./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-numeric/MultCommutative_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_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/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 a7af5709195f6c1eec73f2559f8e654af4840835 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:32:37,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:32:37,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:32:37,844 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:32:37,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:32:37,845 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:32:37,846 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:32:37,847 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:32:37,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:32:37,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:32:37,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:32:37,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:32:37,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:32:37,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:32:37,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:32:37,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:32:37,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:32:37,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:32:37,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:32:37,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:32:37,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:32:37,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:32:37,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:32:37,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:32:37,860 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:32:37,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:32:37,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:32:37,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:32:37,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:32:37,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:32:37,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:32:37,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:32:37,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:32:37,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:32:37,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:32:37,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:32:37,865 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 12:32:37,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:32:37,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:32:37,876 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:32:37,876 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:32:37,876 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:32:37,877 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:32:37,877 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:32:37,878 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:32:37,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:32:37,878 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 12:32:37,879 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:32:37,880 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:32:37,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:32:37,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:32:37,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:32:37,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:32:37,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:32:37,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:32:37,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:32:37,882 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:32:37,882 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_502d3a96-7065-42dd-b6d4-2532c480fe28/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 -> a7af5709195f6c1eec73f2559f8e654af4840835 [2018-11-23 12:32:37,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:32:37,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:32:37,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:32:37,919 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:32:37,919 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:32:37,920 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/../../sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 12:32:37,965 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/data/8579d51f4/d1f58c6a7c2e41728077bedcb8fb36c6/FLAG2db446873 [2018-11-23 12:32:38,360 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:32:38,360 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/sv-benchmarks/c/termination-numeric/MultCommutative_false-no-overflow.c [2018-11-23 12:32:38,364 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/data/8579d51f4/d1f58c6a7c2e41728077bedcb8fb36c6/FLAG2db446873 [2018-11-23 12:32:38,373 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/data/8579d51f4/d1f58c6a7c2e41728077bedcb8fb36c6 [2018-11-23 12:32:38,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:32:38,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:32:38,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:32:38,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:32:38,381 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:32:38,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab0a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38, skipping insertion in model container [2018-11-23 12:32:38,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:32:38,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:32:38,535 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:32:38,537 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:32:38,548 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:32:38,558 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:32:38,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38 WrapperNode [2018-11-23 12:32:38,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:32:38,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:32:38,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:32:38,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:32:38,565 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:32:38" (1/1) ... [2018-11-23 12:32:38,568 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:32:38" (1/1) ... [2018-11-23 12:32:38,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:32:38,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:32:38,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:32:38,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:32:38,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... [2018-11-23 12:32:38,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:32:38,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:32:38,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:32:38,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:32:38,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/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:32:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:32:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:32:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-23 12:32:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-23 12:32:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:32:38,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:32:38,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:32:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:32:38,780 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:32:38,780 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:32:38,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:38 BoogieIcfgContainer [2018-11-23 12:32:38,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:32:38,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:32:38,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:32:38,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:32:38,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:32:38" (1/3) ... [2018-11-23 12:32:38,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29143a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:38, skipping insertion in model container [2018-11-23 12:32:38,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:32:38" (2/3) ... [2018-11-23 12:32:38,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29143a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:32:38, skipping insertion in model container [2018-11-23 12:32:38,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:38" (3/3) ... [2018-11-23 12:32:38,786 INFO L112 eAbstractionObserver]: Analyzing ICFG MultCommutative_false-no-overflow.c [2018-11-23 12:32:38,793 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:32:38,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 12:32:38,810 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 12:32:38,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:32:38,834 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:32:38,834 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:32:38,834 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:32:38,834 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:32:38,834 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:32:38,835 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:32:38,835 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:32:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 12:32:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:32:38,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:38,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:38,855 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:38,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1930860990, now seen corresponding path program 1 times [2018-11-23 12:32:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:38,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:38,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:38,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:38,980 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:32:38,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:32:38,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:38,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:38,993 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-11-23 12:32:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,105 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2018-11-23 12:32:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:32:39,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 12:32:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,113 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:32:39,113 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:32:39,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:32:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:32:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-23 12:32:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:32:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:32:39,142 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2018-11-23 12:32:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,143 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:32:39,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:32:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 12:32:39,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -272844401, now seen corresponding path program 1 times [2018-11-23 12:32:39,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,201 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:32:39,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:39,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:32:39,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:39,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:39,204 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 5 states. [2018-11-23 12:32:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,270 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-23 12:32:39,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:32:39,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 12:32:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,271 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:32:39,271 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:32:39,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:32:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:32:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-11-23 12:32:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:32:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2018-11-23 12:32:39,280 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 12 [2018-11-23 12:32:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,280 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2018-11-23 12:32:39,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 12:32:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:32:39,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,281 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 757868177, now seen corresponding path program 1 times [2018-11-23 12:32:39,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:39,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:32:39,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:39,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:39,330 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 5 states. [2018-11-23 12:32:39,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,424 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-23 12:32:39,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:32:39,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:32:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,425 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:32:39,425 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:32:39,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:32:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:32:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-11-23 12:32:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:32:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-23 12:32:39,436 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 17 [2018-11-23 12:32:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,436 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-23 12:32:39,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-23 12:32:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:32:39,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,437 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,437 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 809703757, now seen corresponding path program 1 times [2018-11-23 12:32:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:39,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:39,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:32:39,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:39,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:39,466 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 5 states. [2018-11-23 12:32:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,506 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-23 12:32:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:32:39,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 12:32:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,507 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:32:39,508 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:32:39,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:32:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:32:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2018-11-23 12:32:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:32:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2018-11-23 12:32:39,517 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 18 [2018-11-23 12:32:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,517 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2018-11-23 12:32:39,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2018-11-23 12:32:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:32:39,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,518 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,518 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,518 INFO L82 PathProgramCache]: Analyzing trace with hash -668980256, now seen corresponding path program 1 times [2018-11-23 12:32:39,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:39,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:39,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:32:39,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:39,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:39,550 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2018-11-23 12:32:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,622 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2018-11-23 12:32:39,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:32:39,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:32:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,623 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:32:39,623 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 12:32:39,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:32:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 12:32:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-11-23 12:32:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 12:32:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2018-11-23 12:32:39,633 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 19 [2018-11-23 12:32:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,633 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2018-11-23 12:32:39,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-23 12:32:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:32:39,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,634 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2531206, now seen corresponding path program 1 times [2018-11-23 12:32:39,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:32:39,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:32:39,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:32:39,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:32:39,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:32:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:32:39,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:32:39,663 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 5 states. [2018-11-23 12:32:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:39,695 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2018-11-23 12:32:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:32:39,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-23 12:32:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:39,696 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:32:39,696 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:32:39,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:32:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:32:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-23 12:32:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:32:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-23 12:32:39,703 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-11-23 12:32:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:39,703 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-23 12:32:39,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:32:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-23 12:32:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:32:39,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:39,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:39,705 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:39,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash -484323025, now seen corresponding path program 1 times [2018-11-23 12:32:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:39,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:39,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:39,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:32:39,762 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-23 12:32:39,763 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [52], [53], [54], [55], [56], [58] [2018-11-23 12:32:39,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:32:39,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:32:39,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:32:39,888 INFO L272 AbstractInterpreter]: Visited 19 different actions 49 times. Never merged. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 3. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-23 12:32:39,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:39,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:32:39,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:39,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:39,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:39,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:32:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:39,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:32:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:39,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:32:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:40,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:32:40,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-11-23 12:32:40,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:32:40,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:32:40,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:32:40,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:32:40,001 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-11-23 12:32:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:40,078 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 12:32:40,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:32:40,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 12:32:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:40,079 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:32:40,079 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:32:40,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:32:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:32:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-23 12:32:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:32:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-23 12:32:40,085 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-11-23 12:32:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:40,086 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-23 12:32:40,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:32:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 12:32:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:32:40,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:40,087 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:40,087 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:40,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2129111832, now seen corresponding path program 1 times [2018-11-23 12:32:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:40,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:32:40,121 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-23 12:32:40,121 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [23], [24], [26], [30], [34], [38], [52], [53], [54], [55], [56], [58] [2018-11-23 12:32:40,122 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:32:40,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:32:40,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:32:40,157 INFO L272 AbstractInterpreter]: Visited 20 different actions 52 times. Never merged. Never widened. Performed 130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-23 12:32:40,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:32:40,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:40,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:32:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:32:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:40,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:32:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:32:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:32:40,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-11-23 12:32:40,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:32:40,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:32:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:32:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:32:40,240 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 7 states. [2018-11-23 12:32:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:40,284 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 12:32:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:32:40,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:32:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:40,285 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:32:40,285 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:32:40,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:32:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:32:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 12:32:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:32:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-23 12:32:40,291 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-11-23 12:32:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:40,292 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-23 12:32:40,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:32:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-11-23 12:32:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:32:40,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:40,293 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:40,294 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:40,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1178899970, now seen corresponding path program 1 times [2018-11-23 12:32:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:32:40,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:32:40,344 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-23 12:32:40,344 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [22], [26], [30], [34], [38], [40], [52], [53], [54], [55], [56], [58], [59], [60] [2018-11-23 12:32:40,346 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:32:40,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:32:40,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:32:40,399 INFO L272 AbstractInterpreter]: Visited 22 different actions 93 times. Never merged. Never widened. Performed 240 root evaluator evaluations with a maximum evaluation depth of 3. Performed 240 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-23 12:32:40,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:32:40,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:32:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:32:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:32:40,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:32:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:32:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:32:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2018-11-23 12:32:40,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:32:40,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:32:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:32:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:32:40,582 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-11-23 12:32:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:40,731 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-11-23 12:32:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:32:40,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 12:32:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:40,732 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:32:40,732 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:32:40,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:32:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:32:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-11-23 12:32:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:32:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-11-23 12:32:40,738 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 28 [2018-11-23 12:32:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:40,738 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-11-23 12:32:40,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:32:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-11-23 12:32:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:32:40,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:40,740 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:40,740 INFO L423 AbstractCegarLoop]: === Iteration 10 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:40,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2108806649, now seen corresponding path program 1 times [2018-11-23 12:32:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:32:40,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:32:40,778 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-23 12:32:40,778 INFO L202 CegarAbsIntRunner]: [0], [1], [11], [14], [15], [17], [19], [21], [23], [24], [26], [30], [34], [38], [40], [52], [53], [54], [55], [56], [58], [59], [60] [2018-11-23 12:32:40,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:32:40,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:32:40,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:32:40,821 INFO L272 AbstractInterpreter]: Visited 23 different actions 99 times. Never merged. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 4. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-23 12:32:40,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:32:40,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:40,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:40,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:32:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:40,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:32:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:32:40,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:32:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 12:32:40,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 12:32:40,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-11-23 12:32:40,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 12:32:40,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:32:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:32:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:32:40,879 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 7 states. [2018-11-23 12:32:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:40,929 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-23 12:32:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:32:40,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 12:32:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:40,930 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:32:40,931 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:32:40,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:32:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:32:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 12:32:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:32:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-23 12:32:40,935 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 29 [2018-11-23 12:32:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-23 12:32:40,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:32:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 12:32:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:32:40,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:40,937 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:40,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:32:40,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash -880204174, now seen corresponding path program 1 times [2018-11-23 12:32:40,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:32:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:32:40,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:40,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:32:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:32:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:32:40,967 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #55#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=1073741824] [?] assume !(~m~0 < 0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=1073741824, main_~n~0=2] [?] assume !(~n~0 < 0); VAL [main_~m~0=1073741824, main_~n~0=2] [?] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [|mult_#in~m|=2, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] RET #53#return; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] assume true; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] RET #53#return; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] ----- [2018-11-23 12:32:40,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:32:40 BoogieIcfgContainer [2018-11-23 12:32:40,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:32:40,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:32:40,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:32:40,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:32:40,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:32:38" (3/4) ... [2018-11-23 12:32:40,999 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 #55#return; [?] CALL call #t~ret6 := main(); [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~m~0=1073741824] [?] assume !(~m~0 < 0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~m~0=1073741824, main_~n~0=2] [?] assume !(~n~0 < 0); VAL [main_~m~0=1073741824, main_~n~0=2] [?] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [|mult_#in~m|=2, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=1, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume !(0 == ~m); VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] assume ~m - 1 >= -2147483648; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824] [?] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [|mult_#in~m|=0, |mult_#in~n|=1073741824] [?] ~n := #in~n;~m := #in~m; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume !(~m < 0); VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824] [?] assume 0 == ~m;#res := 0; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] assume true; VAL [mult_~m=0, mult_~n=1073741824, |mult_#in~m|=0, |mult_#in~n|=1073741824, |mult_#res|=0] [?] RET #53#return; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 <= 2147483647; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#t~ret1|=0] [?] assume ~n + #t~ret1 >= -2147483648;#res := ~n + #t~ret1;havoc #t~ret1; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] assume true; VAL [mult_~m=1, mult_~n=1073741824, |mult_#in~m|=1, |mult_#in~n|=1073741824, |mult_#res|=1073741824] [?] RET #53#return; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] assume !(~n + #t~ret1 <= 2147483647); VAL [mult_~m=2, mult_~n=1073741824, |mult_#in~m|=2, |mult_#in~n|=1073741824, |mult_#t~ret1|=1073741824] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27-L29] assume !(~m~0 < 0); [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31-L33] assume !(~n~0 < 0); VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19-L21] assume !(0 == ~m); VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16-L18] assume !(~m < 0); VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19-L21] assume 0 == ~m; [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L15-L23] ensures true; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret6 := main(); [L26] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L26] ~m~0 := #t~nondet2; [L26] havoc #t~nondet2; VAL [~m~0=1073741824] [L27] COND FALSE !(~m~0 < 0) [L30] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L30] ~n~0 := #t~nondet3; [L30] havoc #t~nondet3; VAL [~m~0=1073741824, ~n~0=2] [L31] COND FALSE !(~n~0 < 0) VAL [~m~0=1073741824, ~n~0=2] [L34] CALL call #t~ret4 := mult(~m~0, ~n~0); VAL [#in~m=2, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=2, #in~n=1073741824, ~m=2, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L19] COND FALSE !(0 == ~m) VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] assert ~m - 1 >= -2147483648; VAL [#in~m=1, #in~n=1073741824, ~m=1, ~n=1073741824] [L22] CALL call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=0, #in~n=1073741824] [L15-L23] ~n := #in~n; [L15-L23] ~m := #in~m; VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L16] COND FALSE !(~m < 0) VAL [#in~m=0, #in~n=1073741824, ~m=0, ~n=1073741824] [L19] COND TRUE 0 == ~m [L20] #res := 0; VAL [#in~m=0, #in~n=1073741824, #res=0, ~m=0, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=1, #in~n=1073741824, #t~ret1=0, ~m=1, ~n=1073741824] [L22] assert ~n + #t~ret1 >= -2147483648; [L22] #res := ~n + #t~ret1; [L22] havoc #t~ret1; VAL [#in~m=1, #in~n=1073741824, #res=1073741824, ~m=1, ~n=1073741824] [L22] RET call #t~ret1 := mult(~n, ~m - 1); VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L22] assert ~n + #t~ret1 <= 2147483647; VAL [#in~m=2, #in~n=1073741824, #t~ret1=1073741824, ~m=2, ~n=1073741824] [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] ----- [2018-11-23 12:32:41,045 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_502d3a96-7065-42dd-b6d4-2532c480fe28/bin-2019/utaipan/witness.graphml [2018-11-23 12:32:41,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:32:41,046 INFO L168 Benchmark]: Toolchain (without parser) took 2670.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,047 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:32:41,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,048 INFO L168 Benchmark]: Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:32:41,049 INFO L168 Benchmark]: RCFGBuilder took 196.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -211.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,049 INFO L168 Benchmark]: TraceAbstraction took 2215.47 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: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,050 INFO L168 Benchmark]: Witness Printer took 48.42 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:32:41,052 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.45 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 196.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -211.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2215.47 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: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 11.5 GB. * Witness Printer took 48.42 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L26] int m = __VERIFIER_nondet_int(); [L27] COND FALSE !(m < 0) [L30] int n = __VERIFIER_nondet_int(); [L31] COND FALSE !(n < 0) VAL [m=1073741824, n=2] [L34] CALL mult(m, n) VAL [\old(m)=2, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=2, \old(n)=1073741824, m=2, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L19] COND FALSE !(m == 0) VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] EXPR m - 1 VAL [\old(m)=1, \old(n)=1073741824, m=1, n=1073741824] [L22] CALL, EXPR mult(n, m - 1) VAL [\old(m)=0, \old(n)=1073741824] [L16] COND FALSE !(m < 0) VAL [\old(m)=0, \old(n)=1073741824, m=0, n=1073741824] [L19] COND TRUE m == 0 [L20] return 0; VAL [\old(m)=0, \old(n)=1073741824, \result=0, m=0, n=1073741824] [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=1, \old(n)=1073741824, m=1, mult(n, m - 1)=0, n=1073741824] [L22] EXPR n + mult(n, m - 1) [L22] return n + mult(n, m - 1); [L22] RET, EXPR mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] [L22] n + mult(n, m - 1) VAL [\old(m)=2, \old(n)=1073741824, m=2, mult(n, m - 1)=1073741824, n=1073741824] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 6 error locations. UNSAFE Result, 2.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 311 SDslu, 748 SDs, 0 SdLazy, 596 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 191 SyntacticMatches, 17 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 19117 SizeOfPredicates, 12 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 50/98 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...