./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/Ackermann03_true-unreach-call_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann03_true-unreach-call_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/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 32bit --witnessprinter.graph.data.programhash 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:59:55,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:59:55,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:59:55,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:59:55,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:59:55,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:59:55,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:59:55,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:59:55,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:59:55,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:59:55,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:59:55,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:59:55,026 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:59:55,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:59:55,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:59:55,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:59:55,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:59:55,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:59:55,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:59:55,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:59:55,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:59:55,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:59:55,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:59:55,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:59:55,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:59:55,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:59:55,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:59:55,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:59:55,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:59:55,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:59:55,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:59:55,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:59:55,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:59:55,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:59:55,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:59:55,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:59:55,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 11:59:55,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:59:55,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:59:55,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:59:55,051 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:59:55,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:59:55,052 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:59:55,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:59:55,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:59:55,052 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:59:55,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:59:55,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:59:55,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:59:55,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:59:55,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:59:55,054 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:59:55,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:59:55,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:59:55,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:59:55,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:59:55,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:59:55,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:59:55,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:59:55,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:59:55,055 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_77d76687-96a4-4c73-98ce-b7053973adfa/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33d0641b9a339cc7e30dea71c1d04be4d72dcf57 [2018-11-10 11:59:55,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:59:55,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:59:55,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:59:55,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:59:55,091 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:59:55,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Ackermann03_true-unreach-call_true-no-overflow.c [2018-11-10 11:59:55,134 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/data/8e1b9ca0f/160bb5651c7b4d2fb9042d120a6b3a8a/FLAGa525e38fb [2018-11-10 11:59:55,438 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:59:55,439 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/sv-benchmarks/c/recursive/Ackermann03_true-unreach-call_true-no-overflow.c [2018-11-10 11:59:55,443 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/data/8e1b9ca0f/160bb5651c7b4d2fb9042d120a6b3a8a/FLAGa525e38fb [2018-11-10 11:59:55,454 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/data/8e1b9ca0f/160bb5651c7b4d2fb9042d120a6b3a8a [2018-11-10 11:59:55,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:59:55,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:59:55,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:59:55,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:59:55,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:59:55,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505fd6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55, skipping insertion in model container [2018-11-10 11:59:55,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:59:55,486 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:59:55,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:59:55,580 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:59:55,590 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:59:55,598 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:59:55,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55 WrapperNode [2018-11-10 11:59:55,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:59:55,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:59:55,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:59:55,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:59:55,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:59:55,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:59:55,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:59:55,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:59:55,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... [2018-11-10 11:59:55,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:59:55,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:59:55,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:59:55,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:59:55,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/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-10 11:59:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:59:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:59:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:59:55,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:59:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:59:55,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:59:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2018-11-10 11:59:55,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2018-11-10 11:59:55,862 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:59:55,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:55 BoogieIcfgContainer [2018-11-10 11:59:55,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:59:55,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:59:55,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:59:55,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:59:55,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:59:55" (1/3) ... [2018-11-10 11:59:55,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71774d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:59:55, skipping insertion in model container [2018-11-10 11:59:55,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:55" (2/3) ... [2018-11-10 11:59:55,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71774d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:59:55, skipping insertion in model container [2018-11-10 11:59:55,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:55" (3/3) ... [2018-11-10 11:59:55,869 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann03_true-unreach-call_true-no-overflow.c [2018-11-10 11:59:55,878 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:59:55,887 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 11:59:55,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 11:59:55,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:59:55,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:59:55,928 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:59:55,928 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:59:55,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:59:55,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:59:55,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:59:55,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:59:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-10 11:59:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 11:59:55,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:55,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:55,952 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:55,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -437746855, now seen corresponding path program 1 times [2018-11-10 11:59:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:55,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,104 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-10 11:59:56,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:56,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:56,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:56,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:59:56,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:59:56,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:56,117 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2018-11-10 11:59:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:56,238 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-11-10 11:59:56,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:59:56,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-10 11:59:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:56,248 INFO L225 Difference]: With dead ends: 77 [2018-11-10 11:59:56,248 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 11:59:56,251 INFO L605 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-10 11:59:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 11:59:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-10 11:59:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 11:59:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-11-10 11:59:56,283 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 11 [2018-11-10 11:59:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:56,283 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-11-10 11:59:56,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:59:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-10 11:59:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:59:56,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:56,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:56,284 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:56,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -685250558, now seen corresponding path program 1 times [2018-11-10 11:59:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,325 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-10 11:59:56,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:56,326 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:56,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:59:56,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:59:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:56,328 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 5 states. [2018-11-10 11:59:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:56,418 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2018-11-10 11:59:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:59:56,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 11:59:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:56,419 INFO L225 Difference]: With dead ends: 83 [2018-11-10 11:59:56,419 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 11:59:56,420 INFO L605 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-10 11:59:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 11:59:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-11-10 11:59:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 11:59:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2018-11-10 11:59:56,429 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 12 [2018-11-10 11:59:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:56,429 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2018-11-10 11:59:56,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:59:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2018-11-10 11:59:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 11:59:56,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:56,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:56,430 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:56,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,430 INFO L82 PathProgramCache]: Analyzing trace with hash -685245561, now seen corresponding path program 1 times [2018-11-10 11:59:56,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,462 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-10 11:59:56,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:56,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:56,463 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:56,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:59:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:59:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:56,463 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 5 states. [2018-11-10 11:59:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:56,543 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-11-10 11:59:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:59:56,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-10 11:59:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:56,547 INFO L225 Difference]: With dead ends: 73 [2018-11-10 11:59:56,547 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 11:59:56,547 INFO L605 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-10 11:59:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 11:59:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-10 11:59:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 11:59:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-11-10 11:59:56,553 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 12 [2018-11-10 11:59:56,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:56,553 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-11-10 11:59:56,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:59:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-10 11:59:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:59:56,554 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:56,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:56,554 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:56,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 232224156, now seen corresponding path program 1 times [2018-11-10 11:59:56,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,574 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-10 11:59:56,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:56,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:56,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:56,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:59:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:59:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:56,575 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 5 states. [2018-11-10 11:59:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:56,623 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2018-11-10 11:59:56,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:59:56,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 11:59:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:56,624 INFO L225 Difference]: With dead ends: 119 [2018-11-10 11:59:56,625 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 11:59:56,625 INFO L605 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-10 11:59:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 11:59:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2018-11-10 11:59:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 11:59:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2018-11-10 11:59:56,639 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 13 [2018-11-10 11:59:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:56,639 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2018-11-10 11:59:56,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:59:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2018-11-10 11:59:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:59:56,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:56,640 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:56,640 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:56,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash 579139995, now seen corresponding path program 1 times [2018-11-10 11:59:56,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:56,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:56,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:56,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:59:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:59:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:59:56,674 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand 4 states. [2018-11-10 11:59:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:56,714 INFO L93 Difference]: Finished difference Result 171 states and 224 transitions. [2018-11-10 11:59:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:59:56,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-10 11:59:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:56,716 INFO L225 Difference]: With dead ends: 171 [2018-11-10 11:59:56,716 INFO L226 Difference]: Without dead ends: 100 [2018-11-10 11:59:56,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-10 11:59:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-10 11:59:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 11:59:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2018-11-10 11:59:56,728 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 19 [2018-11-10 11:59:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:56,728 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2018-11-10 11:59:56,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:59:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2018-11-10 11:59:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 11:59:56,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:56,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:56,730 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:56,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash 579146946, now seen corresponding path program 1 times [2018-11-10 11:59:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:56,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:56,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:56,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:56,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:56,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:59:56,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 11:59:56,772 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [30], [33], [35], [37], [40], [42], [43], [54], [55], [56], [58], [60] [2018-11-10 11:59:56,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:59:56,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:59:56,907 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:59:56,908 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 4 variables. [2018-11-10 11:59:56,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:56,913 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:59:56,971 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 63.89% of their original sizes. [2018-11-10 11:59:56,971 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:59:57,094 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 11:59:57,094 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:59:57,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:59:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2018-11-10 11:59:57,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:57,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:59:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:59:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:59:57,095 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 13 states. [2018-11-10 11:59:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:57,697 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2018-11-10 11:59:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:59:57,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-10 11:59:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:57,698 INFO L225 Difference]: With dead ends: 141 [2018-11-10 11:59:57,698 INFO L226 Difference]: Without dead ends: 137 [2018-11-10 11:59:57,699 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:59:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-10 11:59:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-10 11:59:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 11:59:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2018-11-10 11:59:57,709 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 19 [2018-11-10 11:59:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:57,710 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2018-11-10 11:59:57,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:59:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2018-11-10 11:59:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:59:57,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:57,711 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:57,711 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:57,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 178790620, now seen corresponding path program 1 times [2018-11-10 11:59:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:57,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:57,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:57,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:57,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:57,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:59:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:59:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:59:57,745 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 4 states. [2018-11-10 11:59:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:57,797 INFO L93 Difference]: Finished difference Result 236 states and 312 transitions. [2018-11-10 11:59:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:59:57,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-10 11:59:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:57,800 INFO L225 Difference]: With dead ends: 236 [2018-11-10 11:59:57,800 INFO L226 Difference]: Without dead ends: 154 [2018-11-10 11:59:57,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:59:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-10 11:59:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-11-10 11:59:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 11:59:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2018-11-10 11:59:57,817 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 20 [2018-11-10 11:59:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:57,818 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2018-11-10 11:59:57,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:59:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2018-11-10 11:59:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:59:57,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:57,819 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:57,819 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:57,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:57,819 INFO L82 PathProgramCache]: Analyzing trace with hash 747525739, now seen corresponding path program 1 times [2018-11-10 11:59:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:57,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:57,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:57,869 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:59:57,869 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-10 11:59:57,869 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [30], [40], [42], [44], [46], [47], [48], [54], [55], [56], [58], [62] [2018-11-10 11:59:57,870 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:59:57,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:59:57,893 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:59:57,893 INFO L272 AbstractInterpreter]: Visited 17 different actions 44 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-10 11:59:57,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:57,898 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:59:57,923 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 53.85% of their original sizes. [2018-11-10 11:59:57,923 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:59:58,007 INFO L415 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2018-11-10 11:59:58,007 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:59:58,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:59:58,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2018-11-10 11:59:58,008 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:58,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 11:59:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:59:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:59:58,009 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand 13 states. [2018-11-10 11:59:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:58,554 INFO L93 Difference]: Finished difference Result 189 states and 230 transitions. [2018-11-10 11:59:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:59:58,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-10 11:59:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:58,556 INFO L225 Difference]: With dead ends: 189 [2018-11-10 11:59:58,556 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 11:59:58,557 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-11-10 11:59:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 11:59:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-11-10 11:59:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-10 11:59:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions. [2018-11-10 11:59:58,572 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 23 [2018-11-10 11:59:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:58,573 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 211 transitions. [2018-11-10 11:59:58,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 11:59:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions. [2018-11-10 11:59:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 11:59:58,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:58,574 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, 1, 1, 1] [2018-11-10 11:59:58,574 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:59:58,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1151540446, now seen corresponding path program 1 times [2018-11-10 11:59:58,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:58,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:59:58,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:58,626 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:59:58,626 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 11:59:58,627 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [25], [26], [27], [29], [30], [33], [35], [37], [39], [40], [42], [44], [46], [48], [50], [53], [54], [55], [56], [58], [60], [61], [62], [63], [64] [2018-11-10 11:59:58,629 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:59:58,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:59:58,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:59:58,855 INFO L272 AbstractInterpreter]: Visited 30 different actions 858 times. Merged at 2 different actions 2 times. Widened at 1 different actions 10 times. Found 17 fixpoints after 3 different actions. Largest state had 7 variables. [2018-11-10 11:59:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:58,882 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:59:58,912 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 57.08% of their original sizes. [2018-11-10 11:59:58,912 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:59:59,096 INFO L415 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-11-10 11:59:59,097 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:59:59,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:59:59,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [8] total 28 [2018-11-10 11:59:59,097 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:59,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 11:59:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 11:59:59,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:59:59,098 INFO L87 Difference]: Start difference. First operand 176 states and 211 transitions. Second operand 22 states. [2018-11-10 12:00:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:01,272 INFO L93 Difference]: Finished difference Result 419 states and 557 transitions. [2018-11-10 12:00:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 12:00:01,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-11-10 12:00:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:01,274 INFO L225 Difference]: With dead ends: 419 [2018-11-10 12:00:01,275 INFO L226 Difference]: Without dead ends: 315 [2018-11-10 12:00:01,276 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 12:00:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-10 12:00:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 294. [2018-11-10 12:00:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-11-10 12:00:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 356 transitions. [2018-11-10 12:00:01,297 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 356 transitions. Word has length 36 [2018-11-10 12:00:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:01,297 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 356 transitions. [2018-11-10 12:00:01,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 12:00:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 356 transitions. [2018-11-10 12:00:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 12:00:01,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:01,299 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:01,299 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:01,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 64457351, now seen corresponding path program 1 times [2018-11-10 12:00:01,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:01,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:01,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:01,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 12:00:01,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:01,398 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:01,398 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-10 12:00:01,398 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [25], [26], [27], [29], [30], [33], [35], [37], [39], [40], [42], [44], [46], [48], [50], [52], [53], [54], [55], [56], [58], [60], [61], [62], [63], [64], [65] [2018-11-10 12:00:01,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:00:01,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:00:12,422 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:00:12,422 INFO L272 AbstractInterpreter]: Visited 32 different actions 58344 times. Merged at 7 different actions 3489 times. Widened at 2 different actions 1977 times. Found 2351 fixpoints after 6 different actions. Largest state had 8 variables. [2018-11-10 12:00:12,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:12,454 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:00:12,494 INFO L227 lantSequenceWeakener]: Weakened 44 states. On average, predicates are now at 53.64% of their original sizes. [2018-11-10 12:00:12,494 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:00:13,207 INFO L415 sIntCurrentIteration]: We unified 70 AI predicates to 70 [2018-11-10 12:00:13,207 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:00:13,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:00:13,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [11] total 40 [2018-11-10 12:00:13,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:00:13,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 12:00:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 12:00:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-11-10 12:00:13,209 INFO L87 Difference]: Start difference. First operand 294 states and 356 transitions. Second operand 30 states. [2018-11-10 12:00:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:15,930 INFO L93 Difference]: Finished difference Result 467 states and 577 transitions. [2018-11-10 12:00:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 12:00:15,930 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-11-10 12:00:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:15,931 INFO L225 Difference]: With dead ends: 467 [2018-11-10 12:00:15,931 INFO L226 Difference]: Without dead ends: 147 [2018-11-10 12:00:15,933 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=553, Invalid=2417, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 12:00:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-10 12:00:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2018-11-10 12:00:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-10 12:00:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-11-10 12:00:15,942 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 71 [2018-11-10 12:00:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:15,943 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-11-10 12:00:15,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 12:00:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-11-10 12:00:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 12:00:15,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:15,944 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 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] [2018-11-10 12:00:15,944 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:15,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 708889275, now seen corresponding path program 2 times [2018-11-10 12:00:15,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:15,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:15,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 12:00:16,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:16,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:16,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:00:16,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:00:16,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:16,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:00:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:00:16,043 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:00:16,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 12:00:16,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:00:16,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 12:00:16,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:00:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:00:16,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:00:16,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 23 [2018-11-10 12:00:16,642 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:00:16,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:00:16,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:00:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:00:16,643 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 12 states. [2018-11-10 12:00:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:17,078 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2018-11-10 12:00:17,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 12:00:17,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-10 12:00:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:17,080 INFO L225 Difference]: With dead ends: 280 [2018-11-10 12:00:17,081 INFO L226 Difference]: Without dead ends: 278 [2018-11-10 12:00:17,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1544, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 12:00:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-11-10 12:00:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 234. [2018-11-10 12:00:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 12:00:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 320 transitions. [2018-11-10 12:00:17,097 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 320 transitions. Word has length 55 [2018-11-10 12:00:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:17,097 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 320 transitions. [2018-11-10 12:00:17,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:00:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 320 transitions. [2018-11-10 12:00:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 12:00:17,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:17,100 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 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] [2018-11-10 12:00:17,100 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash 500731104, now seen corresponding path program 1 times [2018-11-10 12:00:17,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:17,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:17,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:17,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 12:00:17,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:00:17,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:00:17,151 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:00:17,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:00:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:00:17,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:00:17,151 INFO L87 Difference]: Start difference. First operand 234 states and 320 transitions. Second operand 5 states. [2018-11-10 12:00:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:17,204 INFO L93 Difference]: Finished difference Result 238 states and 320 transitions. [2018-11-10 12:00:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:00:17,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-11-10 12:00:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:17,206 INFO L225 Difference]: With dead ends: 238 [2018-11-10 12:00:17,206 INFO L226 Difference]: Without dead ends: 237 [2018-11-10 12:00:17,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:00:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-10 12:00:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-11-10 12:00:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-10 12:00:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 318 transitions. [2018-11-10 12:00:17,218 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 318 transitions. Word has length 56 [2018-11-10 12:00:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:17,219 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 318 transitions. [2018-11-10 12:00:17,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:00:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 318 transitions. [2018-11-10 12:00:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 12:00:17,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:17,220 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 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, 1] [2018-11-10 12:00:17,220 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:17,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1657049986, now seen corresponding path program 1 times [2018-11-10 12:00:17,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:17,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 12:00:17,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:17,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:17,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 12:00:17,266 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [25], [27], [29], [30], [33], [35], [36], [37], [39], [40], [42], [44], [46], [48], [50], [52], [53], [54], [55], [56], [58], [60], [61], [62], [63], [64], [65] [2018-11-10 12:00:17,267 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:00:17,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:00:24,436 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:00:24,436 INFO L272 AbstractInterpreter]: Visited 32 different actions 57233 times. Merged at 7 different actions 3489 times. Widened at 2 different actions 1977 times. Found 2351 fixpoints after 6 different actions. Largest state had 8 variables. [2018-11-10 12:00:24,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:24,442 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:00:24,495 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 55.41% of their original sizes. [2018-11-10 12:00:24,495 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:00:24,941 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 12:00:24,941 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:00:24,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:00:24,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [6] total 37 [2018-11-10 12:00:24,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:00:24,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 12:00:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 12:00:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2018-11-10 12:00:24,942 INFO L87 Difference]: Start difference. First operand 233 states and 318 transitions. Second operand 32 states. [2018-11-10 12:00:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:27,007 INFO L93 Difference]: Finished difference Result 433 states and 611 transitions. [2018-11-10 12:00:27,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 12:00:27,007 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2018-11-10 12:00:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:27,008 INFO L225 Difference]: With dead ends: 433 [2018-11-10 12:00:27,008 INFO L226 Difference]: Without dead ends: 262 [2018-11-10 12:00:27,010 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=2751, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 12:00:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-10 12:00:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-10 12:00:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 12:00:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2018-11-10 12:00:27,027 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 57 [2018-11-10 12:00:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:27,028 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2018-11-10 12:00:27,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 12:00:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2018-11-10 12:00:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 12:00:27,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:27,029 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:27,029 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:27,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1842760932, now seen corresponding path program 2 times [2018-11-10 12:00:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:27,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:27,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:27,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 12:00:27,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:00:27,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:00:27,072 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:00:27,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 12:00:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:00:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:00:27,073 INFO L87 Difference]: Start difference. First operand 260 states and 354 transitions. Second operand 4 states. [2018-11-10 12:00:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:27,206 INFO L93 Difference]: Finished difference Result 264 states and 354 transitions. [2018-11-10 12:00:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:00:27,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 12:00:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:27,208 INFO L225 Difference]: With dead ends: 264 [2018-11-10 12:00:27,208 INFO L226 Difference]: Without dead ends: 262 [2018-11-10 12:00:27,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:00:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-10 12:00:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-10 12:00:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 12:00:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 348 transitions. [2018-11-10 12:00:27,225 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 348 transitions. Word has length 65 [2018-11-10 12:00:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:27,225 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 348 transitions. [2018-11-10 12:00:27,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 12:00:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 348 transitions. [2018-11-10 12:00:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 12:00:27,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:27,226 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:27,227 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:27,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1373412045, now seen corresponding path program 1 times [2018-11-10 12:00:27,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:27,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:27,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:27,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:27,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 12:00:27,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:27,311 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:27,311 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-10 12:00:27,311 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [22], [25], [27], [29], [30], [33], [35], [37], [39], [40], [42], [44], [46], [47], [48], [50], [52], [53], [54], [55], [56], [58], [60], [61], [62], [63], [64], [65] [2018-11-10 12:00:27,312 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:00:27,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:00:34,494 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:00:34,494 INFO L272 AbstractInterpreter]: Visited 32 different actions 58985 times. Merged at 7 different actions 3489 times. Widened at 2 different actions 1977 times. Found 2351 fixpoints after 6 different actions. Largest state had 8 variables. [2018-11-10 12:00:34,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:34,498 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:00:34,554 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 55.22% of their original sizes. [2018-11-10 12:00:34,554 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:00:35,193 INFO L415 sIntCurrentIteration]: We unified 66 AI predicates to 66 [2018-11-10 12:00:35,194 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:00:35,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:00:35,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [7] total 40 [2018-11-10 12:00:35,194 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:00:35,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 12:00:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 12:00:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 12:00:35,195 INFO L87 Difference]: Start difference. First operand 260 states and 348 transitions. Second operand 35 states. [2018-11-10 12:00:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:38,253 INFO L93 Difference]: Finished difference Result 461 states and 636 transitions. [2018-11-10 12:00:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 12:00:38,253 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-11-10 12:00:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:38,255 INFO L225 Difference]: With dead ends: 461 [2018-11-10 12:00:38,255 INFO L226 Difference]: Without dead ends: 280 [2018-11-10 12:00:38,257 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=478, Invalid=3182, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 12:00:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-10 12:00:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-11-10 12:00:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-10 12:00:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 371 transitions. [2018-11-10 12:00:38,270 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 371 transitions. Word has length 67 [2018-11-10 12:00:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:38,270 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 371 transitions. [2018-11-10 12:00:38,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 12:00:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 371 transitions. [2018-11-10 12:00:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 12:00:38,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:38,271 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:38,271 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:38,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1964193486, now seen corresponding path program 3 times [2018-11-10 12:00:38,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:38,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:38,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:00:38,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:38,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 23 proven. 37 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 12:00:38,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:38,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:38,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:00:38,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:00:38,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:38,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:00:38,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:00:38,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 12:00:38,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:00:38,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:00:38,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 23 proven. 37 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 12:00:38,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:00:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 29 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 12:00:39,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:00:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 31 [2018-11-10 12:00:39,030 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:00:39,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:00:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:00:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2018-11-10 12:00:39,031 INFO L87 Difference]: Start difference. First operand 278 states and 371 transitions. Second operand 15 states. [2018-11-10 12:00:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:39,619 INFO L93 Difference]: Finished difference Result 500 states and 759 transitions. [2018-11-10 12:00:39,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-10 12:00:39,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-11-10 12:00:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:39,621 INFO L225 Difference]: With dead ends: 500 [2018-11-10 12:00:39,622 INFO L226 Difference]: Without dead ends: 498 [2018-11-10 12:00:39,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=782, Invalid=3508, Unknown=0, NotChecked=0, Total=4290 [2018-11-10 12:00:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-10 12:00:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 384. [2018-11-10 12:00:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-11-10 12:00:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 565 transitions. [2018-11-10 12:00:39,656 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 565 transitions. Word has length 74 [2018-11-10 12:00:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:39,657 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 565 transitions. [2018-11-10 12:00:39,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:00:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 565 transitions. [2018-11-10 12:00:39,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-10 12:00:39,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:00:39,659 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:00:39,660 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:00:39,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:00:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2099140299, now seen corresponding path program 3 times [2018-11-10 12:00:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:00:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:39,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:00:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:00:39,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:00:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:00:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-10 12:00:39,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:39,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:00:39,717 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:00:39,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:00:39,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:00:39,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:00:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:00:39,726 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 12:00:39,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:00:39,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:00:39,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:00:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:00:39,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:00:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 12:00:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:00:40,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 14 [2018-11-10 12:00:40,065 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:00:40,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:00:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:00:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:00:40,066 INFO L87 Difference]: Start difference. First operand 384 states and 565 transitions. Second operand 12 states. [2018-11-10 12:00:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:00:40,146 INFO L93 Difference]: Finished difference Result 397 states and 578 transitions. [2018-11-10 12:00:40,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:00:40,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-10 12:00:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:00:40,147 INFO L225 Difference]: With dead ends: 397 [2018-11-10 12:00:40,147 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:00:40,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:00:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:00:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:00:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:00:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:00:40,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-11-10 12:00:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:00:40,151 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:00:40,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:00:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:00:40,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:00:40,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:00:41,015 WARN L179 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 62 [2018-11-10 12:00:41,431 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 48 [2018-11-10 12:00:41,992 WARN L179 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 75 [2018-11-10 12:00:42,020 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:00:42,021 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 45) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 25 45) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 44) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* 2 main_~m~0))) (and (<= 0 .cse0) (<= .cse0 6) (<= 0 (* 2 main_~n~0)) (<= main_~n~0 23))) [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ackermannEXIT(lines 14 22) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ackermannErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ackermannErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point ackermannErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,021 INFO L425 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L21-2(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L421 ceAbstractionStarter]: At program point L19-2(line 19) the Hoare annotation is: (let ((.cse3 (* 2 |ackermann_#in~n|))) (let ((.cse2 (< 3 |ackermann_#in~m|)) (.cse4 (< .cse3 0)) (.cse6 (+ |ackermann_#in~m| |ackermann_#in~n|)) (.cse1 (< (* 2 |ackermann_#in~m|) 0)) (.cse5 (= |ackermann_#in~m| 0))) (and (or (let ((.cse0 (* 2 ackermann_~n))) (and (<= .cse0 40) (<= 0 ackermann_~m) (<= 0 .cse0) (<= ackermann_~m 3) (not (= ackermann_~m 0)))) .cse1 .cse2 (< 46 .cse3) .cse4) (or (and (<= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (<= ackermann_~n 3)) (< |ackermann_#in~m| 0) .cse2 .cse5 (< 42 .cse3) .cse4) (or (not (= |ackermann_#in~n| 2)) (< .cse6 2) (< 4 .cse6)) (or (< .cse3 2) (< 3 .cse6) .cse1) (or (< 4 |ackermann_#in~n|) (< (+ |ackermann_#in~n| 2147483648) 0) (not .cse5))))) [2018-11-10 12:00:42,022 INFO L421 ceAbstractionStarter]: At program point L21-4(line 21) the Hoare annotation is: (let ((.cse1 (* 2 ackermann_~n))) (and (or (< 4 |ackermann_#in~n|) (< (+ |ackermann_#in~n| 2147483648) 0) (not (= |ackermann_#in~m| 0))) (let ((.cse0 (+ |ackermann_#in~m| |ackermann_#in~n|))) (or (not (= |ackermann_#in~n| 2)) (< .cse0 2) (<= 4 .cse1) (< 4 .cse0))) (let ((.cse2 (* 2 |ackermann_#in~n|))) (or (and (<= ackermann_~n |ackermann_#in~n|) (not (= ackermann_~n 0)) (= ackermann_~m |ackermann_#in~m|) (<= 0 .cse1) (not (= ackermann_~m 0))) (< (* 2 |ackermann_#in~m|) 0) (< 3 |ackermann_#in~m|) (< 46 .cse2) (< .cse2 0))))) [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L21-5(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L421 ceAbstractionStarter]: At program point L21-6(line 21) the Hoare annotation is: (let ((.cse0 (* 2 |ackermann_#in~n|))) (let ((.cse3 (= |ackermann_#in~m| 0)) (.cse1 (< |ackermann_#in~m| 0)) (.cse2 (< 3 |ackermann_#in~m|)) (.cse5 (= ackermann_~m 1)) (.cse6 (= ackermann_~m |ackermann_#in~m|)) (.cse4 (< .cse0 0))) (and (or (< 40 .cse0) .cse1 .cse2 .cse3 .cse4) (or (< 4 |ackermann_#in~n|) (< (+ |ackermann_#in~n| 2147483648) 0) (not .cse3)) (or .cse1 (< 44 .cse0) .cse2 .cse3 .cse4 (and (<= |ackermann_#t~ret1| 3) .cse5 .cse6 (<= 4 (* 2 |ackermann_#t~ret1|)))) (or .cse1 (and (<= ackermann_~n (+ ackermann_~m 19)) (<= |ackermann_#t~ret1| (+ ackermann_~m 1))) .cse2 (< 42 .cse0) .cse4) (or (let ((.cse7 (* 2 ackermann_~n))) (and (<= .cse7 40) (not (= ackermann_~n 0)) (= |ackermann_#t~ret1| 2) (<= 3 (+ |ackermann_#t~ret1| ackermann_~m)) (<= 0 .cse7) (<= ackermann_~m 3))) (< (* 2 |ackermann_#in~m|) 0) .cse2 (and (<= ackermann_~n |ackermann_#in~n|) (<= 0 (+ |ackermann_#t~ret1| 2147483648)) (<= 2 (+ ackermann_~n ackermann_~m)) .cse5 (<= |ackermann_#t~ret1| 4) .cse6) (< 46 .cse0) .cse4)))) [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point L21-7(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point ackermannErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-10 12:00:42,022 INFO L425 ceAbstractionStarter]: For program point ackermannErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point ackermannErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point ackermannErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L428 ceAbstractionStarter]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 20) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point ackermannErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2018-11-10 12:00:42,023 INFO L425 ceAbstractionStarter]: For program point ackermannFINAL(lines 14 22) no Hoare annotation was computed. [2018-11-10 12:00:42,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:00:42 BoogieIcfgContainer [2018-11-10 12:00:42,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:00:42,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:00:42,025 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:00:42,025 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:00:42,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:55" (3/4) ... [2018-11-10 12:00:42,028 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:00:42,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:00:42,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:00:42,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2018-11-10 12:00:42,036 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 12:00:42,037 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:00:42,037 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:00:42,066 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77d76687-96a4-4c73-98ce-b7053973adfa/bin-2019/utaipan/witness.graphml [2018-11-10 12:00:42,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:00:42,067 INFO L168 Benchmark]: Toolchain (without parser) took 46610.13 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 960.8 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 765.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:00:42,068 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:00:42,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.45 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:00:42,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:00:42,068 INFO L168 Benchmark]: Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:00:42,068 INFO L168 Benchmark]: RCFGBuilder took 232.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:00:42,069 INFO L168 Benchmark]: TraceAbstraction took 46161.21 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-10 12:00:42,069 INFO L168 Benchmark]: Witness Printer took 41.78 ms. Allocated memory is still 5.4 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 12:00:42,073 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.45 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.0 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 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 950.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.41 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 232.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46161.21 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 41.78 ms. Allocated memory is still 5.4 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 8 error locations. SAFE Result, 46.1s OverallTime, 17 OverallIterations, 8 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 591 SDtfs, 1600 SDslu, 2373 SDs, 0 SdLazy, 3891 SolverSat, 830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 926 GetRequests, 520 SyntacticMatches, 14 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4066 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 25.8s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9168673087212412 AbsIntWeakeningRatio, 0.5955056179775281 AbsIntAvgWeakeningVarsNumRemoved, 15.348314606741573 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 244 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 905 PreInvPairs, 911 NumberOfFragments, 418 HoareAnnotationTreeSize, 905 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 9868 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 891 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1073 ConstructedInterpolants, 0 QuantifiedInterpolants, 137453 SizeOfPredicates, 16 NumberOfNonLiveVariables, 446 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 1033/1359 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...