./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:47:58,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:47:58,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:47:58,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:47:58,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:47:58,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:47:58,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:47:58,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:47:58,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:47:58,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:47:58,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:47:58,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:47:58,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:47:58,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:47:58,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:47:58,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:47:58,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:47:58,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:47:58,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:47:58,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:47:58,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:47:58,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:47:58,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:47:58,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:47:58,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:47:58,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:47:58,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:47:58,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:47:58,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:47:58,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:47:58,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:47:58,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:47:58,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:47:58,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:47:58,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:47:58,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:47:58,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 04:47:58,106 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:47:58,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:47:58,107 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:47:58,107 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:47:58,107 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:47:58,107 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:47:58,107 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:47:58,107 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:47:58,107 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:47:58,108 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:47:58,108 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:47:58,108 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:47:58,108 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:47:58,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:47:58,109 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:47:58,110 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:47:58,110 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:47:58,111 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:47:58,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:47:58,112 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:47:58,112 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_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/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 -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2018-11-23 04:47:58,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:47:58,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:47:58,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:47:58,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:47:58,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:47:58,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 04:47:58,202 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/data/a42316622/04ac4c9d9d894f2d9d2d4519c67e6541/FLAG7b5ad4505 [2018-11-23 04:47:58,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:47:58,549 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/sv-benchmarks/c/termination-crafted/MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 04:47:58,554 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/data/a42316622/04ac4c9d9d894f2d9d2d4519c67e6541/FLAG7b5ad4505 [2018-11-23 04:47:58,978 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/data/a42316622/04ac4c9d9d894f2d9d2d4519c67e6541 [2018-11-23 04:47:58,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:47:58,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:47:58,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:47:58,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:47:58,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:47:58,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:47:58" (1/1) ... [2018-11-23 04:47:58,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:58, skipping insertion in model container [2018-11-23 04:47:58,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:47:58" (1/1) ... [2018-11-23 04:47:58,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:47:59,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:47:59,153 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:47:59,156 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:47:59,168 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:47:59,177 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:47:59,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59 WrapperNode [2018-11-23 04:47:59,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:47:59,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:47:59,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:47:59,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:47:59,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:47:59,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:47:59,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:47:59,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:47:59,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... [2018-11-23 04:47:59,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:47:59,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:47:59,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:47:59,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:47:59,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:47:59,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:47:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:47:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 04:47:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 04:47:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 04:47:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 04:47:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:47:59,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:47:59,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:47:59,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:47:59,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:47:59,438 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 04:47:59,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:47:59 BoogieIcfgContainer [2018-11-23 04:47:59,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:47:59,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:47:59,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:47:59,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:47:59,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:47:58" (1/3) ... [2018-11-23 04:47:59,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664295a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:47:59, skipping insertion in model container [2018-11-23 04:47:59,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:47:59" (2/3) ... [2018-11-23 04:47:59,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664295a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:47:59, skipping insertion in model container [2018-11-23 04:47:59,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:47:59" (3/3) ... [2018-11-23 04:47:59,444 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-23 04:47:59,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:47:59,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-23 04:47:59,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-23 04:47:59,492 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:47:59,493 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:47:59,493 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:47:59,493 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:47:59,493 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:47:59,493 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:47:59,493 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:47:59,494 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:47:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 04:47:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 04:47:59,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:47:59,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:47:59,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:47:59,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:47:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-11-23 04:47:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:47:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:47:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:47:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:47:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:47:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:47:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:47:59,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:47:59,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:47:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:47:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:47:59,671 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-11-23 04:47:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:47:59,764 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-23 04:47:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:47:59,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-23 04:47:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:47:59,777 INFO L225 Difference]: With dead ends: 69 [2018-11-23 04:47:59,777 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 04:47:59,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:47:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 04:47:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-23 04:47:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 04:47:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 04:47:59,825 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-23 04:47:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:47:59,825 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 04:47:59,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:47:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 04:47:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 04:47:59,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:47:59,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:47:59,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:47:59,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:47:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-11-23 04:47:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:47:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:47:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:47:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:47:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:47:59,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:47:59,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:47:59,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:47:59,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:47:59,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:47:59,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:47:59,854 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-23 04:47:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:47:59,882 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 04:47:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:47:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 04:47:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:47:59,884 INFO L225 Difference]: With dead ends: 56 [2018-11-23 04:47:59,884 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 04:47:59,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:47:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 04:47:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 04:47:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 04:47:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 04:47:59,894 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-11-23 04:47:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:47:59,894 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 04:47:59,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:47:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 04:47:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 04:47:59,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:47:59,896 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:47:59,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:47:59,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:47:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-11-23 04:47:59,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:47:59,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:47:59,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:47:59,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:47:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:47:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:47:59,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:47:59,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:47:59,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:47:59,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:47:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:47:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:47:59,980 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-11-23 04:48:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,083 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 04:48:00,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:48:00,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 04:48:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,086 INFO L225 Difference]: With dead ends: 71 [2018-11-23 04:48:00,086 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 04:48:00,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:48:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 04:48:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-23 04:48:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 04:48:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-23 04:48:00,095 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-11-23 04:48:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,095 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-23 04:48:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:48:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-23 04:48:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 04:48:00,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,096 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,098 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-11-23 04:48:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 04:48:00,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:48:00,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:48:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:48:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:48:00,140 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-11-23 04:48:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,187 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-23 04:48:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:48:00,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 04:48:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,189 INFO L225 Difference]: With dead ends: 81 [2018-11-23 04:48:00,189 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 04:48:00,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 04:48:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-11-23 04:48:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 04:48:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-11-23 04:48:00,200 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-11-23 04:48:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,202 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-11-23 04:48:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:48:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-23 04:48:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 04:48:00,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,203 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,203 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-11-23 04:48:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:48:00,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:48:00,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:48:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:48:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:48:00,228 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-11-23 04:48:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,246 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-23 04:48:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:48:00,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 04:48:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,248 INFO L225 Difference]: With dead ends: 71 [2018-11-23 04:48:00,248 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 04:48:00,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:48:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 04:48:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-23 04:48:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 04:48:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-23 04:48:00,256 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-11-23 04:48:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,257 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-23 04:48:00,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:48:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-11-23 04:48:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:48:00,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,258 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,258 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,259 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-11-23 04:48:00,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 04:48:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:48:00,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:48:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:48:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:48:00,296 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-11-23 04:48:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,361 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-11-23 04:48:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:48:00,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 04:48:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,362 INFO L225 Difference]: With dead ends: 127 [2018-11-23 04:48:00,362 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 04:48:00,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 04:48:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 04:48:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 04:48:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-23 04:48:00,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-11-23 04:48:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,372 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-23 04:48:00,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:48:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 04:48:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:48:00,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,376 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-11-23 04:48:00,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:48:00,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:48:00,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:48:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:48:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:48:00,422 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-11-23 04:48:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,461 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-11-23 04:48:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:48:00,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 04:48:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,463 INFO L225 Difference]: With dead ends: 76 [2018-11-23 04:48:00,463 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 04:48:00,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 04:48:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-23 04:48:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 04:48:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-11-23 04:48:00,471 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-11-23 04:48:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,472 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-11-23 04:48:00,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:48:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-11-23 04:48:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:48:00,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,474 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,475 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,476 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-11-23 04:48:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:48:00,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:48:00,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:48:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:48:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:48:00,518 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-11-23 04:48:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,554 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-23 04:48:00,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:48:00,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-23 04:48:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,555 INFO L225 Difference]: With dead ends: 79 [2018-11-23 04:48:00,555 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 04:48:00,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 04:48:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-23 04:48:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 04:48:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-11-23 04:48:00,560 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-11-23 04:48:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,561 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-11-23 04:48:00,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:48:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-23 04:48:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 04:48:00,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,562 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,562 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1986621902, now seen corresponding path program 1 times [2018-11-23 04:48:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 04:48:00,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:48:00,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:48:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:48:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:48:00,615 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 7 states. [2018-11-23 04:48:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,717 INFO L93 Difference]: Finished difference Result 111 states and 142 transitions. [2018-11-23 04:48:00,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:48:00,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-11-23 04:48:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,719 INFO L225 Difference]: With dead ends: 111 [2018-11-23 04:48:00,719 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 04:48:00,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:48:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 04:48:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2018-11-23 04:48:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 04:48:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-11-23 04:48:00,729 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 46 [2018-11-23 04:48:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,729 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-11-23 04:48:00,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:48:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-11-23 04:48:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 04:48:00,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,730 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,731 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 637883800, now seen corresponding path program 1 times [2018-11-23 04:48:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 04:48:00,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:48:00,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:48:00,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:00,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:48:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:48:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:48:00,773 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2018-11-23 04:48:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:00,818 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 04:48:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:48:00,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 04:48:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:00,820 INFO L225 Difference]: With dead ends: 85 [2018-11-23 04:48:00,820 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 04:48:00,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 04:48:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 04:48:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 04:48:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-23 04:48:00,830 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 43 [2018-11-23 04:48:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:00,831 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-23 04:48:00,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:48:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-23 04:48:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 04:48:00,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:48:00,834 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:48:00,834 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 04:48:00,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 187335224, now seen corresponding path program 1 times [2018-11-23 04:48:00,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:48:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:48:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:48:00,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:48:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:48:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-23 04:48:00,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:48:00,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:48:00,916 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-23 04:48:00,917 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [14], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60] [2018-11-23 04:48:00,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:48:00,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:48:01,286 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 04:48:01,287 INFO L272 AbstractInterpreter]: Visited 34 different actions 669 times. Never merged. Never widened. Performed 1336 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1336 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 35 fixpoints after 3 different actions. Largest state had 5 variables. [2018-11-23 04:48:01,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:48:01,297 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 04:48:01,346 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-23 04:48:01,346 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 04:48:01,379 INFO L415 sIntCurrentIteration]: We unified 71 AI predicates to 71 [2018-11-23 04:48:01,379 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 04:48:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:48:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2018-11-23 04:48:01,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:48:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:48:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:48:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:01,381 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 6 states. [2018-11-23 04:48:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:48:01,431 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-11-23 04:48:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:48:01,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 04:48:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:48:01,431 INFO L225 Difference]: With dead ends: 96 [2018-11-23 04:48:01,432 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:48:01,433 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:48:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:48:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:48:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:48:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:48:01,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2018-11-23 04:48:01,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:48:01,434 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:48:01,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:48:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:48:01,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:48:01,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:48:01,549 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 04:48:01,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:48:01,549 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-11-23 04:48:01,549 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,549 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (or (and (<= |f_#in~x| f_~x) (<= f_~x 2147483647) (<= 1 f_~x)) (< 2147483647 |f_#in~x|)) [2018-11-23 04:48:01,549 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-23 04:48:01,549 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (< 2147483647 |f_#in~x|) [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,550 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-11-23 04:48:01,550 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-11-23 04:48:01,551 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (< 2147483647 |g_#in~x|)) [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (< 2147483647 |g_#in~x|))) (and (or (and (<= 0 (+ |g_#t~ret2| 2147483648)) (<= g_~x 2147483647) (<= |g_#in~x| g_~x) (<= |g_#t~ret2| 2147483647) (not (= g_~x 0))) .cse0) (or (= |g_#in~x| 0) .cse0))) [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,552 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 04:48:01,553 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:48:01,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:48:01,553 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-11-23 04:48:01,554 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-11-23 04:48:01,554 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-23 04:48:01,554 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-23 04:48:01,554 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-11-23 04:48:01,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:48:01 BoogieIcfgContainer [2018-11-23 04:48:01,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:48:01,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:48:01,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:48:01,557 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:48:01,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:47:59" (3/4) ... [2018-11-23 04:48:01,561 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:48:01,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:48:01,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 04:48:01,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-23 04:48:01,565 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:48:01,569 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 04:48:01,569 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 04:48:01,569 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 04:48:01,607 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_153bfc5c-2b99-4dc6-9af2-ab38f200d73f/bin-2019/utaipan/witness.graphml [2018-11-23 04:48:01,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:48:01,608 INFO L168 Benchmark]: Toolchain (without parser) took 2626.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 959.2 MB in the beginning and 834.9 MB in the end (delta: 124.4 MB). Peak memory consumption was 247.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,610 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:48:01,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:48:01,610 INFO L168 Benchmark]: Boogie Preprocessor took 14.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,611 INFO L168 Benchmark]: RCFGBuilder took 231.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,611 INFO L168 Benchmark]: TraceAbstraction took 2117.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 838.3 MB in the end (delta: 267.5 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,611 INFO L168 Benchmark]: Witness Printer took 50.38 ms. Allocated memory is still 1.2 GB. Free memory was 838.3 MB in the beginning and 834.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:48:01,613 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.01 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.56 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2117.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 838.3 MB in the end (delta: 267.5 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. * Witness Printer took 50.38 ms. Allocated memory is still 1.2 GB. Free memory was 838.3 MB in the beginning and 834.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 10 error locations. SAFE Result, 2.0s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 389 SDtfs, 265 SDslu, 895 SDs, 0 SdLazy, 406 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 126 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9154929577464789 AbsIntWeakeningRatio, 0.4647887323943662 AbsIntAvgWeakeningVarsNumRemoved, 0.11267605633802817 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 62 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 65 PreInvPairs, 66 NumberOfFragments, 76 HoareAnnotationTreeSize, 65 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 19180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 136/153 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...