./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/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 554582d6fc3de8e87f5dd30e5019302b6e1b96be ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:21:08,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:08,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:08,240 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:08,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:08,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:08,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:08,243 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:08,244 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:08,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:08,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:08,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:08,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:08,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:08,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:08,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:08,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:08,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:08,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:08,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:08,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:08,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:08,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:08,255 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:08,255 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:08,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:08,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:08,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:08,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:08,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:08,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:08,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:08,260 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:08,260 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:08,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:08,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:08,261 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-18 12:21:08,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:08,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:08,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:21:08,272 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:21:08,273 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:21:08,273 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:21:08,274 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:21:08,274 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:21:08,274 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:08,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:21:08,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:08,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:21:08,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:08,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:08,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:21:08,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:21:08,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:21:08,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:08,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:21:08,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:21:08,277 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:21:08,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:21:08,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:21:08,277 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:21:08,277 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_d75421bf-82e1-4fdb-8568-bd39064792c3/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 -> 554582d6fc3de8e87f5dd30e5019302b6e1b96be [2018-11-18 12:21:08,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:08,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:08,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:08,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:08,310 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:08,311 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-18 12:21:08,355 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/data/131b45984/03147961cf8b46ecb69ae87d112dd479/FLAG8f030d00b [2018-11-18 12:21:08,751 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:08,751 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-18 12:21:08,755 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/data/131b45984/03147961cf8b46ecb69ae87d112dd479/FLAG8f030d00b [2018-11-18 12:21:08,764 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/data/131b45984/03147961cf8b46ecb69ae87d112dd479 [2018-11-18 12:21:08,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:08,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:21:08,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:08,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:08,770 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:08,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399b9200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08, skipping insertion in model container [2018-11-18 12:21:08,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:08,788 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:08,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:08,892 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:08,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:08,909 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:08,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08 WrapperNode [2018-11-18 12:21:08,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:08,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:08,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:21:08,910 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:21:08,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:08,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:08,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:08,922 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:08,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... [2018-11-18 12:21:08,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:08,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:08,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:08,934 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:08,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/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-18 12:21:09,012 INFO L130 BoogieDeclarations]: Found specification of procedure p [2018-11-18 12:21:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2018-11-18 12:21:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:21:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:21:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:09,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:21:09,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:21:09,133 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:09,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:09 BoogieIcfgContainer [2018-11-18 12:21:09,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:09,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:21:09,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:21:09,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:21:09,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:21:08" (1/3) ... [2018-11-18 12:21:09,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173ae2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:09, skipping insertion in model container [2018-11-18 12:21:09,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:08" (2/3) ... [2018-11-18 12:21:09,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173ae2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:21:09, skipping insertion in model container [2018-11-18 12:21:09,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:09" (3/3) ... [2018-11-18 12:21:09,139 INFO L112 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex4_true-termination_true-no-overflow.c [2018-11-18 12:21:09,144 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:21:09,149 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-18 12:21:09,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-18 12:21:09,178 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:21:09,179 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:21:09,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:21:09,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:09,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:09,179 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:21:09,179 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:09,179 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:21:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 12:21:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 12:21:09,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1909339610, now seen corresponding path program 1 times [2018-11-18 12:21:09,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,333 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-18 12:21:09,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:09,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:21:09,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:09,354 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-18 12:21:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:09,468 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-18 12:21:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:21:09,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-18 12:21:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:09,477 INFO L225 Difference]: With dead ends: 49 [2018-11-18 12:21:09,477 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 12:21:09,480 INFO L604 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-18 12:21:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 12:21:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-11-18 12:21:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 12:21:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 12:21:09,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2018-11-18 12:21:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:09,507 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 12:21:09,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 12:21:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 12:21:09,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash 940014271, now seen corresponding path program 1 times [2018-11-18 12:21:09,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:09,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,544 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-18 12:21:09,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:09,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:21:09,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:21:09,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:09,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:09,546 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-18 12:21:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:09,568 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 12:21:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:09,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 12:21:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:09,569 INFO L225 Difference]: With dead ends: 23 [2018-11-18 12:21:09,569 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 12:21:09,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 12:21:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 12:21:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:21:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 12:21:09,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2018-11-18 12:21:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:09,574 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 12:21:09,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 12:21:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 12:21:09,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,574 INFO L423 AbstractCegarLoop]: === Iteration 3 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash 940021254, now seen corresponding path program 1 times [2018-11-18 12:21:09,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,626 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-18 12:21:09,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:09,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:09,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:21:09,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:09,627 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2018-11-18 12:21:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:09,689 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-18 12:21:09,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:21:09,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 12:21:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:09,690 INFO L225 Difference]: With dead ends: 34 [2018-11-18 12:21:09,690 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 12:21:09,690 INFO L604 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-18 12:21:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 12:21:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-11-18 12:21:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 12:21:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 12:21:09,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2018-11-18 12:21:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:09,695 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 12:21:09,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 12:21:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 12:21:09,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash -924112151, now seen corresponding path program 1 times [2018-11-18 12:21:09,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,736 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-18 12:21:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:09,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:21:09,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:21:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:21:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:21:09,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:09,737 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-18 12:21:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:09,743 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 12:21:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:21:09,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 12:21:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:09,744 INFO L225 Difference]: With dead ends: 28 [2018-11-18 12:21:09,744 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 12:21:09,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:21:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 12:21:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-18 12:21:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 12:21:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 12:21:09,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 12 [2018-11-18 12:21:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:09,748 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 12:21:09,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:21:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 12:21:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:21:09,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:09,749 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:09,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:09,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1638077220, now seen corresponding path program 1 times [2018-11-18 12:21:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:09,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,794 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-18 12:21:09,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:09,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:21:09,795 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-18 12:21:09,796 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [5], [7], [22], [26], [29], [37], [41], [42], [43], [45] [2018-11-18 12:21:09,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:21:09,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:21:09,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:21:09,904 INFO L272 AbstractInterpreter]: Visited 13 different actions 31 times. Never merged. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 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-18 12:21:09,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:09,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:21:09,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:09,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/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-18 12:21:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:09,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:21:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:09,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:09,947 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-18 12:21:09,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:21:10,008 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-18 12:21:10,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:21:10,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-18 12:21:10,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:21:10,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:10,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:10,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:21:10,026 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2018-11-18 12:21:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:10,110 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-18 12:21:10,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:21:10,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-18 12:21:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:10,111 INFO L225 Difference]: With dead ends: 49 [2018-11-18 12:21:10,111 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 12:21:10,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-18 12:21:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 12:21:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2018-11-18 12:21:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 12:21:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-18 12:21:10,116 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 15 [2018-11-18 12:21:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:10,116 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-18 12:21:10,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-18 12:21:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:21:10,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:10,117 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:10,117 INFO L423 AbstractCegarLoop]: === Iteration 6 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:10,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 759220752, now seen corresponding path program 1 times [2018-11-18 12:21:10,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:10,140 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-18 12:21:10,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:21:10,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:21:10,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:21:10,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:21:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:21:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:21:10,141 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 5 states. [2018-11-18 12:21:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:10,210 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 12:21:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:21:10,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 12:21:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:10,212 INFO L225 Difference]: With dead ends: 45 [2018-11-18 12:21:10,212 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 12:21:10,215 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:21:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 12:21:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-18 12:21:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:21:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 12:21:10,220 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 16 [2018-11-18 12:21:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:10,221 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 12:21:10,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:21:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 12:21:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:21:10,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:10,221 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:10,222 INFO L423 AbstractCegarLoop]: === Iteration 7 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:10,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1204199228, now seen corresponding path program 1 times [2018-11-18 12:21:10,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:10,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:21:10,264 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-18 12:21:10,264 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [10], [13], [15], [17], [22], [26], [29], [39], [41], [42], [43], [45] [2018-11-18 12:21:10,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:21:10,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:21:10,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:21:10,294 INFO L272 AbstractInterpreter]: Visited 15 different actions 39 times. Never merged. Never widened. Performed 126 root evaluator evaluations with a maximum evaluation depth of 3. Performed 126 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-18 12:21:10,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:21:10,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:10,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/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-18 12:21:10,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:21:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:10,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:21:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:21:10,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-18 12:21:10,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:21:10,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:21:10,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:21:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:21:10,387 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 7 states. [2018-11-18 12:21:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:10,446 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-18 12:21:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:21:10,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-18 12:21:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:10,448 INFO L225 Difference]: With dead ends: 53 [2018-11-18 12:21:10,448 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 12:21:10,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:21:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 12:21:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2018-11-18 12:21:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 12:21:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-18 12:21:10,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 16 [2018-11-18 12:21:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:10,456 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-18 12:21:10,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:21:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-18 12:21:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 12:21:10,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:21:10,457 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:21:10,457 INFO L423 AbstractCegarLoop]: === Iteration 8 === [pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 12:21:10,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 745081830, now seen corresponding path program 2 times [2018-11-18 12:21:10,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:21:10,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:10,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:10,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:21:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:10,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:21:10,499 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 12:21:10,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 12:21:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:21:10,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/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-18 12:21:10,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 12:21:10,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 12:21:10,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 12:21:10,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:21:10,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:21:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:10,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:21:10,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2018-11-18 12:21:10,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:21:10,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 12:21:10,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 12:21:10,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:21:10,719 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 12 states. [2018-11-18 12:21:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:21:10,997 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-11-18 12:21:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 12:21:10,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-18 12:21:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:21:10,998 INFO L225 Difference]: With dead ends: 136 [2018-11-18 12:21:10,998 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 12:21:11,000 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 12:21:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 12:21:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 12:21:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 12:21:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 12:21:11,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-18 12:21:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:21:11,001 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:11,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 12:21:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:21:11,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 12:21:11,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 12:21:11,349 INFO L425 ceAbstractionStarter]: For program point pErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-18 12:21:11,351 INFO L425 ceAbstractionStarter]: For program point pErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point pErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point pErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point pEXIT(lines 12 22) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-18 12:21:11,352 INFO L428 ceAbstractionStarter]: At program point pENTRY(lines 12 22) the Hoare annotation is: true [2018-11-18 12:21:11,353 INFO L421 ceAbstractionStarter]: At program point L17-2(line 17) the Hoare annotation is: (let ((.cse0 (< 2147483647 |p_#in~m|)) (.cse1 (< 2147483647 |p_#in~r|))) (and (or (<= p_~n 2147483646) (< 2147483646 |p_#in~n|) .cse0 .cse1) (or (< 2147483647 |p_#in~n|) .cse0 (and (<= p_~n 2147483647) (<= p_~m 2147483647) (<= p_~r 2147483646) (<= 1 p_~n)) .cse1))) [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-18 12:21:11,353 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (< 2147483647 |p_#in~n|)) (.cse1 (< 2147483647 |p_#in~m|)) (.cse2 (< 2147483647 |p_#in~r|))) (and (or (and (<= p_~n 2147483647) (<= 1 p_~r) (<= p_~m 2147483647) (<= p_~r 2147483647)) .cse0 .cse1 .cse2) (or .cse0 (<= p_~r 2147483646) .cse1 (< 2147483646 |p_#in~r|)) (or (< 2147483646 |p_#in~n|) .cse1 (<= p_~n 2147483646) .cse2))) [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-18 12:21:11,353 INFO L425 ceAbstractionStarter]: For program point pFINAL(lines 12 22) no Hoare annotation was computed. [2018-11-18 12:21:11,354 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 12:21:11,354 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:21:11,354 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 12:21:11,354 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 12:21:11,355 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 12:21:11,355 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 12:21:11,355 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2018-11-18 12:21:11,355 INFO L421 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= main_~m~0 2147483647) (<= main_~r~0 2147483647)) [2018-11-18 12:21:11,355 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 24 32) no Hoare annotation was computed. [2018-11-18 12:21:11,356 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-18 12:21:11,356 INFO L425 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-11-18 12:21:11,356 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2018-11-18 12:21:11,356 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 24 32) no Hoare annotation was computed. [2018-11-18 12:21:11,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:21:11 BoogieIcfgContainer [2018-11-18 12:21:11,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:21:11,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:21:11,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:21:11,359 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:21:11,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:09" (3/4) ... [2018-11-18 12:21:11,363 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 12:21:11,367 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure p [2018-11-18 12:21:11,367 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 12:21:11,367 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 12:21:11,371 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 12:21:11,371 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 12:21:11,371 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 12:21:11,405 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d75421bf-82e1-4fdb-8568-bd39064792c3/bin-2019/utaipan/witness.graphml [2018-11-18 12:21:11,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:21:11,406 INFO L168 Benchmark]: Toolchain (without parser) took 2639.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 954.8 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:11,407 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:11,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.81 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 942.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:11,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.68 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:11,408 INFO L168 Benchmark]: Boogie Preprocessor took 11.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:11,408 INFO L168 Benchmark]: RCFGBuilder took 199.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:11,409 INFO L168 Benchmark]: TraceAbstraction took 2224.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.3 MB). Peak memory consumption was 340.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:11,409 INFO L168 Benchmark]: Witness Printer took 46.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:11,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.81 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 942.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.68 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.9 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2224.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.3 MB). Peak memory consumption was 340.3 MB. Max. memory is 11.5 GB. * Witness Printer took 46.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 4 error locations. SAFE Result, 2.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 160 SDtfs, 206 SDslu, 327 SDs, 0 SdLazy, 421 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 92 PreInvPairs, 92 NumberOfFragments, 117 HoareAnnotationTreeSize, 92 FomulaSimplifications, 3427 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 708 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 6797 SizeOfPredicates, 10 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 14/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...