./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2f1e635c5c806286d01eb0b8ff07448b8253a7a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 07:01:27,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:01:27,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:01:27,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:01:27,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:01:27,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:01:27,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:01:27,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:01:27,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:01:27,577 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:01:27,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:01:27,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:01:27,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:01:27,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:01:27,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:01:27,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:01:27,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:01:27,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:01:27,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:01:27,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:01:27,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:01:27,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:01:27,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:01:27,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:01:27,589 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:01:27,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:01:27,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:01:27,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:01:27,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:01:27,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:01:27,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:01:27,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:01:27,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:01:27,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:01:27,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:01:27,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:01:27,594 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:01:27,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:01:27,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:01:27,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:01:27,605 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:01:27,606 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:01:27,606 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:01:27,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:01:27,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:01:27,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:01:27,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:01:27,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:01:27,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:01:27,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:01:27,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:01:27,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:01:27,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:01:27,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:01:27,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:01:27,610 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:01:27,610 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_13206677-eac9-456a-a5df-74e972ef6030/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 ! call(__VERIFIER_error())) ) 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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2018-11-10 07:01:27,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:01:27,641 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:01:27,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:01:27,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:01:27,644 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:01:27,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c [2018-11-10 07:01:27,681 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/data/e262000c4/690be7d501d5429698ac0b7d9ec8c194/FLAG9103acbcb [2018-11-10 07:01:28,075 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:01:28,075 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/sv-benchmarks/c/recursive/Ackermann01_true-unreach-call_true-no-overflow.c [2018-11-10 07:01:28,079 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/data/e262000c4/690be7d501d5429698ac0b7d9ec8c194/FLAG9103acbcb [2018-11-10 07:01:28,088 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/data/e262000c4/690be7d501d5429698ac0b7d9ec8c194 [2018-11-10 07:01:28,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:01:28,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:01:28,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:01:28,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:01:28,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:01:28,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28, skipping insertion in model container [2018-11-10 07:01:28,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:01:28,115 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:01:28,218 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:01:28,220 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:01:28,231 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:01:28,239 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:01:28,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28 WrapperNode [2018-11-10 07:01:28,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:01:28,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:01:28,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:01:28,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:01:28,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:01:28,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:01:28,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:01:28,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:01:28,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... [2018-11-10 07:01:28,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:01:28,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:01:28,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:01:28,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:01:28,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/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 07:01:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:01:28,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:01:28,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:01:28,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:01:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:01:28,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:01:28,334 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2018-11-10 07:01:28,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2018-11-10 07:01:28,446 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:01:28,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:01:28 BoogieIcfgContainer [2018-11-10 07:01:28,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:01:28,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:01:28,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:01:28,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:01:28,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:01:28" (1/3) ... [2018-11-10 07:01:28,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4f7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:01:28, skipping insertion in model container [2018-11-10 07:01:28,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:01:28" (2/3) ... [2018-11-10 07:01:28,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4f7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:01:28, skipping insertion in model container [2018-11-10 07:01:28,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:01:28" (3/3) ... [2018-11-10 07:01:28,453 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01_true-unreach-call_true-no-overflow.c [2018-11-10 07:01:28,461 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:01:28,466 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:01:28,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:01:28,499 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:01:28,499 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:01:28,499 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:01:28,499 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:01:28,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:01:28,499 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:01:28,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:01:28,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:01:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-10 07:01:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:01:28,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:28,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:28,521 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:28,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1560979177, now seen corresponding path program 1 times [2018-11-10 07:01:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:28,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:28,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:28,662 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 07:01:28,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:01:28,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:01:28,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:01:28,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:01:28,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:01:28,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:01:28,675 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 7 states. [2018-11-10 07:01:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:28,828 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-10 07:01:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:01:28,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-10 07:01:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:28,839 INFO L225 Difference]: With dead ends: 41 [2018-11-10 07:01:28,839 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 07:01:28,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:01:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 07:01:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 07:01:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 07:01:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-11-10 07:01:28,872 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 15 [2018-11-10 07:01:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:28,873 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-11-10 07:01:28,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:01:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-11-10 07:01:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:01:28,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:28,875 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:28,875 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:28,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash -649197850, now seen corresponding path program 1 times [2018-11-10 07:01:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:28,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:28,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:28,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:01:28,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:28,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:28,950 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-10 07:01:28,952 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [20], [23], [26], [27], [30], [32], [38], [39], [40], [41], [43], [44], [45], [46] [2018-11-10 07:01:28,987 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:01:28,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:01:29,099 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:01:29,101 INFO L272 AbstractInterpreter]: Visited 19 different actions 26 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 07:01:29,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:29,108 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:01:29,177 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 69.44% of their original sizes. [2018-11-10 07:01:29,178 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:01:29,369 INFO L415 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2018-11-10 07:01:29,369 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:01:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:01:29,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-11-10 07:01:29,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:01:29,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:01:29,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:01:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:01:29,372 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 16 states. [2018-11-10 07:01:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:30,244 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2018-11-10 07:01:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:01:30,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-10 07:01:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:30,245 INFO L225 Difference]: With dead ends: 71 [2018-11-10 07:01:30,246 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 07:01:30,247 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:01:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 07:01:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-10 07:01:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 07:01:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-10 07:01:30,258 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 22 [2018-11-10 07:01:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:30,258 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-10 07:01:30,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:01:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-10 07:01:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:01:30,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:30,261 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:30,264 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:30,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -686607617, now seen corresponding path program 1 times [2018-11-10 07:01:30,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:30,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:01:30,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:30,301 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:30,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-10 07:01:30,302 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [20], [23], [26], [27], [33], [35], [37], [38], [39], [40], [41], [43], [44], [47], [48], [49], [50] [2018-11-10 07:01:30,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:01:30,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:01:30,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:01:30,322 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2018-11-10 07:01:30,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:30,323 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:01:30,345 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 60% of their original sizes. [2018-11-10 07:01:30,345 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:01:30,437 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-10 07:01:30,437 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:01:30,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:01:30,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 17 [2018-11-10 07:01:30,437 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:01:30,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:01:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:01:30,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:01:30,438 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 14 states. [2018-11-10 07:01:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:31,012 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2018-11-10 07:01:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 07:01:31,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-10 07:01:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:31,013 INFO L225 Difference]: With dead ends: 124 [2018-11-10 07:01:31,013 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 07:01:31,014 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:01:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 07:01:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-10 07:01:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 07:01:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2018-11-10 07:01:31,030 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 28 [2018-11-10 07:01:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:31,030 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-10 07:01:31,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:01:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2018-11-10 07:01:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 07:01:31,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:31,032 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:31,032 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:31,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 84169022, now seen corresponding path program 1 times [2018-11-10 07:01:31,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:31,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:01:31,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:31,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:31,114 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-10 07:01:31,114 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [20], [23], [26], [27], [30], [32], [33], [35], [37], [38], [39], [40], [41], [43], [44], [45], [46], [47], [48], [49], [50] [2018-11-10 07:01:31,115 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:01:31,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:01:39,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:01:39,919 INFO L272 AbstractInterpreter]: Visited 26 different actions 37639 times. Merged at 9 different actions 3463 times. Widened at 2 different actions 1977 times. Found 2363 fixpoints after 7 different actions. Largest state had 8 variables. [2018-11-10 07:01:39,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:39,928 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:01:39,961 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 62.42% of their original sizes. [2018-11-10 07:01:39,961 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:01:40,240 INFO L415 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2018-11-10 07:01:40,240 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:01:40,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:01:40,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [11] total 34 [2018-11-10 07:01:40,241 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:01:40,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 07:01:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 07:01:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-11-10 07:01:40,242 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 25 states. [2018-11-10 07:01:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:42,988 INFO L93 Difference]: Finished difference Result 187 states and 251 transitions. [2018-11-10 07:01:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 07:01:42,988 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-11-10 07:01:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:42,990 INFO L225 Difference]: With dead ends: 187 [2018-11-10 07:01:42,990 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 07:01:42,991 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=352, Invalid=1904, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 07:01:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 07:01:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-11-10 07:01:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 07:01:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-10 07:01:43,010 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 35 [2018-11-10 07:01:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:43,010 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-10 07:01:43,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 07:01:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-10 07:01:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:01:43,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:43,014 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:43,014 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:43,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1759693041, now seen corresponding path program 2 times [2018-11-10 07:01:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:43,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:43,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:43,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:01:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:43,209 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:43,209 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:01:43,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:01:43,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:43,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/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 07:01:43,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:01:43,223 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:01:43,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 07:01:43,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:01:43,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:01:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 07:01:43,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:01:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 07:01:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:01:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 24 [2018-11-10 07:01:43,836 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:01:43,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:01:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:01:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-11-10 07:01:43,837 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 12 states. [2018-11-10 07:01:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:44,030 INFO L93 Difference]: Finished difference Result 167 states and 259 transitions. [2018-11-10 07:01:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:01:44,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-10 07:01:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:44,033 INFO L225 Difference]: With dead ends: 167 [2018-11-10 07:01:44,033 INFO L226 Difference]: Without dead ends: 158 [2018-11-10 07:01:44,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:01:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-10 07:01:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2018-11-10 07:01:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 07:01:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 228 transitions. [2018-11-10 07:01:44,057 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 228 transitions. Word has length 42 [2018-11-10 07:01:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:44,057 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 228 transitions. [2018-11-10 07:01:44,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:01:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 228 transitions. [2018-11-10 07:01:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 07:01:44,059 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:44,059 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:44,060 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:44,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1485881533, now seen corresponding path program 3 times [2018-11-10 07:01:44,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:44,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:01:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:44,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 07:01:44,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:44,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:44,139 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:01:44,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:01:44,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:44,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/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 07:01:44,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:01:44,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:01:44,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:01:44,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:01:44,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:01:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 35 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 07:01:44,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:01:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:01:44,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:01:44,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2018-11-10 07:01:44,621 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:01:44,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:01:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:01:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:01:44,622 INFO L87 Difference]: Start difference. First operand 143 states and 228 transitions. Second operand 16 states. [2018-11-10 07:01:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:44,941 INFO L93 Difference]: Finished difference Result 311 states and 590 transitions. [2018-11-10 07:01:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 07:01:44,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-11-10 07:01:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:44,944 INFO L225 Difference]: With dead ends: 311 [2018-11-10 07:01:44,944 INFO L226 Difference]: Without dead ends: 211 [2018-11-10 07:01:44,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=769, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:01:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-10 07:01:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-11-10 07:01:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 07:01:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 311 transitions. [2018-11-10 07:01:44,971 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 311 transitions. Word has length 55 [2018-11-10 07:01:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:44,972 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 311 transitions. [2018-11-10 07:01:44,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:01:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 311 transitions. [2018-11-10 07:01:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 07:01:44,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:01:44,975 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:01:44,975 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:01:44,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:01:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1488933232, now seen corresponding path program 4 times [2018-11-10 07:01:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:01:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:44,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:01:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:01:44,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:01:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 63 proven. 81 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 07:01:45,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:45,061 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:01:45,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:01:45,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:01:45,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:01:45,062 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/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 07:01:45,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:01:45,076 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:01:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:01:45,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:01:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 97 proven. 37 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-10 07:01:45,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:01:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 83 proven. 43 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-10 07:01:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:01:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2018-11-10 07:01:45,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:01:45,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 07:01:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 07:01:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:01:45,933 INFO L87 Difference]: Start difference. First operand 185 states and 311 transitions. Second operand 20 states. [2018-11-10 07:01:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:01:46,290 INFO L93 Difference]: Finished difference Result 269 states and 485 transitions. [2018-11-10 07:01:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 07:01:46,290 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-10 07:01:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:01:46,291 INFO L225 Difference]: With dead ends: 269 [2018-11-10 07:01:46,291 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:01:46,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=456, Invalid=1994, Unknown=0, NotChecked=0, Total=2450 [2018-11-10 07:01:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:01:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:01:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:01:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:01:46,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-11-10 07:01:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:01:46,294 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:01:46,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 07:01:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:01:46,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:01:46,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:01:47,008 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 52 [2018-11-10 07:01:47,534 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 55 [2018-11-10 07:01:47,671 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 30 [2018-11-10 07:01:47,674 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:01:47,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:01:47,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:01:47,674 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:01:47,674 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:01:47,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:01:47,674 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 26 46) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 26 46) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 45) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (* 2 main_~m~0)) (.cse1 (* 2 main_~n~0))) (and (<= 0 .cse0) (<= .cse0 6) (<= 0 .cse1) (<= .cse1 46))) [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2018-11-10 07:01:47,675 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 39) no Hoare annotation was computed. [2018-11-10 07:01:47,676 INFO L425 ceAbstractionStarter]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2018-11-10 07:01:47,676 INFO L421 ceAbstractionStarter]: At program point L22(line 22) the Hoare annotation is: (let ((.cse3 (* 2 |ackermann_#in~n|)) (.cse5 (* 2 |ackermann_#in~m|))) (let ((.cse0 (< .cse5 0)) (.cse1 (* 2 ackermann_~n)) (.cse2 (< 6 .cse5)) (.cse4 (< .cse3 0))) (and (or (and (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n)) (< |ackermann_#in~m| 1)) (or (not (= |ackermann_#in~n| 1)) (< 3 (+ |ackermann_#in~m| |ackermann_#in~n|)) .cse0 (<= .cse1 2)) (or (and (not (= ackermann_~n 0)) (<= .cse1 46)) .cse0 .cse2 (< 46 .cse3) .cse4) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|)) (or (< 44 .cse3) (<= .cse1 44) .cse2 .cse4 (< .cse5 2))))) [2018-11-10 07:01:47,676 INFO L428 ceAbstractionStarter]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2018-11-10 07:01:47,676 INFO L425 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-11-10 07:01:47,676 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (or (< (* 2 |ackermann_#in~m|) 0) (< (+ |ackermann_#in~n| 3) |ackermann_#in~m|) (< (* 2 |ackermann_#in~n|) 0) (<= (* 2 ackermann_~n) 44)) (or (< |ackermann_#in~m| 0) (and (<= |ackermann_#in~n| 0) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (<= |ackermann_#in~n| ackermann_~n)))) [2018-11-10 07:01:47,676 INFO L421 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse2 (* 2 |ackermann_#in~n|)) (.cse7 (* 2 |ackermann_#in~m|))) (let ((.cse1 (< 6 .cse7)) (.cse4 (* 2 ackermann_~n)) (.cse0 (< .cse7 0)) (.cse3 (< .cse2 0))) (and (or .cse0 .cse1 (< 46 .cse2) .cse3 (<= .cse4 46)) (or (<= .cse4 2) (not (= |ackermann_#in~n| 1)) (< 3 (+ |ackermann_#in~m| |ackermann_#in~n|)) .cse0) (or (< |ackermann_#in~m| 0) (< 0 |ackermann_#in~m|)) (or .cse1 (and (not (= ackermann_~n 0)) (<= .cse4 44)) (< 44 .cse2) .cse0 .cse3) (let ((.cse5 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (<= |ackermann_#in~n| ackermann_~n))) (or (< |ackermann_#in~m| 1) (and (<= 3 |ackermann_#t~ret1|) .cse5 .cse6) (and .cse5 .cse6 (<= |ackermann_#in~m| 1) (<= 2 |ackermann_#t~ret1|))))))) [2018-11-10 07:01:47,676 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2018-11-10 07:01:47,677 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 07:01:47,677 INFO L425 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2018-11-10 07:01:47,677 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. [2018-11-10 07:01:47,677 INFO L425 ceAbstractionStarter]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2018-11-10 07:01:47,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:01:47 BoogieIcfgContainer [2018-11-10 07:01:47,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:01:47,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:01:47,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:01:47,680 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:01:47,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:01:28" (3/4) ... [2018-11-10 07:01:47,683 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:01:47,688 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:01:47,688 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:01:47,688 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2018-11-10 07:01:47,692 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 07:01:47,692 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 07:01:47,692 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:01:47,722 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13206677-eac9-456a-a5df-74e972ef6030/bin-2019/utaipan/witness.graphml [2018-11-10 07:01:47,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:01:47,723 INFO L168 Benchmark]: Toolchain (without parser) took 19633.13 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 959.2 MB in the beginning and 997.8 MB in the end (delta: -38.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 07:01:47,724 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:01:47,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.75 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:47,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.63 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:01:47,725 INFO L168 Benchmark]: Boogie Preprocessor took 10.20 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:47,725 INFO L168 Benchmark]: RCFGBuilder took 184.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:01:47,725 INFO L168 Benchmark]: TraceAbstraction took 19231.40 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 132.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 07:01:47,728 INFO L168 Benchmark]: Witness Printer took 43.31 ms. Allocated memory is still 2.8 GB. Free memory is still 997.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:01:47,729 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 148.75 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.63 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.20 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19231.40 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 132.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 43.31 ms. Allocated memory is still 2.8 GB. Free memory is still 997.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 19.1s OverallTime, 7 OverallIterations, 10 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 346 SDslu, 1119 SDs, 0 SdLazy, 1322 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 553 GetRequests, 333 SyntacticMatches, 17 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.9s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.9062862950058072 AbsIntWeakeningRatio, 0.7926829268292683 AbsIntAvgWeakeningVarsNumRemoved, 7.670731707317073 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 81 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 369 PreInvPairs, 427 NumberOfFragments, 303 HoareAnnotationTreeSize, 369 FomulaSimplifications, 1938 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 5182 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 444 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 603 ConstructedInterpolants, 0 QuantifiedInterpolants, 70989 SizeOfPredicates, 16 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 826/1103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...