./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_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_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:50:09,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:50:09,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:50:09,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:50:09,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:50:09,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:50:09,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:50:09,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:50:09,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:50:09,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:50:09,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:50:09,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:50:09,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:50:09,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:50:09,697 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:50:09,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:50:09,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:50:09,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:50:09,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:50:09,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:50:09,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:50:09,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:50:09,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:50:09,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:50:09,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:50:09,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:50:09,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:50:09,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:50:09,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:50:09,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:50:09,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:50:09,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:50:09,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:50:09,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:50:09,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:50:09,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:50:09,711 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:50:09,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:50:09,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:50:09,722 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:50:09,722 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:50:09,722 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:50:09,722 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:50:09,722 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:50:09,722 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:50:09,722 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:50:09,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:50:09,723 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:50:09,724 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:50:09,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:50:09,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:50:09,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:50:09,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:50:09,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:50:09,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:50:09,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:50:09,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:50:09,726 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_e4f160f1-a236-4033-bc8d-86bce8e242ca/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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2018-11-18 16:50:09,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:50:09,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:50:09,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:50:09,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:50:09,758 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:50:09,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-18 16:50:09,795 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/data/60310b301/9dd39cd4c077456b808977f0837962d8/FLAGd967553c0 [2018-11-18 16:50:10,192 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:50:10,193 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/sv-benchmarks/c/recursive-simple/fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-18 16:50:10,196 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/data/60310b301/9dd39cd4c077456b808977f0837962d8/FLAGd967553c0 [2018-11-18 16:50:10,205 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/data/60310b301/9dd39cd4c077456b808977f0837962d8 [2018-11-18 16:50:10,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:50:10,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:50:10,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:50:10,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:50:10,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:50:10,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4619e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10, skipping insertion in model container [2018-11-18 16:50:10,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:50:10,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:50:10,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:50:10,335 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:50:10,345 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:50:10,353 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:50:10,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10 WrapperNode [2018-11-18 16:50:10,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:50:10,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:50:10,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:50:10,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:50:10,359 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:50:10" (1/1) ... [2018-11-18 16:50:10,362 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:50:10" (1/1) ... [2018-11-18 16:50:10,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:50:10,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:50:10,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:50:10,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:50:10,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... [2018-11-18 16:50:10,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:50:10,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:50:10,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:50:10,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:50:10,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:50:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:50:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:50:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:50:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:50:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:50:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-11-18 16:50:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-11-18 16:50:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-11-18 16:50:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-11-18 16:50:10,579 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:50:10,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:50:10 BoogieIcfgContainer [2018-11-18 16:50:10,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:50:10,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:50:10,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:50:10,582 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:50:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:50:10" (1/3) ... [2018-11-18 16:50:10,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7153cf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:50:10, skipping insertion in model container [2018-11-18 16:50:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:50:10" (2/3) ... [2018-11-18 16:50:10,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7153cf7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:50:10, skipping insertion in model container [2018-11-18 16:50:10,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:50:10" (3/3) ... [2018-11-18 16:50:10,586 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6_false-unreach-call_true-termination.c [2018-11-18 16:50:10,595 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:50:10,600 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:50:10,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:50:10,637 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:50:10,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:50:10,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:50:10,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:50:10,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:50:10,638 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:50:10,638 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:50:10,638 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:50:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 16:50:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 16:50:10,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:10,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:10,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:10,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-11-18 16:50:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:10,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:10,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:10,798 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:50:10,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:50:10,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:50:10,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:10,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:50:10,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:50:10,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:50:10,812 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-11-18 16:50:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:10,874 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-18 16:50:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:50:10,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 16:50:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:10,881 INFO L225 Difference]: With dead ends: 44 [2018-11-18 16:50:10,881 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 16:50:10,883 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:50:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 16:50:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 16:50:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 16:50:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 16:50:10,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-11-18 16:50:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:10,913 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 16:50:10,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:50:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 16:50:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 16:50:10,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:10,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:10,915 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:10,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-11-18 16:50:10,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:10,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:10,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:10,949 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:50:10,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:50:10,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:50:10,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:10,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:50:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:50:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:50:10,951 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-11-18 16:50:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:11,010 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 16:50:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:50:11,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 16:50:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:11,011 INFO L225 Difference]: With dead ends: 36 [2018-11-18 16:50:11,011 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 16:50:11,012 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:50:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 16:50:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 16:50:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 16:50:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-18 16:50:11,018 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-11-18 16:50:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-18 16:50:11,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:50:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-18 16:50:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:50:11,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:11,019 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:50:11,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:11,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-11-18 16:50:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:11,106 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:50:11,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:11,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:11,107 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 16:50:11,108 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:50:11,133 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:50:11,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:50:11,201 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:50:11,201 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:50:11,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:11,206 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:50:11,236 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:50:11,236 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:50:11,257 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-18 16:50:11,257 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:50:11,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:50:11,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-18 16:50:11,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:11,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:50:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:50:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:50:11,259 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2018-11-18 16:50:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:11,423 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2018-11-18 16:50:11,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:50:11,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-18 16:50:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:11,424 INFO L225 Difference]: With dead ends: 72 [2018-11-18 16:50:11,424 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 16:50:11,425 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:50:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 16:50:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-18 16:50:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 16:50:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 16:50:11,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2018-11-18 16:50:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:11,431 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 16:50:11,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:50:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 16:50:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 16:50:11,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:11,432 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:50:11,432 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:11,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-11-18 16:50:11,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:11,488 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:50:11,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:11,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:11,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-11-18 16:50:11,489 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:50:11,490 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:50:11,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:50:11,584 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:50:11,584 INFO L272 AbstractInterpreter]: Visited 28 different actions 200 times. Never merged. Widened at 2 different actions 11 times. Performed 411 root evaluator evaluations with a maximum evaluation depth of 4. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 18 fixpoints after 6 different actions. Largest state had 5 variables. [2018-11-18 16:50:11,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:11,586 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:50:11,599 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:50:11,599 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:50:11,624 INFO L415 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2018-11-18 16:50:11,624 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:50:11,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:50:11,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 16:50:11,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:11,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:50:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:50:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:50:11,625 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2018-11-18 16:50:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:11,858 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-11-18 16:50:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:50:11,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-18 16:50:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:11,859 INFO L225 Difference]: With dead ends: 87 [2018-11-18 16:50:11,859 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 16:50:11,860 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:50:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 16:50:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-18 16:50:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 16:50:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-18 16:50:11,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2018-11-18 16:50:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:11,865 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-18 16:50:11,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:50:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-18 16:50:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 16:50:11,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:11,867 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:50:11,867 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:11,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2018-11-18 16:50:11,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:11,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:11,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:11,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:11,929 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:50:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:11,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:11,930 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:50:11,931 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:50:11,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:11,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:50:11,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:50:11,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:50:11,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:11,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:12,038 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:50:12,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:12,292 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:50:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2018-11-18 16:50:12,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:50:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:50:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:50:12,309 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2018-11-18 16:50:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:12,467 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-11-18 16:50:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:50:12,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-18 16:50:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:12,469 INFO L225 Difference]: With dead ends: 121 [2018-11-18 16:50:12,470 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 16:50:12,471 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:50:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 16:50:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2018-11-18 16:50:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 16:50:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-18 16:50:12,482 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2018-11-18 16:50:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:12,482 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-18 16:50:12,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:50:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-18 16:50:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 16:50:12,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:12,484 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:50:12,484 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2018-11-18 16:50:12,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:12,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:12,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:12,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:12,534 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:50:12,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:12,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:12,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-18 16:50:12,535 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:50:12,536 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:50:12,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:50:13,468 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:50:13,468 INFO L272 AbstractInterpreter]: Visited 29 different actions 3929 times. Merged at 11 different actions 1050 times. Widened at 2 different actions 189 times. Performed 9241 root evaluator evaluations with a maximum evaluation depth of 4. Performed 9241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 481 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 16:50:13,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:13,473 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:50:13,487 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 56.25% of their original sizes. [2018-11-18 16:50:13,487 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:50:13,563 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-18 16:50:13,563 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:50:13,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:50:13,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-11-18 16:50:13,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:13,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:50:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:50:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:50:13,565 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 13 states. [2018-11-18 16:50:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:14,019 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2018-11-18 16:50:14,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:50:14,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-11-18 16:50:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:14,020 INFO L225 Difference]: With dead ends: 118 [2018-11-18 16:50:14,020 INFO L226 Difference]: Without dead ends: 77 [2018-11-18 16:50:14,021 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:50:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-18 16:50:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-18 16:50:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 16:50:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-18 16:50:14,031 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2018-11-18 16:50:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:14,031 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-18 16:50:14,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:50:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-18 16:50:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 16:50:14,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:14,033 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:14,033 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:14,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2018-11-18 16:50:14,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:14,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:14,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:14,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 16:50:14,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:14,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:14,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-18 16:50:14,094 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [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:50:14,095 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:50:14,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:50:14,585 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:50:14,585 INFO L272 AbstractInterpreter]: Visited 29 different actions 2572 times. Merged at 11 different actions 587 times. Widened at 2 different actions 135 times. Performed 5789 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5789 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 318 fixpoints after 9 different actions. Largest state had 5 variables. [2018-11-18 16:50:14,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:14,597 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:50:14,608 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2018-11-18 16:50:14,609 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:50:14,711 INFO L415 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2018-11-18 16:50:14,711 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:50:14,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:50:14,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-11-18 16:50:14,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:50:14,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:50:14,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:50:14,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:50:14,712 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2018-11-18 16:50:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:15,073 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-11-18 16:50:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:50:15,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-18 16:50:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:15,074 INFO L225 Difference]: With dead ends: 141 [2018-11-18 16:50:15,075 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 16:50:15,075 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:50:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 16:50:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-18 16:50:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-18 16:50:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-11-18 16:50:15,083 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2018-11-18 16:50:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:15,083 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-11-18 16:50:15,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:50:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-11-18 16:50:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 16:50:15,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:15,086 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:15,087 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:15,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2018-11-18 16:50:15,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:15,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 16:50:15,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:15,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:15,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2018-11-18 16:50:15,160 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:50:15,162 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:50:15,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:50:15,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:50:15,687 INFO L272 AbstractInterpreter]: Visited 34 different actions 4844 times. Merged at 14 different actions 1434 times. Widened at 2 different actions 189 times. Performed 11827 root evaluator evaluations with a maximum evaluation depth of 4. Performed 11827 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 615 fixpoints after 11 different actions. Largest state had 5 variables. [2018-11-18 16:50:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:15,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:50:15,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:15,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:15,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:50:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:15,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-18 16:50:15,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 16:50:16,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:16,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 13] total 17 [2018-11-18 16:50:16,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:16,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:50:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:50:16,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:50:16,440 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 12 states. [2018-11-18 16:50:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:16,677 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2018-11-18 16:50:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:50:16,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-18 16:50:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:16,680 INFO L225 Difference]: With dead ends: 212 [2018-11-18 16:50:16,680 INFO L226 Difference]: Without dead ends: 134 [2018-11-18 16:50:16,680 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:50:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-18 16:50:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-11-18 16:50:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 16:50:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2018-11-18 16:50:16,696 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 94 [2018-11-18 16:50:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:16,696 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2018-11-18 16:50:16,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:50:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2018-11-18 16:50:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-18 16:50:16,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:16,699 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:16,699 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 721741772, now seen corresponding path program 2 times [2018-11-18 16:50:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:16,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:16,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 72 proven. 54 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-18 16:50:16,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:16,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:16,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:50:16,788 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:50:16,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:16,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:50:16,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:50:16,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:50:16,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:16,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 17 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-18 16:50:16,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 78 proven. 19 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-11-18 16:50:17,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:17,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 18 [2018-11-18 16:50:17,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:17,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:50:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:50:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:50:17,058 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand 15 states. [2018-11-18 16:50:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:17,358 INFO L93 Difference]: Finished difference Result 231 states and 386 transitions. [2018-11-18 16:50:17,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 16:50:17,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2018-11-18 16:50:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:17,361 INFO L225 Difference]: With dead ends: 231 [2018-11-18 16:50:17,361 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 16:50:17,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-11-18 16:50:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 16:50:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 144. [2018-11-18 16:50:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 16:50:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2018-11-18 16:50:17,382 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 110 [2018-11-18 16:50:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:17,382 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2018-11-18 16:50:17,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:50:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2018-11-18 16:50:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-18 16:50:17,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:17,384 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 16, 16, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:17,384 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:17,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash -751072460, now seen corresponding path program 3 times [2018-11-18 16:50:17,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:17,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:17,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 256 proven. 176 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-11-18 16:50:17,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:17,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:17,537 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:50:17,538 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:50:17,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:17,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:50:17,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 16:50:17,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:50:17,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:17,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 189 proven. 232 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2018-11-18 16:50:17,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 187 proven. 242 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2018-11-18 16:50:18,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:18,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 26 [2018-11-18 16:50:18,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:18,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 16:50:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 16:50:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:50:18,464 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand 20 states. [2018-11-18 16:50:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:18,932 INFO L93 Difference]: Finished difference Result 339 states and 599 transitions. [2018-11-18 16:50:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 16:50:18,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 243 [2018-11-18 16:50:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:18,934 INFO L225 Difference]: With dead ends: 339 [2018-11-18 16:50:18,934 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 16:50:18,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 461 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 16:50:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 16:50:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-11-18 16:50:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 16:50:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 241 transitions. [2018-11-18 16:50:18,949 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 241 transitions. Word has length 243 [2018-11-18 16:50:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:18,950 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 241 transitions. [2018-11-18 16:50:18,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 16:50:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 241 transitions. [2018-11-18 16:50:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 16:50:18,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:18,954 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:18,954 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:18,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1137267730, now seen corresponding path program 4 times [2018-11-18 16:50:18,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:18,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:18,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:18,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:18,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 112 proven. 83 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2018-11-18 16:50:19,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:19,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:19,115 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:50:19,115 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:50:19,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:19,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:19,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:50:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:19,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 97 proven. 129 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2018-11-18 16:50:19,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 97 proven. 133 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2018-11-18 16:50:19,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:19,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2018-11-18 16:50:19,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:19,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:50:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:50:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:50:19,562 INFO L87 Difference]: Start difference. First operand 171 states and 241 transitions. Second operand 14 states. [2018-11-18 16:50:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:19,815 INFO L93 Difference]: Finished difference Result 375 states and 590 transitions. [2018-11-18 16:50:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:50:19,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-18 16:50:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:19,818 INFO L225 Difference]: With dead ends: 375 [2018-11-18 16:50:19,818 INFO L226 Difference]: Without dead ends: 237 [2018-11-18 16:50:19,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 359 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:50:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-18 16:50:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2018-11-18 16:50:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-18 16:50:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 320 transitions. [2018-11-18 16:50:19,838 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 320 transitions. Word has length 188 [2018-11-18 16:50:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:19,839 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 320 transitions. [2018-11-18 16:50:19,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:50:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 320 transitions. [2018-11-18 16:50:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-18 16:50:19,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:19,842 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:19,842 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:19,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:19,842 INFO L82 PathProgramCache]: Analyzing trace with hash -854759576, now seen corresponding path program 5 times [2018-11-18 16:50:19,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:19,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:19,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:19,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:19,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 267 proven. 35 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-11-18 16:50:20,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:20,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:50:20,007 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 16:50:20,007 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:50:20,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:20,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/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:50:20,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:50:20,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 16:50:20,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 16:50:20,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:20,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 306 proven. 36 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2018-11-18 16:50:20,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 306 proven. 38 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-18 16:50:20,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:20,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2018-11-18 16:50:20,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:50:20,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:50:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:50:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:50:20,540 INFO L87 Difference]: Start difference. First operand 213 states and 320 transitions. Second operand 15 states. [2018-11-18 16:50:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:20,764 INFO L93 Difference]: Finished difference Result 410 states and 641 transitions. [2018-11-18 16:50:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 16:50:20,764 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2018-11-18 16:50:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:20,766 INFO L225 Difference]: With dead ends: 410 [2018-11-18 16:50:20,766 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 16:50:20,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 365 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2018-11-18 16:50:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 16:50:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 202. [2018-11-18 16:50:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-18 16:50:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 287 transitions. [2018-11-18 16:50:20,779 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 287 transitions. Word has length 191 [2018-11-18 16:50:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:20,780 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 287 transitions. [2018-11-18 16:50:20,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:50:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 287 transitions. [2018-11-18 16:50:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 16:50:20,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:20,783 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:20,783 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:20,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 6 times [2018-11-18 16:50:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:50:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:20,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:20,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:50:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:50:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:50:20,813 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:50:20,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:50:20 BoogieIcfgContainer [2018-11-18 16:50:20,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:50:20,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:50:20,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:50:20,839 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:50:20,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:50:10" (3/4) ... [2018-11-18 16:50:20,841 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:50:20,887 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4f160f1-a236-4033-bc8d-86bce8e242ca/bin-2019/utaipan/witness.graphml [2018-11-18 16:50:20,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:50:20,888 INFO L168 Benchmark]: Toolchain (without parser) took 10680.39 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 576.7 MB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -372.6 MB). Peak memory consumption was 204.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,889 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:50:20,889 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.11 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,889 INFO L168 Benchmark]: Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:50:20,889 INFO L168 Benchmark]: RCFGBuilder took 200.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,890 INFO L168 Benchmark]: TraceAbstraction took 10258.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 427.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.8 MB). Peak memory consumption was 214.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,890 INFO L168 Benchmark]: Witness Printer took 48.08 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:50:20,891 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.11 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.30 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 200.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10258.42 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 427.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.8 MB). Peak memory consumption was 214.0 MB. Max. memory is 11.5 GB. * Witness Printer took 48.08 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. 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 = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) 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); [L37] EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 10.2s OverallTime, 13 OverallIterations, 19 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 539 SDslu, 2877 SDs, 0 SdLazy, 2354 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2103 GetRequests, 1820 SyntacticMatches, 57 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8596938775510204 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.20408163265306123 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 141 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2160 NumberOfCodeBlocks, 1947 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2837 ConstructedInterpolants, 0 QuantifiedInterpolants, 688301 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1462 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 10573/11986 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...