./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/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 cb528549fa76ae8087cf7043645dfa20323a0116 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:18:57,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:18:57,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:18:57,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:18:57,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:18:57,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:18:57,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:18:57,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:18:57,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:18:57,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:18:57,932 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:18:57,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:18:57,933 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:18:57,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:18:57,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:18:57,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:18:57,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:18:57,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:18:57,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:18:57,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:18:57,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:18:57,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:18:57,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:18:57,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:18:57,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:18:57,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:18:57,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:18:57,944 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:18:57,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:18:57,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:18:57,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:18:57,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:18:57,946 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:18:57,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:18:57,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:18:57,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:18:57,947 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-18 13:18:57,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:18:57,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:18:57,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:18:57,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:18:57,958 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:18:57,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:18:57,958 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:18:57,958 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:18:57,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:18:57,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:18:57,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:18:57,959 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:18:57,959 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:18:57,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:18:57,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:18:57,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:18:57,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:18:57,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:18:57,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:18:57,963 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:18:57,963 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_0ac9102f-1116-4f12-915b-1628c1fcdf8d/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-11-18 13:18:57,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:18:57,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:18:57,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:18:58,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:18:58,000 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:18:58,000 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 13:18:58,035 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/data/feb73b9a1/d306d276e3894c01b0e85194c874bade/FLAG4b468c80b [2018-11-18 13:18:58,387 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:18:58,387 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 13:18:58,391 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/data/feb73b9a1/d306d276e3894c01b0e85194c874bade/FLAG4b468c80b [2018-11-18 13:18:58,798 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/data/feb73b9a1/d306d276e3894c01b0e85194c874bade [2018-11-18 13:18:58,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:18:58,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:18:58,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:58,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:18:58,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:18:58,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94fe5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58, skipping insertion in model container [2018-11-18 13:18:58,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:18:58,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:18:58,940 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:58,942 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:18:58,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:18:58,959 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:18:58,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58 WrapperNode [2018-11-18 13:18:58,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:18:58,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:58,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:18:58,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:18:58,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:18:58,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:18:58,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:18:58,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:18:58,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... [2018-11-18 13:18:58,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:18:58,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:18:58,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:18:58,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:18:58,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:18:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:18:59,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:18:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-18 13:18:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-18 13:18:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-18 13:18:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-18 13:18:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:18:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:18:59,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:18:59,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:18:59,175 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:18:59,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:59 BoogieIcfgContainer [2018-11-18 13:18:59,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:18:59,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:18:59,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:18:59,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:18:59,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:18:58" (1/3) ... [2018-11-18 13:18:59,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d40490a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:18:59, skipping insertion in model container [2018-11-18 13:18:59,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:18:58" (2/3) ... [2018-11-18 13:18:59,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d40490a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:18:59, skipping insertion in model container [2018-11-18 13:18:59,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:59" (3/3) ... [2018-11-18 13:18:59,181 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 13:18:59,188 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:18:59,192 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-18 13:18:59,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-18 13:18:59,218 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:18:59,218 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:18:59,218 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:18:59,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:18:59,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:18:59,218 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:18:59,218 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:18:59,218 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:18:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-18 13:18:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 13:18:59,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,235 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-18 13:18:59,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:59,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:18:59,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:18:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:18:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:18:59,371 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-18 13:18:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,445 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-18 13:18:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:18:59,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-18 13:18:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,452 INFO L225 Difference]: With dead ends: 67 [2018-11-18 13:18:59,453 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 13:18:59,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:18:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 13:18:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-11-18 13:18:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 13:18:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-18 13:18:59,482 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-11-18 13:18:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,482 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-18 13:18:59,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:18:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-18 13:18:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 13:18:59,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-18 13:18:59,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:59,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:18:59,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:18:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:18:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,504 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-11-18 13:18:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,515 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 13:18:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:18:59,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 13:18:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,516 INFO L225 Difference]: With dead ends: 56 [2018-11-18 13:18:59,516 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 13:18:59,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 13:18:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-18 13:18:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 13:18:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-18 13:18:59,525 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-11-18 13:18:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,525 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-18 13:18:59,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:18:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-18 13:18:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 13:18:59,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-11-18 13:18:59,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:18:59,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:18:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:18:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:18:59,567 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-18 13:18:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,669 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-18 13:18:59,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:18:59,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 13:18:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,671 INFO L225 Difference]: With dead ends: 77 [2018-11-18 13:18:59,671 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 13:18:59,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:18:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 13:18:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-18 13:18:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 13:18:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-11-18 13:18:59,682 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-11-18 13:18:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,682 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-18 13:18:59,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:18:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-18 13:18:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 13:18:59,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,683 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-11-18 13:18:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:18:59,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:18:59,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:18:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:18:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,706 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-11-18 13:18:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,715 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-18 13:18:59,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:18:59,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 13:18:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,716 INFO L225 Difference]: With dead ends: 73 [2018-11-18 13:18:59,716 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 13:18:59,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 13:18:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-18 13:18:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 13:18:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-18 13:18:59,723 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-11-18 13:18:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,724 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-18 13:18:59,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:18:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-18 13:18:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:18:59,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,724 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-11-18 13:18:59,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,747 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-18 13:18:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:18:59,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:18:59,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:18:59,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:18:59,748 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-11-18 13:18:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,804 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-11-18 13:18:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:18:59,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 13:18:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,805 INFO L225 Difference]: With dead ends: 70 [2018-11-18 13:18:59,806 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 13:18:59,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:18:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 13:18:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-18 13:18:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 13:18:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-18 13:18:59,812 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-11-18 13:18:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,813 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-18 13:18:59,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:18:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-11-18 13:18:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 13:18:59,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,814 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,814 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-11-18 13:18:59,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,833 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-18 13:18:59,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:18:59,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:18:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:18:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,835 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-11-18 13:18:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,858 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-18 13:18:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:18:59,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 13:18:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,859 INFO L225 Difference]: With dead ends: 67 [2018-11-18 13:18:59,859 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 13:18:59,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 13:18:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-18 13:18:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 13:18:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-18 13:18:59,866 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-11-18 13:18:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,866 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-18 13:18:59,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:18:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-18 13:18:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 13:18:59,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,867 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,868 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-11-18 13:18:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,889 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-18 13:18:59,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:18:59,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:18:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:18:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,890 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-11-18 13:18:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,898 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-18 13:18:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:18:59,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 13:18:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,899 INFO L225 Difference]: With dead ends: 66 [2018-11-18 13:18:59,899 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 13:18:59,899 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:18:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 13:18:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-18 13:18:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 13:18:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-11-18 13:18:59,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-11-18 13:18:59,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,906 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-11-18 13:18:59,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:18:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-18 13:18:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 13:18:59,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,907 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,908 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-11-18 13:18:59,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,938 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-18 13:18:59,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:18:59,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:18:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:18:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:18:59,940 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-11-18 13:18:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:18:59,950 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-18 13:18:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:18:59,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 13:18:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:18:59,951 INFO L225 Difference]: With dead ends: 90 [2018-11-18 13:18:59,951 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 13:18:59,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:18:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 13:18:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-18 13:18:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 13:18:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-11-18 13:18:59,961 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-11-18 13:18:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:18:59,961 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-18 13:18:59,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:18:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-11-18 13:18:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:18:59,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:18:59,962 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:18:59,963 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:18:59,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:18:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-11-18 13:18:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:18:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:18:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:18:59,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:18:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:18:59,990 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-18 13:18:59,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:18:59,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:18:59,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:18:59,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:18:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:18:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:18:59,991 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-11-18 13:19:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,012 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-11-18 13:19:00,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:19:00,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 13:19:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,013 INFO L225 Difference]: With dead ends: 84 [2018-11-18 13:19:00,013 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 13:19:00,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:19:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 13:19:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-18 13:19:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 13:19:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-18 13:19:00,021 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-11-18 13:19:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,021 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-18 13:19:00,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:19:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-18 13:19:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 13:19:00,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,022 INFO L375 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, 1, 1] [2018-11-18 13:19:00,022 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-11-18 13:19:00,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:19:00,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:00,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:19:00,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:19:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:19:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:19:00,043 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-11-18 13:19:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,107 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-18 13:19:00,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:19:00,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 13:19:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,108 INFO L225 Difference]: With dead ends: 105 [2018-11-18 13:19:00,108 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 13:19:00,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:19:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 13:19:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-11-18 13:19:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 13:19:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-11-18 13:19:00,119 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-11-18 13:19:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,119 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-11-18 13:19:00,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:19:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-11-18 13:19:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:19:00,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,120 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-18 13:19:00,121 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2030923258, now seen corresponding path program 1 times [2018-11-18 13:19:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:19:00,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:00,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:19:00,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:19:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:19:00,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:19:00,163 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-11-18 13:19:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,215 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-18 13:19:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:19:00,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-18 13:19:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,216 INFO L225 Difference]: With dead ends: 104 [2018-11-18 13:19:00,216 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 13:19:00,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:19:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 13:19:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-11-18 13:19:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 13:19:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-11-18 13:19:00,225 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 33 [2018-11-18 13:19:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,226 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-11-18 13:19:00,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:19:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-11-18 13:19:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 13:19:00,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,227 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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-18 13:19:00,228 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1114959748, now seen corresponding path program 1 times [2018-11-18 13:19:00,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 13:19:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:19:00,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:19:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:19:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:19:00,263 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-11-18 13:19:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,284 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-18 13:19:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:19:00,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-18 13:19:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,286 INFO L225 Difference]: With dead ends: 110 [2018-11-18 13:19:00,287 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 13:19:00,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:19:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 13:19:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-18 13:19:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 13:19:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-11-18 13:19:00,296 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 47 [2018-11-18 13:19:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,297 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-11-18 13:19:00,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:19:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-11-18 13:19:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 13:19:00,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,299 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1] [2018-11-18 13:19:00,299 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -204013767, now seen corresponding path program 1 times [2018-11-18 13:19:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 13:19:00,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:00,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:19:00,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:19:00,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:19:00,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:19:00,336 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-11-18 13:19:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,344 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-18 13:19:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:19:00,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 13:19:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,346 INFO L225 Difference]: With dead ends: 106 [2018-11-18 13:19:00,346 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 13:19:00,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:19:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 13:19:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-18 13:19:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 13:19:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-11-18 13:19:00,353 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 48 [2018-11-18 13:19:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,353 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-11-18 13:19:00,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:19:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-11-18 13:19:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:19:00,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,355 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:19:00,355 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-11-18 13:19:00,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:19:00,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:00,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:00,422 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-18 13:19:00,424 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-18 13:19:00,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:00,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:00,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:19:00,550 INFO L272 AbstractInterpreter]: Visited 24 different actions 29 times. Merged at 2 different actions 2 times. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 13:19:00,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,565 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:19:00,600 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 60.42% of their original sizes. [2018-11-18 13:19:00,600 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:19:00,628 INFO L415 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-11-18 13:19:00,628 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:19:00,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:19:00,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 13:19:00,629 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:19:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:19:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:19:00,630 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 9 states. [2018-11-18 13:19:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,887 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2018-11-18 13:19:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:19:00,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-18 13:19:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,890 INFO L225 Difference]: With dead ends: 208 [2018-11-18 13:19:00,890 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 13:19:00,891 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:19:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 13:19:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-11-18 13:19:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 13:19:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2018-11-18 13:19:00,898 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 40 [2018-11-18 13:19:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,899 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2018-11-18 13:19:00,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:19:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2018-11-18 13:19:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 13:19:00,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,900 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 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] [2018-11-18 13:19:00,901 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1469659330, now seen corresponding path program 1 times [2018-11-18 13:19:00,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 13:19:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:19:00,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:00,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:19:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:19:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:19:00,942 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 5 states. [2018-11-18 13:19:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:00,964 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2018-11-18 13:19:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:19:00,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 13:19:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:00,965 INFO L225 Difference]: With dead ends: 111 [2018-11-18 13:19:00,966 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 13:19:00,966 INFO L604 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-18 13:19:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 13:19:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2018-11-18 13:19:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 13:19:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-11-18 13:19:00,974 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 47 [2018-11-18 13:19:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:00,974 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-11-18 13:19:00,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:19:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-11-18 13:19:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:19:00,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:00,976 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 2, 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-18 13:19:00,976 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:00,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2003157191, now seen corresponding path program 1 times [2018-11-18 13:19:00,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:00,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:00,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-18 13:19:01,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:01,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:01,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 13:19:01,031 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [29], [31], [33], [46], [50], [51], [52], [53], [54], [55], [56], [60], [61], [62], [64] [2018-11-18 13:19:01,033 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:01,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:01,106 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:19:01,106 INFO L272 AbstractInterpreter]: Visited 31 different actions 147 times. Merged at 11 different actions 24 times. Never widened. Performed 379 root evaluator evaluations with a maximum evaluation depth of 3. Performed 379 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-18 13:19:01,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:01,107 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:19:01,140 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 59.38% of their original sizes. [2018-11-18 13:19:01,140 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:19:01,241 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 13:19:01,241 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:19:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:19:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-18 13:19:01,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:01,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:19:01,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:19:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:19:01,242 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 13 states. [2018-11-18 13:19:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:01,582 INFO L93 Difference]: Finished difference Result 154 states and 187 transitions. [2018-11-18 13:19:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:19:01,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-11-18 13:19:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:01,583 INFO L225 Difference]: With dead ends: 154 [2018-11-18 13:19:01,583 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 13:19:01,584 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:19:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 13:19:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-18 13:19:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 13:19:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-11-18 13:19:01,589 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 60 [2018-11-18 13:19:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:01,589 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-11-18 13:19:01,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:19:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-11-18 13:19:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 13:19:01,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:01,590 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:19:01,590 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:01,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 1 times [2018-11-18 13:19:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:01,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 13:19:01,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:01,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:01,625 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-11-18 13:19:01,626 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-18 13:19:01,627 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:01,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:01,686 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:19:01,687 INFO L272 AbstractInterpreter]: Visited 40 different actions 191 times. Merged at 18 different actions 35 times. Never widened. Performed 498 root evaluator evaluations with a maximum evaluation depth of 3. Performed 498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-18 13:19:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:01,701 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:19:01,736 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 60.57% of their original sizes. [2018-11-18 13:19:01,736 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:19:01,919 INFO L415 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-11-18 13:19:01,920 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:19:01,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:19:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [5] total 27 [2018-11-18 13:19:01,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:01,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 13:19:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 13:19:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-11-18 13:19:01,921 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 24 states. [2018-11-18 13:19:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:02,801 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-18 13:19:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 13:19:02,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-11-18 13:19:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:02,802 INFO L225 Difference]: With dead ends: 117 [2018-11-18 13:19:02,802 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:19:02,803 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 13:19:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:19:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:19:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:19:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:19:02,803 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-11-18 13:19:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:02,803 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:19:02,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 13:19:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:19:02,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:19:02,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:19:03,080 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 13:19:03,080 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:19:03,080 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (or (and (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) (not (= |rec1_#in~i| 0))) [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,081 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0)) (or (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0)) (or (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (= |rec1_#t~ret1| 0) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,082 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (or (= rec2_~j 1) (not (= |rec2_#in~j| 1))) (not (= |rec2_#in~j| 0))) [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (= |rec2_#t~ret3| 0))) (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (or .cse0 (= |rec2_#t~ret3| 1))) (< 2147483647 |rec2_#in~j|)) (or (and .cse0 (= rec2_~j 1)) (not (= |rec2_#in~j| 1))) (not (= |rec2_#in~j| 0)))) [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-18 13:19:03,083 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-18 13:19:03,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:19:03,084 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 13:19:03,084 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:19:03,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:19:03,084 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-18 13:19:03,084 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-18 13:19:03,084 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-11-18 13:19:03,084 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-18 13:19:03,084 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-18 13:19:03,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:19:03 BoogieIcfgContainer [2018-11-18 13:19:03,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:19:03,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:19:03,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:19:03,087 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:19:03,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:18:59" (3/4) ... [2018-11-18 13:19:03,091 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:19:03,096 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:19:03,096 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-18 13:19:03,096 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-18 13:19:03,097 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:19:03,100 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 13:19:03,100 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 13:19:03,100 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 13:19:03,135 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ac9102f-1116-4f12-915b-1628c1fcdf8d/bin-2019/utaipan/witness.graphml [2018-11-18 13:19:03,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:19:03,136 INFO L168 Benchmark]: Toolchain (without parser) took 4335.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -311.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:03,137 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:03,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.79 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:03,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.34 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:03,138 INFO L168 Benchmark]: Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:03,138 INFO L168 Benchmark]: RCFGBuilder took 193.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:03,139 INFO L168 Benchmark]: TraceAbstraction took 3910.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -121.5 MB). Peak memory consumption was 365.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:03,139 INFO L168 Benchmark]: Witness Printer took 48.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:03,141 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.79 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 11.34 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 193.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3910.43 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -121.5 MB). Peak memory consumption was 365.2 MB. Max. memory is 11.5 GB. * Witness Printer took 48.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. 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: 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 3.8s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 725 SDtfs, 315 SDslu, 2056 SDs, 0 SdLazy, 347 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 248 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.8421325051759837 AbsIntWeakeningRatio, 0.5279503105590062 AbsIntAvgWeakeningVarsNumRemoved, 0.30434782608695654 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 151 PreInvPairs, 158 NumberOfFragments, 159 HoareAnnotationTreeSize, 151 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 183 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 28797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 281/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...