./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:13:15,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:13:15,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:13:15,188 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:13:15,189 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:13:15,189 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:13:15,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:13:15,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:13:15,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:13:15,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:13:15,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:13:15,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:13:15,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:13:15,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:13:15,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:13:15,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:13:15,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:13:15,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:13:15,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:13:15,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:13:15,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:13:15,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:13:15,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:13:15,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:13:15,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:13:15,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:13:15,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:13:15,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:13:15,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:13:15,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:13:15,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:13:15,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:13:15,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:13:15,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:13:15,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:13:15,209 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:13:15,209 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:13:15,216 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:13:15,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:13:15,217 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:13:15,217 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:13:15,217 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:13:15,217 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:13:15,217 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:13:15,218 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:13:15,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:13:15,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:13:15,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:13:15,219 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:13:15,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:13:15,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:13:15,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:13:15,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:13:15,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:13:15,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:13:15,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:13:15,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:13:15,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:13:15,222 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_22f0b8de-f050-4071-9a6f-1142144c049f/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-11-18 16:13:15,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:13:15,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:13:15,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:13:15,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:13:15,258 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:13:15,259 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 16:13:15,298 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/data/ca68eec90/178f1a588a774509a5914c8323e396e8/FLAGbeb888327 [2018-11-18 16:13:15,591 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:13:15,591 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 16:13:15,595 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/data/ca68eec90/178f1a588a774509a5914c8323e396e8/FLAGbeb888327 [2018-11-18 16:13:15,604 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/data/ca68eec90/178f1a588a774509a5914c8323e396e8 [2018-11-18 16:13:15,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:13:15,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:13:15,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:13:15,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:13:15,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:13:15,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f35898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15, skipping insertion in model container [2018-11-18 16:13:15,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:13:15,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:13:15,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:13:15,731 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:13:15,740 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:13:15,748 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:13:15,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15 WrapperNode [2018-11-18 16:13:15,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:13:15,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:13:15,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:13:15,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:13:15,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:13:15,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:13:15,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:13:15,765 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:13:15,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... [2018-11-18 16:13:15,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:13:15,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:13:15,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:13:15,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:13:15,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:13:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:13:15,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:13:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:13:15,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:13:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:13:15,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:13:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 16:13:15,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 16:13:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 16:13:15,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 16:13:16,016 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:13:16,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:16 BoogieIcfgContainer [2018-11-18 16:13:16,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:13:16,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:13:16,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:13:16,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:13:16,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:13:15" (1/3) ... [2018-11-18 16:13:16,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c707e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:13:16, skipping insertion in model container [2018-11-18 16:13:16,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:13:15" (2/3) ... [2018-11-18 16:13:16,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c707e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:13:16, skipping insertion in model container [2018-11-18 16:13:16,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:16" (3/3) ... [2018-11-18 16:13:16,022 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-11-18 16:13:16,031 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:13:16,037 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:13:16,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:13:16,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:13:16,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:13:16,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:13:16,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:13:16,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:13:16,077 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:13:16,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:13:16,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:13:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 16:13:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 16:13:16,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:16,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:16,100 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:16,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-18 16:13:16,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:16,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:16,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:16,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:16,255 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-18 16:13:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:16,328 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 16:13:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:16,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 16:13:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:16,336 INFO L225 Difference]: With dead ends: 44 [2018-11-18 16:13:16,336 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 16:13:16,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 16:13:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 16:13:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 16:13:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 16:13:16,368 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-18 16:13:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:16,368 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 16:13:16,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 16:13:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 16:13:16,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:16,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:16,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:16,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-18 16:13:16,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:16,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:16,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:13:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:13:16,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:13:16,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:16,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:13:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:13:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:13:16,423 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-18 16:13:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:16,497 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 16:13:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:13:16,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 16:13:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:16,499 INFO L225 Difference]: With dead ends: 36 [2018-11-18 16:13:16,499 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 16:13:16,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:13:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 16:13:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 16:13:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 16:13:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 16:13:16,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-18 16:13:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:16,505 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 16:13:16,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:13:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 16:13:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:13:16,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:16,507 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:16,507 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:16,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-18 16:13:16,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:16,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:16,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:13:16,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:16,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:16,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 16:13:16,588 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2018-11-18 16:13:16,609 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:16,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:16,681 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:16,682 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 3. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-11-18 16:13:16,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,692 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:16,723 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:13:16,723 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:16,741 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-18 16:13:16,741 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:16,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:16,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 16:13:16,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:16,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:13:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:13:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:13:16,742 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-18 16:13:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:16,886 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-18 16:13:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:13:16,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 16:13:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:16,887 INFO L225 Difference]: With dead ends: 72 [2018-11-18 16:13:16,887 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:13:16,887 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:13:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:13:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 16:13:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 16:13:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 16:13:16,894 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-18 16:13:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:16,895 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 16:13:16,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:13:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 16:13:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 16:13:16,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:16,896 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-11-18 16:13:16,897 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:16,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-18 16:13:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:16,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:13:16,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:16,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:16,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 16:13:16,962 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 16:13:16,963 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:16,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:17,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:17,098 INFO L272 AbstractInterpreter]: Visited 28 different actions 313 times. Never merged. Widened at 2 different actions 18 times. Performed 647 root evaluator evaluations with a maximum evaluation depth of 4. Performed 647 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 29 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-18 16:13:17,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:17,100 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:17,113 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:13:17,113 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:17,166 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-18 16:13:17,166 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:17,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:17,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 16:13:17,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:17,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:13:17,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:13:17,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:13:17,169 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-18 16:13:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:17,359 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-18 16:13:17,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:13:17,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-18 16:13:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:17,360 INFO L225 Difference]: With dead ends: 87 [2018-11-18 16:13:17,360 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 16:13:17,361 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:13:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 16:13:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 16:13:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 16:13:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-18 16:13:17,368 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-18 16:13:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:17,368 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-18 16:13:17,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:13:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-18 16:13:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 16:13:17,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:17,370 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2018-11-18 16:13:17,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:17,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-18 16:13:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:17,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 16:13:17,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:17,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:17,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:17,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:17,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:17,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/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-18 16:13:17,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:13:17,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:13:17,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:13:17,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:17,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 16:13:17,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 16:13:17,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:17,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-18 16:13:17,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:13:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:13:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:13:17,807 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-18 16:13:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:17,956 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-18 16:13:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:13:17,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-18 16:13:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:17,958 INFO L225 Difference]: With dead ends: 121 [2018-11-18 16:13:17,958 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 16:13:17,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-18 16:13:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 16:13:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-18 16:13:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 16:13:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-18 16:13:17,969 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-18 16:13:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:17,969 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-18 16:13:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:13:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-18 16:13:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:13:17,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:17,971 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2018-11-18 16:13:17,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:17,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-18 16:13:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:17,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:17,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:13:18,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:18,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:18,023 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 16:13:18,023 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 16:13:18,024 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:18,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:18,823 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:18,823 INFO L272 AbstractInterpreter]: Visited 29 different actions 4700 times. Merged at 11 different actions 1218 times. Widened at 2 different actions 234 times. Performed 10886 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10886 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 580 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 16:13:18,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:18,836 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:18,846 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:13:18,846 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:18,882 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 16:13:18,882 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:18,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:18,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-18 16:13:18,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:18,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:13:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:13:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:13:18,883 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2018-11-18 16:13:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:19,168 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2018-11-18 16:13:19,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:13:19,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-18 16:13:19,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:19,169 INFO L225 Difference]: With dead ends: 109 [2018-11-18 16:13:19,170 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 16:13:19,171 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:13:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 16:13:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-18 16:13:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 16:13:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-11-18 16:13:19,180 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2018-11-18 16:13:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:19,180 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-18 16:13:19,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:13:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-11-18 16:13:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 16:13:19,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:19,182 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 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] [2018-11-18 16:13:19,182 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:19,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2018-11-18 16:13:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:19,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:19,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 16:13:19,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:19,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:19,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-11-18 16:13:19,250 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 16:13:19,252 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:19,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:27,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:13:27,234 INFO L272 AbstractInterpreter]: Visited 34 different actions 66808 times. Merged at 14 different actions 20936 times. Widened at 4 different actions 2001 times. Performed 164394 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9083 fixpoints after 10 different actions. Largest state had 5 variables. [2018-11-18 16:13:27,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:27,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:13:27,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:27,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/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-18 16:13:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:27,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:13:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:27,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 16:13:27,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 16:13:27,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:27,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 18 [2018-11-18 16:13:27,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:27,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:13:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:13:27,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:13:27,809 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 12 states. [2018-11-18 16:13:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:27,970 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2018-11-18 16:13:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:13:27,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-18 16:13:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:27,972 INFO L225 Difference]: With dead ends: 144 [2018-11-18 16:13:27,972 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 16:13:27,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:13:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 16:13:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-11-18 16:13:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 16:13:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-11-18 16:13:27,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 67 [2018-11-18 16:13:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:27,984 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-11-18 16:13:27,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:13:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-11-18 16:13:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 16:13:27,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:27,986 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 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] [2018-11-18 16:13:27,986 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:27,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash 650896746, now seen corresponding path program 1 times [2018-11-18 16:13:27,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:27,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 16:13:28,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:28,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:28,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-18 16:13:28,094 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2018-11-18 16:13:28,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:13:28,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:13:28,350 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:13:28,350 INFO L272 AbstractInterpreter]: Visited 29 different actions 3221 times. Merged at 11 different actions 850 times. Widened at 2 different actions 130 times. Performed 7908 root evaluator evaluations with a maximum evaluation depth of 4. Performed 7908 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 384 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 16:13:28,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:28,356 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:13:28,369 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 55.26% of their original sizes. [2018-11-18 16:13:28,370 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:13:28,420 INFO L415 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2018-11-18 16:13:28,421 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:13:28,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:13:28,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-11-18 16:13:28,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:13:28,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:13:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:13:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:13:28,422 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-11-18 16:13:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:28,883 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-11-18 16:13:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 16:13:28,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-11-18 16:13:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:28,884 INFO L225 Difference]: With dead ends: 136 [2018-11-18 16:13:28,884 INFO L226 Difference]: Without dead ends: 88 [2018-11-18 16:13:28,885 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:13:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-18 16:13:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-18 16:13:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 16:13:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-11-18 16:13:28,892 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-11-18 16:13:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:28,892 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-11-18 16:13:28,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:13:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-11-18 16:13:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 16:13:28,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:28,894 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:28,894 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:28,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1708632044, now seen corresponding path program 2 times [2018-11-18 16:13:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:28,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:28,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 68 proven. 48 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-18 16:13:28,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:28,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:28,974 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:28,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:28,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:28,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/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-18 16:13:28,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:13:28,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:13:28,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:13:28,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:28,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 15 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-18 16:13:29,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-18 16:13:29,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:29,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2018-11-18 16:13:29,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:29,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:13:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:13:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:13:29,253 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 16 states. [2018-11-18 16:13:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:29,556 INFO L93 Difference]: Finished difference Result 218 states and 340 transitions. [2018-11-18 16:13:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 16:13:29,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-11-18 16:13:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:29,558 INFO L225 Difference]: With dead ends: 218 [2018-11-18 16:13:29,558 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 16:13:29,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 202 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 16:13:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 16:13:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2018-11-18 16:13:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 16:13:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2018-11-18 16:13:29,573 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 108 [2018-11-18 16:13:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:29,573 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2018-11-18 16:13:29,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:13:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2018-11-18 16:13:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-18 16:13:29,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:29,575 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:29,576 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:29,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 388544251, now seen corresponding path program 3 times [2018-11-18 16:13:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:29,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:29,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 112 proven. 43 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-11-18 16:13:29,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:29,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:29,679 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:29,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:29,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:29,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:29,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:13:29,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:13:29,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:13:29,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:29,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 43 proven. 195 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-18 16:13:29,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 43 proven. 211 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2018-11-18 16:13:30,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:30,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 15] total 24 [2018-11-18 16:13:30,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:13:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:13:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:13:30,500 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand 17 states. [2018-11-18 16:13:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:30,806 INFO L93 Difference]: Finished difference Result 319 states and 576 transitions. [2018-11-18 16:13:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 16:13:30,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2018-11-18 16:13:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:30,809 INFO L225 Difference]: With dead ends: 319 [2018-11-18 16:13:30,809 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 16:13:30,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:13:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 16:13:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2018-11-18 16:13:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 16:13:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2018-11-18 16:13:30,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 148 [2018-11-18 16:13:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:30,829 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2018-11-18 16:13:30,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:13:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2018-11-18 16:13:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 16:13:30,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:30,833 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 15, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:30,833 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:30,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash -254279982, now seen corresponding path program 4 times [2018-11-18 16:13:30,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:30,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:30,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:30,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:30,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 214 proven. 206 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-11-18 16:13:30,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:30,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:30,921 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:30,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:30,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:30,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:30,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:30,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:13:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:30,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 107 proven. 510 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-11-18 16:13:31,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 107 proven. 534 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2018-11-18 16:13:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 23 [2018-11-18 16:13:32,181 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:32,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:13:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:13:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-18 16:13:32,182 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand 16 states. [2018-11-18 16:13:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:32,517 INFO L93 Difference]: Finished difference Result 356 states and 720 transitions. [2018-11-18 16:13:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 16:13:32,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 273 [2018-11-18 16:13:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:32,520 INFO L225 Difference]: With dead ends: 356 [2018-11-18 16:13:32,520 INFO L226 Difference]: Without dead ends: 210 [2018-11-18 16:13:32,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 516 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=964, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 16:13:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-18 16:13:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 149. [2018-11-18 16:13:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 16:13:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2018-11-18 16:13:32,544 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 273 [2018-11-18 16:13:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:32,544 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2018-11-18 16:13:32,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:13:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2018-11-18 16:13:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-11-18 16:13:32,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:32,550 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 21, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 8, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:32,550 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:32,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1080756655, now seen corresponding path program 5 times [2018-11-18 16:13:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:32,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 350 proven. 446 refuted. 0 times theorem prover too weak. 3531 trivial. 0 not checked. [2018-11-18 16:13:32,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:32,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:32,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:32,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:32,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:32,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:13:32,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:13:32,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-18 16:13:32,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:32,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 599 proven. 93 refuted. 0 times theorem prover too weak. 3635 trivial. 0 not checked. [2018-11-18 16:13:32,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4327 backedges. 603 proven. 99 refuted. 0 times theorem prover too weak. 3625 trivial. 0 not checked. [2018-11-18 16:13:33,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:33,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2018-11-18 16:13:33,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:33,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 16:13:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 16:13:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-18 16:13:33,717 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand 18 states. [2018-11-18 16:13:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:34,167 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2018-11-18 16:13:34,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 16:13:34,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 393 [2018-11-18 16:13:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:34,170 INFO L225 Difference]: With dead ends: 333 [2018-11-18 16:13:34,170 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 16:13:34,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 764 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 16:13:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 16:13:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 181. [2018-11-18 16:13:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 16:13:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2018-11-18 16:13:34,192 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 393 [2018-11-18 16:13:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:34,193 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2018-11-18 16:13:34,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 16:13:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2018-11-18 16:13:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-11-18 16:13:34,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:34,196 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 24, 24, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 9, 9, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:34,196 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:34,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1861364238, now seen corresponding path program 6 times [2018-11-18 16:13:34,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:34,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:34,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 229 proven. 589 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2018-11-18 16:13:34,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:34,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:34,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:34,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:34,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:34,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:13:34,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:13:34,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:13:34,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:34,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 210 proven. 843 refuted. 0 times theorem prover too weak. 4251 trivial. 0 not checked. [2018-11-18 16:13:34,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 210 proven. 864 refuted. 0 times theorem prover too weak. 4230 trivial. 0 not checked. [2018-11-18 16:13:35,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:35,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 17] total 24 [2018-11-18 16:13:35,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:35,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:13:35,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:13:35,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:13:35,711 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand 17 states. [2018-11-18 16:13:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:36,021 INFO L93 Difference]: Finished difference Result 396 states and 709 transitions. [2018-11-18 16:13:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 16:13:36,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 433 [2018-11-18 16:13:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:36,023 INFO L225 Difference]: With dead ends: 396 [2018-11-18 16:13:36,023 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 16:13:36,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 837 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 16:13:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 16:13:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2018-11-18 16:13:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-18 16:13:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2018-11-18 16:13:36,036 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 433 [2018-11-18 16:13:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:36,037 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2018-11-18 16:13:36,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:13:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2018-11-18 16:13:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-11-18 16:13:36,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:36,040 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 38, 38, 35, 30, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 16, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:36,040 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:36,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash 257147805, now seen corresponding path program 7 times [2018-11-18 16:13:36,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:36,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:36,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 809 proven. 221 refuted. 0 times theorem prover too weak. 7948 trivial. 0 not checked. [2018-11-18 16:13:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:36,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:36,281 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:36,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:36,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:36,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:36,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:13:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:36,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 335 proven. 885 refuted. 0 times theorem prover too weak. 7758 trivial. 0 not checked. [2018-11-18 16:13:36,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 337 proven. 899 refuted. 0 times theorem prover too weak. 7742 trivial. 0 not checked. [2018-11-18 16:13:37,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:37,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 20 [2018-11-18 16:13:37,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:37,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:13:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:13:37,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:13:37,535 INFO L87 Difference]: Start difference. First operand 172 states and 242 transitions. Second operand 14 states. [2018-11-18 16:13:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:37,667 INFO L93 Difference]: Finished difference Result 271 states and 471 transitions. [2018-11-18 16:13:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:13:37,667 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 558 [2018-11-18 16:13:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:37,669 INFO L225 Difference]: With dead ends: 271 [2018-11-18 16:13:37,669 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 16:13:37,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1137 GetRequests, 1097 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:13:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 16:13:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 185. [2018-11-18 16:13:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 16:13:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2018-11-18 16:13:37,681 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 558 [2018-11-18 16:13:37,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:37,682 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2018-11-18 16:13:37,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:13:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2018-11-18 16:13:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-11-18 16:13:37,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:37,685 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 44, 42, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 17, 16, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:37,685 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:37,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 268078154, now seen corresponding path program 8 times [2018-11-18 16:13:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:37,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15747 backedges. 619 proven. 1384 refuted. 0 times theorem prover too weak. 13744 trivial. 0 not checked. [2018-11-18 16:13:37,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:37,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:37,993 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:37,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:37,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:37,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:38,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:13:38,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:13:38,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-18 16:13:38,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:38,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15747 backedges. 7270 proven. 152 refuted. 0 times theorem prover too weak. 8325 trivial. 0 not checked. [2018-11-18 16:13:38,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15747 backedges. 1692 proven. 728 refuted. 0 times theorem prover too weak. 13327 trivial. 0 not checked. [2018-11-18 16:13:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:40,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 17] total 30 [2018-11-18 16:13:40,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:40,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 16:13:40,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 16:13:40,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2018-11-18 16:13:40,038 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand 21 states. [2018-11-18 16:13:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:40,591 INFO L93 Difference]: Finished difference Result 426 states and 804 transitions. [2018-11-18 16:13:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 16:13:40,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 735 [2018-11-18 16:13:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:40,593 INFO L225 Difference]: With dead ends: 426 [2018-11-18 16:13:40,594 INFO L226 Difference]: Without dead ends: 254 [2018-11-18 16:13:40,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1507 GetRequests, 1443 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 16:13:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-18 16:13:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2018-11-18 16:13:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-18 16:13:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 376 transitions. [2018-11-18 16:13:40,618 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 376 transitions. Word has length 735 [2018-11-18 16:13:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:40,618 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 376 transitions. [2018-11-18 16:13:40,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 16:13:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 376 transitions. [2018-11-18 16:13:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-11-18 16:13:40,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:40,623 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 41, 41, 35, 34, 22, 22, 22, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 15, 12, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:40,623 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:40,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2138518259, now seen corresponding path program 9 times [2018-11-18 16:13:40,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:40,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:40,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 737 proven. 1237 refuted. 0 times theorem prover too weak. 7930 trivial. 0 not checked. [2018-11-18 16:13:40,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:40,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:40,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:40,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:40,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:40,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:40,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:13:40,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:13:40,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:13:40,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:41,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 494 proven. 1078 refuted. 0 times theorem prover too weak. 8332 trivial. 0 not checked. [2018-11-18 16:13:41,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9904 backedges. 493 proven. 1100 refuted. 0 times theorem prover too weak. 8311 trivial. 0 not checked. [2018-11-18 16:13:42,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 18] total 34 [2018-11-18 16:13:42,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:42,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 16:13:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 16:13:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 16:13:42,744 INFO L87 Difference]: Start difference. First operand 240 states and 376 transitions. Second operand 26 states. [2018-11-18 16:13:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:43,611 INFO L93 Difference]: Finished difference Result 605 states and 1304 transitions. [2018-11-18 16:13:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 16:13:43,612 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 586 [2018-11-18 16:13:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:43,614 INFO L225 Difference]: With dead ends: 605 [2018-11-18 16:13:43,614 INFO L226 Difference]: Without dead ends: 212 [2018-11-18 16:13:43,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1143 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=2694, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 16:13:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-18 16:13:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2018-11-18 16:13:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 16:13:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 249 transitions. [2018-11-18 16:13:43,633 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 249 transitions. Word has length 586 [2018-11-18 16:13:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:43,634 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 249 transitions. [2018-11-18 16:13:43,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 16:13:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 249 transitions. [2018-11-18 16:13:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-11-18 16:13:43,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:43,637 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 41, 41, 36, 32, 22, 22, 22, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 16, 10, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:43,637 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:43,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1978964261, now seen corresponding path program 10 times [2018-11-18 16:13:43,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:43,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:43,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9874 backedges. 747 proven. 913 refuted. 0 times theorem prover too weak. 8214 trivial. 0 not checked. [2018-11-18 16:13:43,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:43,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:43,925 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:43,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:43,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:43,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:43,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:43,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:13:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:44,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9874 backedges. 591 proven. 772 refuted. 0 times theorem prover too weak. 8511 trivial. 0 not checked. [2018-11-18 16:13:44,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9874 backedges. 591 proven. 786 refuted. 0 times theorem prover too weak. 8497 trivial. 0 not checked. [2018-11-18 16:13:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16] total 28 [2018-11-18 16:13:45,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:45,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 16:13:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 16:13:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-11-18 16:13:45,306 INFO L87 Difference]: Start difference. First operand 200 states and 249 transitions. Second operand 21 states. [2018-11-18 16:13:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:45,779 INFO L93 Difference]: Finished difference Result 401 states and 538 transitions. [2018-11-18 16:13:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 16:13:45,780 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 585 [2018-11-18 16:13:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:45,781 INFO L225 Difference]: With dead ends: 401 [2018-11-18 16:13:45,781 INFO L226 Difference]: Without dead ends: 207 [2018-11-18 16:13:45,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1146 SyntacticMatches, 14 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=1719, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 16:13:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-18 16:13:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2018-11-18 16:13:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 16:13:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2018-11-18 16:13:45,795 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 585 [2018-11-18 16:13:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:45,796 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2018-11-18 16:13:45,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 16:13:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2018-11-18 16:13:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-11-18 16:13:45,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:45,800 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 43, 43, 37, 35, 24, 24, 24, 24, 24, 24, 24, 21, 21, 21, 21, 21, 21, 21, 16, 11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:45,800 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:45,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1952961044, now seen corresponding path program 11 times [2018-11-18 16:13:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:45,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:45,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11329 backedges. 1004 proven. 685 refuted. 0 times theorem prover too weak. 9640 trivial. 0 not checked. [2018-11-18 16:13:46,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:46,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:46,247 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:46,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:46,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:46,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:13:46,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:13:46,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:13:46,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:46,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 11329 backedges. 1275 proven. 21 refuted. 0 times theorem prover too weak. 10033 trivial. 0 not checked. [2018-11-18 16:13:46,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11329 backedges. 1275 proven. 21 refuted. 0 times theorem prover too weak. 10033 trivial. 0 not checked. [2018-11-18 16:13:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 25 [2018-11-18 16:13:47,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:47,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 16:13:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 16:13:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:13:47,264 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand 21 states. [2018-11-18 16:13:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:47,633 INFO L93 Difference]: Finished difference Result 353 states and 444 transitions. [2018-11-18 16:13:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 16:13:47,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 625 [2018-11-18 16:13:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:47,634 INFO L225 Difference]: With dead ends: 353 [2018-11-18 16:13:47,634 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 16:13:47,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1287 GetRequests, 1236 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 16:13:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 16:13:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2018-11-18 16:13:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 16:13:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2018-11-18 16:13:47,642 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 625 [2018-11-18 16:13:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:47,643 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2018-11-18 16:13:47,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 16:13:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2018-11-18 16:13:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-11-18 16:13:47,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:47,645 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 35, 35, 30, 29, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 13, 10, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:47,646 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:47,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1638954211, now seen corresponding path program 12 times [2018-11-18 16:13:47,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:47,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:47,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:47,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 1313 proven. 334 refuted. 0 times theorem prover too weak. 5614 trivial. 0 not checked. [2018-11-18 16:13:47,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:47,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:47,857 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:47,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:47,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:47,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:13:47,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:13:47,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:13:47,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:13:47,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 948 proven. 208 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-11-18 16:13:48,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7261 backedges. 946 proven. 224 refuted. 0 times theorem prover too weak. 6091 trivial. 0 not checked. [2018-11-18 16:13:49,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:49,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 16] total 29 [2018-11-18 16:13:49,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:49,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 16:13:49,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 16:13:49,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:13:49,086 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand 22 states. [2018-11-18 16:13:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:49,645 INFO L93 Difference]: Finished difference Result 215 states and 255 transitions. [2018-11-18 16:13:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 16:13:49,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 504 [2018-11-18 16:13:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:49,647 INFO L225 Difference]: With dead ends: 215 [2018-11-18 16:13:49,647 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 16:13:49,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 987 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=388, Invalid=1964, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 16:13:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 16:13:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2018-11-18 16:13:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 16:13:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-11-18 16:13:49,659 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 504 [2018-11-18 16:13:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:49,659 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-11-18 16:13:49,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 16:13:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-11-18 16:13:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-11-18 16:13:49,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:49,662 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 28, 28, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 16, 12, 10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:49,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:49,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -227402005, now seen corresponding path program 13 times [2018-11-18 16:13:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:49,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:13:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:49,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 908 proven. 35 refuted. 0 times theorem prover too weak. 5537 trivial. 0 not checked. [2018-11-18 16:13:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:49,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:13:49,924 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:13:49,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 16:13:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:13:49,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:13:49,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:49,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:13:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:13:50,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:13:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 785 proven. 130 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2018-11-18 16:13:50,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:13:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 783 proven. 142 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-11-18 16:13:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:13:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 25 [2018-11-18 16:13:50,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:13:50,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 16:13:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 16:13:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:13:50,945 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 19 states. [2018-11-18 16:13:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:13:51,195 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2018-11-18 16:13:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 16:13:51,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 477 [2018-11-18 16:13:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:13:51,196 INFO L225 Difference]: With dead ends: 214 [2018-11-18 16:13:51,196 INFO L226 Difference]: Without dead ends: 196 [2018-11-18 16:13:51,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 931 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:13:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-18 16:13:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2018-11-18 16:13:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-18 16:13:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2018-11-18 16:13:51,208 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 477 [2018-11-18 16:13:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:13:51,208 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2018-11-18 16:13:51,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 16:13:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2018-11-18 16:13:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 16:13:51,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:13:51,211 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:13:51,211 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:13:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:13:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 14 times [2018-11-18 16:13:51,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:13:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:51,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:13:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:13:51,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:13:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:13:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:13:51,282 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:13:51,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:13:51 BoogieIcfgContainer [2018-11-18 16:13:51,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:13:51,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:13:51,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:13:51,330 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:13:51,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:13:16" (3/4) ... [2018-11-18 16:13:51,335 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:13:51,405 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_22f0b8de-f050-4071-9a6f-1142144c049f/bin-2019/utaipan/witness.graphml [2018-11-18 16:13:51,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:13:51,406 INFO L168 Benchmark]: Toolchain (without parser) took 35798.90 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 959.1 MB in the beginning and 1.5 GB in the end (delta: -540.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-18 16:13:51,407 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:13:51,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:13:51,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.57 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:13:51,408 INFO L168 Benchmark]: Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:13:51,408 INFO L168 Benchmark]: RCFGBuilder took 235.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:13:51,408 INFO L168 Benchmark]: TraceAbstraction took 35313.37 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-18 16:13:51,408 INFO L168 Benchmark]: Witness Printer took 75.11 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 16:13:51,410 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.24 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 16.57 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.25 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 235.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35313.37 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -378.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 75.11 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 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: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L13] EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L13] EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L23] EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L23] EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] RET return fibo2(n-1) + fibo2(n-2); [L23] EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] RET return fibo1(n-1) + fibo1(n-2); [L13] EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] RET return fibo2(n-1) + fibo2(n-2); [L37] EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 35.2s OverallTime, 21 OverallIterations, 54 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 760 SDtfs, 1237 SDslu, 6004 SDs, 0 SdLazy, 7518 SolverSat, 1277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 11696 GetRequests, 10952 SyntacticMatches, 167 SemanticMatches, 577 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4636 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8604060913705583 AbsIntWeakeningRatio, 0.5685279187817259 AbsIntAvgWeakeningVarsNumRemoved, 0.20812182741116753 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 421 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 11779 NumberOfCodeBlocks, 10303 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 16812 ConstructedInterpolants, 0 QuantifiedInterpolants, 10542854 SizeOfPredicates, 93 NumberOfNonLiveVariables, 8870 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 48 InterpolantComputations, 2 PerfectInterpolantSequences, 229764/246617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...