./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 11:54:08,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:54:08,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:54:08,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:54:08,261 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:54:08,262 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:54:08,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:54:08,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:54:08,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:54:08,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:54:08,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:54:08,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:54:08,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:54:08,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:54:08,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:54:08,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:54:08,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:54:08,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:54:08,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:54:08,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:54:08,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:54:08,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:54:08,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:54:08,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:54:08,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:54:08,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:54:08,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:54:08,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:54:08,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:54:08,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:54:08,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:54:08,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:54:08,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:54:08,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:54:08,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:54:08,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:54:08,282 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 11:54:08,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:54:08,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:54:08,291 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 11:54:08,291 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 11:54:08,291 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 11:54:08,292 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 11:54:08,292 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 11:54:08,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:54:08,292 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 11:54:08,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:54:08,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 11:54:08,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:54:08,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:54:08,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 11:54:08,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 11:54:08,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 11:54:08,295 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_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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 -> 7c87c9e4b733dad657e6ff9e27a5e9b26a2c3764 [2018-12-02 11:54:08,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:54:08,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:54:08,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:54:08,328 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:54:08,328 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:54:08,329 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 11:54:08,376 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/data/24e947bc7/404462bec45a4227b663c8182e550277/FLAGc052545a7 [2018-12-02 11:54:08,706 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:54:08,707 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/sv-benchmarks/c/termination-crafted/MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 11:54:08,710 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/data/24e947bc7/404462bec45a4227b663c8182e550277/FLAGc052545a7 [2018-12-02 11:54:08,718 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/data/24e947bc7/404462bec45a4227b663c8182e550277 [2018-12-02 11:54:08,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:54:08,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:54:08,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:54:08,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:54:08,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:54:08,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08, skipping insertion in model container [2018-12-02 11:54:08,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:54:08,738 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:54:08,818 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:54:08,820 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:54:08,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:54:08,836 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:54:08,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08 WrapperNode [2018-12-02 11:54:08,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:54:08,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:54:08,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:54:08,837 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:54:08,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:54:08,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:54:08,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:54:08,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:54:08,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... [2018-12-02 11:54:08,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:54:08,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:54:08,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:54:08,861 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:54:08,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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-12-02 11:54:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 11:54:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 11:54:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:54:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:54:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 11:54:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 11:54:09,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:54:09,009 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 11:54:09,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:54:09 BoogieIcfgContainer [2018-12-02 11:54:09,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:54:09,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 11:54:09,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 11:54:09,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 11:54:09,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:54:08" (1/3) ... [2018-12-02 11:54:09,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7184589e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:54:09, skipping insertion in model container [2018-12-02 11:54:09,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:54:08" (2/3) ... [2018-12-02 11:54:09,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7184589e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:54:09, skipping insertion in model container [2018-12-02 11:54:09,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:54:09" (3/3) ... [2018-12-02 11:54:09,014 INFO L112 eAbstractionObserver]: Analyzing ICFG MenloPark_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-02 11:54:09,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 11:54:09,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-02 11:54:09,034 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-02 11:54:09,052 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 11:54:09,053 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 11:54:09,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 11:54:09,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:54:09,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:54:09,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 11:54:09,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:54:09,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 11:54:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-02 11:54:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 11:54:09,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,069 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash -778806590, now seen corresponding path program 1 times [2018-12-02 11:54:09,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:54:09,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:54:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:54:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,167 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-02 11:54:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,197 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-02 11:54:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:54:09,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 11:54:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,204 INFO L225 Difference]: With dead ends: 35 [2018-12-02 11:54:09,204 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 11:54:09,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 11:54:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-02 11:54:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 11:54:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-02 11:54:09,226 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2018-12-02 11:54:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,227 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-02 11:54:09,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:54:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-02 11:54:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 11:54:09,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1626799533, now seen corresponding path program 1 times [2018-12-02 11:54:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:54:09,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:54:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:54:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:54:09,252 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2018-12-02 11:54:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,294 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-02 11:54:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:54:09,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-02 11:54:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,295 INFO L225 Difference]: With dead ends: 26 [2018-12-02 11:54:09,296 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 11:54:09,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:54:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 11:54:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-02 11:54:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 11:54:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-02 11:54:09,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 8 [2018-12-02 11:54:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,300 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-02 11:54:09,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:54:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-02 11:54:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 11:54:09,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,301 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1108821980, now seen corresponding path program 1 times [2018-12-02 11:54:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:54:09,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:54:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:54:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,324 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2018-12-02 11:54:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,349 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-02 11:54:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:54:09,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-02 11:54:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,350 INFO L225 Difference]: With dead ends: 24 [2018-12-02 11:54:09,350 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 11:54:09,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 11:54:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-02 11:54:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 11:54:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-02 11:54:09,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 9 [2018-12-02 11:54:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-02 11:54:09,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:54:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-02 11:54:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 11:54:09,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash -13742961, now seen corresponding path program 1 times [2018-12-02 11:54:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:54:09,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:54:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:54:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,376 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 3 states. [2018-12-02 11:54:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,392 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-02 11:54:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:54:09,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 11:54:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,393 INFO L225 Difference]: With dead ends: 24 [2018-12-02 11:54:09,393 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 11:54:09,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 11:54:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 11:54:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 11:54:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-02 11:54:09,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2018-12-02 11:54:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,395 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-02 11:54:09,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:54:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-02 11:54:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 11:54:09,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,396 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash -426031738, now seen corresponding path program 1 times [2018-12-02 11:54:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:54:09,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:54:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:54:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,412 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 3 states. [2018-12-02 11:54:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,424 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-12-02 11:54:09,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:54:09,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 11:54:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,425 INFO L225 Difference]: With dead ends: 26 [2018-12-02 11:54:09,425 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 11:54:09,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 11:54:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-02 11:54:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 11:54:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-02 11:54:09,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 11 [2018-12-02 11:54:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,428 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-02 11:54:09,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:54:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-02 11:54:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 11:54:09,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -322081935, now seen corresponding path program 1 times [2018-12-02 11:54:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:54:09,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 11:54:09,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:09,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:54:09,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:54:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,448 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2018-12-02 11:54:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,460 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-02 11:54:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:54:09,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 11:54:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,461 INFO L225 Difference]: With dead ends: 26 [2018-12-02 11:54:09,461 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 11:54:09,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:54:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 11:54:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 11:54:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 11:54:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-02 11:54:09,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2018-12-02 11:54:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,464 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-02 11:54:09,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:54:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-02 11:54:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 11:54:09,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,464 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,464 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash -283092845, now seen corresponding path program 1 times [2018-12-02 11:54:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:09,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:09,500 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-12-02 11:54:09,501 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [14], [15], [17], [19], [21], [23], [25], [31], [32], [33] [2018-12-02 11:54:09,519 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:54:09,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:54:09,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 11:54:09,603 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 8 different actions 8 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 4. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-02 11:54:09,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 11:54:09,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:09,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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-12-02 11:54:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 11:54:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:54:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:54:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:54:09,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-12-02 11:54:09,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:54:09,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 11:54:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 11:54:09,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:54:09,715 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 9 states. [2018-12-02 11:54:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,775 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-02 11:54:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:54:09,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-02 11:54:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,776 INFO L225 Difference]: With dead ends: 34 [2018-12-02 11:54:09,776 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 11:54:09,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-02 11:54:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 11:54:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-12-02 11:54:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 11:54:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-02 11:54:09,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2018-12-02 11:54:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,779 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-02 11:54:09,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 11:54:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-02 11:54:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 11:54:09,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,780 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,780 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -185943556, now seen corresponding path program 1 times [2018-12-02 11:54:09,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:09,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:09,805 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-12-02 11:54:09,806 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [16], [17], [19], [21], [23], [25], [31], [32], [33] [2018-12-02 11:54:09,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:54:09,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:54:09,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 11:54:09,835 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 8 different actions 8 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 4. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-02 11:54:09,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 11:54:09,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:09,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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-12-02 11:54:09,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 11:54:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:09,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:54:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:54:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:09,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:54:09,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2018-12-02 11:54:09,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:54:09,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:54:09,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:54:09,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 11:54:09,927 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-12-02 11:54:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:09,976 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-02 11:54:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:54:09,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-02 11:54:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:09,976 INFO L225 Difference]: With dead ends: 33 [2018-12-02 11:54:09,976 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 11:54:09,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:54:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 11:54:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-12-02 11:54:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 11:54:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-02 11:54:09,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2018-12-02 11:54:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:09,979 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-02 11:54:09,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:54:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-02 11:54:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 11:54:09,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:09,980 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:09,980 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:09,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1469282891, now seen corresponding path program 1 times [2018-12-02 11:54:09,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:09,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:09,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:10,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:10,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:10,001 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-02 11:54:10,002 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [18], [19], [21], [23], [25], [31], [32], [33] [2018-12-02 11:54:10,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 11:54:10,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 11:54:10,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 11:54:10,018 INFO L272 AbstractInterpreter]: Visited 13 different actions 21 times. Merged at 7 different actions 7 times. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 4. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-02 11:54:10,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:10,019 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 11:54:10,053 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-02 11:54:10,054 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 11:54:10,068 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-02 11:54:10,068 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 11:54:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 11:54:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-02 11:54:10,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:10,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:54:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:54:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:54:10,069 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 4 states. [2018-12-02 11:54:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:10,108 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-02 11:54:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:54:10,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-02 11:54:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:10,108 INFO L225 Difference]: With dead ends: 28 [2018-12-02 11:54:10,108 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 11:54:10,109 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:54:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 11:54:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 11:54:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 11:54:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-02 11:54:10,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2018-12-02 11:54:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:10,111 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-02 11:54:10,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:54:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-02 11:54:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 11:54:10,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:10,112 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:10,112 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:10,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -412918366, now seen corresponding path program 2 times [2018-12-02 11:54:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:54:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:10,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:10,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:10,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:10,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 11:54:10,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 11:54:10,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:10,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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-12-02 11:54:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 11:54:10,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 11:54:10,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 11:54:10,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:54:10,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:54:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:10,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:54:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:11,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:54:11,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2018-12-02 11:54:11,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:54:11,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 11:54:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 11:54:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-12-02 11:54:11,063 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2018-12-02 11:54:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:11,223 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-12-02 11:54:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 11:54:11,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-12-02 11:54:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:11,224 INFO L225 Difference]: With dead ends: 48 [2018-12-02 11:54:11,225 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 11:54:11,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-12-02 11:54:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 11:54:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-12-02 11:54:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 11:54:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-02 11:54:11,229 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-12-02 11:54:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:11,229 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-02 11:54:11,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 11:54:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-02 11:54:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 11:54:11,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:11,230 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:11,230 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:11,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 84432589, now seen corresponding path program 2 times [2018-12-02 11:54:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:11,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:54:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:11,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 11:54:11,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:11,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:11,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 11:54:11,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 11:54:11,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:11,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/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-12-02 11:54:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 11:54:11,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 11:54:11,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 11:54:11,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:54:11,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:54:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 11:54:11,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:54:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 11:54:11,324 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 11:54:11,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 11 [2018-12-02 11:54:11,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:54:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:54:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:54:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:54:11,325 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-12-02 11:54:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:11,351 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-02 11:54:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:54:11,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 11:54:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:11,352 INFO L225 Difference]: With dead ends: 44 [2018-12-02 11:54:11,352 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 11:54:11,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-02 11:54:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 11:54:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 11:54:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 11:54:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-02 11:54:11,355 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 22 [2018-12-02 11:54:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:11,355 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-02 11:54:11,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:54:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-02 11:54:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 11:54:11,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:54:11,356 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 11:54:11,356 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 11:54:11,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:54:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash -606346541, now seen corresponding path program 3 times [2018-12-02 11:54:11,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:54:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:11,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:54:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:54:11,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:54:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:54:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-02 11:54:11,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:11,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 11:54:11,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 11:54:11,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 11:54:11,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 11:54:11,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 11:54:11,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 11:54:11,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 11:54:11,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 11:54:11,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 11:54:11,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 11:54:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:11,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 11:54:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:54:15,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 11:54:15,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 14] total 36 [2018-12-02 11:54:15,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 11:54:15,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 11:54:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 11:54:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1039, Unknown=4, NotChecked=0, Total=1332 [2018-12-02 11:54:15,847 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2018-12-02 11:54:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:54:16,173 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-02 11:54:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 11:54:16,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-12-02 11:54:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:54:16,174 INFO L225 Difference]: With dead ends: 51 [2018-12-02 11:54:16,174 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 11:54:16,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=631, Invalid=2017, Unknown=4, NotChecked=0, Total=2652 [2018-12-02 11:54:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 11:54:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 11:54:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 11:54:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 11:54:16,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-02 11:54:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:54:16,176 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 11:54:16,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 11:54:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 11:54:16,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 11:54:16,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 11:54:16,241 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 11:54:16,241 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 16 28) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-12-02 11:54:16,241 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 16 28) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 16 28) the Hoare annotation is: true [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-12-02 11:54:16,242 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse0 (or (and (= main_~y~0 99) (= (+ main_~z~0 1) 0)) (and (= main_~y~0 100) (= main_~z~0 1))))) (or (and (<= main_~x~0 2147483647) .cse0 (<= 100 main_~y~0)) (and .cse0 (<= main_~x~0 2147483547)))) [2018-12-02 11:54:16,242 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 26) no Hoare annotation was computed. [2018-12-02 11:54:16,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:54:16 BoogieIcfgContainer [2018-12-02 11:54:16,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 11:54:16,248 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 11:54:16,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 11:54:16,248 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 11:54:16,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:54:09" (3/4) ... [2018-12-02 11:54:16,250 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 11:54:16,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 11:54:16,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 11:54:16,256 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 11:54:16,256 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 11:54:16,256 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 11:54:16,277 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d00d124d-ed9a-42d1-bd49-f8715158a1ef/bin-2019/utaipan/witness.graphml [2018-12-02 11:54:16,277 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 11:54:16,278 INFO L168 Benchmark]: Toolchain (without parser) took 7557.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 950.8 MB in the beginning and 964.5 MB in the end (delta: -13.7 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2018-12-02 11:54:16,279 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:54:16,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 115.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 942.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 11:54:16,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:54:16,279 INFO L168 Benchmark]: Boogie Preprocessor took 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:54:16,279 INFO L168 Benchmark]: RCFGBuilder took 149.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-02 11:54:16,280 INFO L168 Benchmark]: TraceAbstraction took 7237.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 964.5 MB in the end (delta: 156.9 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. [2018-12-02 11:54:16,280 INFO L168 Benchmark]: Witness Printer took 29.85 ms. Allocated memory is still 1.2 GB. Free memory is still 964.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:54:16,281 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 115.02 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 942.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7237.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 964.5 MB in the end (delta: 156.9 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. * Witness Printer took 29.85 ms. Allocated memory is still 1.2 GB. Free memory is still 964.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((x <= 2147483647 && ((y == 99 && z + 1 == 0) || (y == 100 && z == 1))) && 100 <= y) || (((y == 99 && z + 1 == 0) || (y == 100 && z == 1)) && x <= 2147483547) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 6 error locations. SAFE Result, 7.1s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 135 SDslu, 193 SDs, 0 SdLazy, 826 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 318 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 20 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 11 NumberOfFragments, 50 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 297 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 301 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 393 ConstructedInterpolants, 19 QuantifiedInterpolants, 68681 SizeOfPredicates, 12 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 66/331 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...