./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.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_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:06:29,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:06:29,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:06:29,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:06:29,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:06:29,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:06:29,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:06:29,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:06:29,602 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:06:29,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:06:29,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:06:29,604 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:06:29,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:06:29,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:06:29,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:06:29,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:06:29,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:06:29,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:06:29,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:06:29,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:06:29,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:06:29,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:06:29,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:06:29,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:06:29,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:06:29,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:06:29,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:06:29,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:06:29,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:06:29,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:06:29,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:06:29,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:06:29,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:06:29,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:06:29,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:06:29,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:06:29,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 13:06:29,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:06:29,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:06:29,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:06:29,630 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:06:29,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:06:29,631 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:06:29,632 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:06:29,632 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:06:29,632 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:06:29,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:06:29,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:06:29,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:06:29,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:06:29,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:06:29,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:06:29,635 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:06:29,636 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_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-11-18 13:06:29,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:06:29,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:06:29,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:06:29,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:06:29,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:06:29,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 13:06:29,714 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/data/a632157c1/cfcaee7383154b5b84091a4dbdc15033/FLAG3862d6421 [2018-11-18 13:06:30,048 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:06:30,049 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 13:06:30,055 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/data/a632157c1/cfcaee7383154b5b84091a4dbdc15033/FLAG3862d6421 [2018-11-18 13:06:30,482 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/data/a632157c1/cfcaee7383154b5b84091a4dbdc15033 [2018-11-18 13:06:30,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:06:30,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:06:30,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:06:30,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:06:30,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:06:30,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161947f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30, skipping insertion in model container [2018-11-18 13:06:30,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:06:30,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:06:30,652 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:06:30,654 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:06:30,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:06:30,685 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:06:30,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30 WrapperNode [2018-11-18 13:06:30,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:06:30,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:06:30,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:06:30,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:06:30,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:06:30,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:06:30,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:06:30,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:06:30,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... [2018-11-18 13:06:30,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:06:30,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:06:30,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:06:30,761 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:06:30,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:06:30,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 13:06:30,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 13:06:31,005 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:06:31,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:06:31 BoogieIcfgContainer [2018-11-18 13:06:31,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:06:31,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:06:31,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:06:31,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:06:31,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:06:30" (1/3) ... [2018-11-18 13:06:31,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23747cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:06:31, skipping insertion in model container [2018-11-18 13:06:31,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:06:30" (2/3) ... [2018-11-18 13:06:31,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23747cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:06:31, skipping insertion in model container [2018-11-18 13:06:31,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:06:31" (3/3) ... [2018-11-18 13:06:31,011 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 13:06:31,019 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:06:31,024 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:06:31,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:06:31,064 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:06:31,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:06:31,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:06:31,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:06:31,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:06:31,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:06:31,065 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:06:31,065 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:06:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-18 13:06:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 13:06:31,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:31,083 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-18 13:06:31,084 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:31,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1190107182, now seen corresponding path program 1 times [2018-11-18 13:06:31,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:31,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:31,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 13:06:31,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:06:31,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:06:31,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:31,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:06:31,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:06:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:06:31,255 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-11-18 13:06:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:31,295 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-18 13:06:31,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:06:31,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 13:06:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:31,303 INFO L225 Difference]: With dead ends: 122 [2018-11-18 13:06:31,303 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 13:06:31,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:06:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 13:06:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-18 13:06:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 13:06:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-18 13:06:31,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-18 13:06:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:31,333 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-18 13:06:31,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:06:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-18 13:06:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:06:31,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:31,336 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:31,336 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:31,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1530966986, now seen corresponding path program 1 times [2018-11-18 13:06:31,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:31,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:31,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:31,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:31,431 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-18 13:06:31,432 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [140], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:31,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:31,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:31,533 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:31,534 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 3. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 13:06:31,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:31,542 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:31,582 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-11-18 13:06:31,582 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:31,642 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-18 13:06:31,642 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:31,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:31,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-18 13:06:31,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:31,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:06:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:06:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:06:31,644 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 10 states. [2018-11-18 13:06:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:32,093 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-18 13:06:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 13:06:32,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-18 13:06:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:32,096 INFO L225 Difference]: With dead ends: 130 [2018-11-18 13:06:32,096 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 13:06:32,097 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:06:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 13:06:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-18 13:06:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 13:06:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-11-18 13:06:32,106 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 50 [2018-11-18 13:06:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:32,107 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-11-18 13:06:32,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:06:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-18 13:06:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 13:06:32,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:32,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:32,108 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:32,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash -756422958, now seen corresponding path program 1 times [2018-11-18 13:06:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:32,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:32,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:32,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:32,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:32,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-18 13:06:32,152 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:32,154 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:32,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:32,165 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:32,167 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 4. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 13:06:32,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:32,171 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:32,192 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 71.85% of their original sizes. [2018-11-18 13:06:32,192 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:32,261 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-18 13:06:32,261 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:32,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:32,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-18 13:06:32,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:32,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:06:32,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:06:32,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:06:32,263 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 11 states. [2018-11-18 13:06:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:32,554 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-18 13:06:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:06:32,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-18 13:06:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:32,555 INFO L225 Difference]: With dead ends: 128 [2018-11-18 13:06:32,558 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 13:06:32,558 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:06:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 13:06:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-18 13:06:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 13:06:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-11-18 13:06:32,566 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 56 [2018-11-18 13:06:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:32,567 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-11-18 13:06:32,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:06:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-11-18 13:06:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 13:06:32,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:32,569 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:32,569 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:32,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:32,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1748923792, now seen corresponding path program 1 times [2018-11-18 13:06:32,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:32,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:32,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:32,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:32,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:32,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:32,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 13:06:32,650 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [67], [72], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:32,652 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:32,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:32,660 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:32,661 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 4. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 13:06:32,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:32,670 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:32,687 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64.67% of their original sizes. [2018-11-18 13:06:32,687 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:32,735 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 13:06:32,735 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:32,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:32,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 13:06:32,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:32,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:06:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:06:32,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:06:32,736 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 11 states. [2018-11-18 13:06:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:33,140 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2018-11-18 13:06:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 13:06:33,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 13:06:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:33,142 INFO L225 Difference]: With dead ends: 136 [2018-11-18 13:06:33,142 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 13:06:33,142 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:06:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 13:06:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-11-18 13:06:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 13:06:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-11-18 13:06:33,149 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 58 [2018-11-18 13:06:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:33,149 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-11-18 13:06:33,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:06:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-11-18 13:06:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:06:33,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:33,150 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:33,150 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:33,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1704529893, now seen corresponding path program 1 times [2018-11-18 13:06:33,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:33,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:33,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:33,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:33,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:33,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:33,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:33,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 13:06:33,215 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:33,217 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:33,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:33,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:33,255 INFO L272 AbstractInterpreter]: Visited 34 different actions 93 times. Merged at 7 different actions 28 times. Never widened. Performed 265 root evaluator evaluations with a maximum evaluation depth of 4. Performed 265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 13:06:33,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:33,257 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:33,280 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 63.33% of their original sizes. [2018-11-18 13:06:33,280 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:33,405 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 13:06:33,405 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-18 13:06:33,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:33,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 13:06:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 13:06:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:06:33,406 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 21 states. [2018-11-18 13:06:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:34,322 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2018-11-18 13:06:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 13:06:34,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-11-18 13:06:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:34,324 INFO L225 Difference]: With dead ends: 152 [2018-11-18 13:06:34,324 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 13:06:34,325 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 13:06:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 13:06:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-11-18 13:06:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 13:06:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2018-11-18 13:06:34,334 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 60 [2018-11-18 13:06:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:34,334 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2018-11-18 13:06:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 13:06:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2018-11-18 13:06:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:06:34,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:34,336 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:34,336 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:34,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1579320153, now seen corresponding path program 1 times [2018-11-18 13:06:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:34,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:34,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:34,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:34,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:34,376 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 13:06:34,377 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:34,378 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:34,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:34,401 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:34,402 INFO L272 AbstractInterpreter]: Visited 42 different actions 85 times. Merged at 7 different actions 14 times. Never widened. Performed 220 root evaluator evaluations with a maximum evaluation depth of 4. Performed 220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 23 variables. [2018-11-18 13:06:34,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:34,410 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:34,436 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 65.18% of their original sizes. [2018-11-18 13:06:34,436 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:34,605 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 13:06:34,605 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:34,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:34,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-18 13:06:34,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:34,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 13:06:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 13:06:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-11-18 13:06:34,606 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 27 states. [2018-11-18 13:06:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:35,628 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-11-18 13:06:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 13:06:35,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-11-18 13:06:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:35,629 INFO L225 Difference]: With dead ends: 137 [2018-11-18 13:06:35,630 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 13:06:35,630 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 13:06:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 13:06:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 94. [2018-11-18 13:06:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 13:06:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-18 13:06:35,641 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 60 [2018-11-18 13:06:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:35,642 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-18 13:06:35,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 13:06:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-18 13:06:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:06:35,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:35,643 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:35,643 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:35,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1636578455, now seen corresponding path program 1 times [2018-11-18 13:06:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:35,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:35,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:35,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:35,691 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 13:06:35,691 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [147], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:35,692 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:35,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:35,716 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:35,716 INFO L272 AbstractInterpreter]: Visited 46 different actions 105 times. Merged at 7 different actions 28 times. Never widened. Performed 285 root evaluator evaluations with a maximum evaluation depth of 4. Performed 285 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 13:06:35,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:35,726 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:35,745 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 65.92% of their original sizes. [2018-11-18 13:06:35,745 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:35,970 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 13:06:35,970 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-11-18 13:06:35,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:35,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 13:06:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 13:06:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-11-18 13:06:35,972 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 31 states. [2018-11-18 13:06:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:37,170 INFO L93 Difference]: Finished difference Result 139 states and 170 transitions. [2018-11-18 13:06:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 13:06:37,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-11-18 13:06:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:37,171 INFO L225 Difference]: With dead ends: 139 [2018-11-18 13:06:37,171 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 13:06:37,172 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 13:06:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 13:06:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 79. [2018-11-18 13:06:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 13:06:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-18 13:06:37,182 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 60 [2018-11-18 13:06:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:37,182 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-18 13:06:37,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 13:06:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-18 13:06:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:06:37,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:37,183 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:37,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:37,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1528990243, now seen corresponding path program 1 times [2018-11-18 13:06:37,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:37,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:37,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:37,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:37,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:37,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-18 13:06:37,221 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [92], [98], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:37,222 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:37,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:37,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:37,264 INFO L272 AbstractInterpreter]: Visited 47 different actions 156 times. Merged at 15 different actions 53 times. Never widened. Performed 445 root evaluator evaluations with a maximum evaluation depth of 4. Performed 445 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-18 13:06:37,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:37,266 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:37,293 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 64.71% of their original sizes. [2018-11-18 13:06:37,294 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:37,619 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-18 13:06:37,619 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:37,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:37,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-11-18 13:06:37,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:37,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 13:06:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 13:06:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-11-18 13:06:37,621 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 31 states. [2018-11-18 13:06:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:39,179 INFO L93 Difference]: Finished difference Result 159 states and 201 transitions. [2018-11-18 13:06:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-18 13:06:39,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-11-18 13:06:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:39,181 INFO L225 Difference]: With dead ends: 159 [2018-11-18 13:06:39,181 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 13:06:39,181 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=2382, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 13:06:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 13:06:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 87. [2018-11-18 13:06:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 13:06:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2018-11-18 13:06:39,189 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 65 [2018-11-18 13:06:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:39,190 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-18 13:06:39,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 13:06:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-18 13:06:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:06:39,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:39,191 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:39,191 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:39,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash 465154463, now seen corresponding path program 1 times [2018-11-18 13:06:39,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:39,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 13:06:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:06:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:06:39,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:39,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:06:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:06:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:06:39,227 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 4 states. [2018-11-18 13:06:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:39,244 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2018-11-18 13:06:39,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:06:39,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-18 13:06:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:39,246 INFO L225 Difference]: With dead ends: 99 [2018-11-18 13:06:39,246 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 13:06:39,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:06:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 13:06:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-11-18 13:06:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 13:06:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2018-11-18 13:06:39,254 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 65 [2018-11-18 13:06:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:39,255 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2018-11-18 13:06:39,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:06:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2018-11-18 13:06:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 13:06:39,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:39,256 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:39,256 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:39,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 850568993, now seen corresponding path program 1 times [2018-11-18 13:06:39,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:39,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:39,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:39,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:39,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:39,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:39,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:39,320 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-18 13:06:39,321 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:39,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:39,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:39,372 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:06:39,372 INFO L272 AbstractInterpreter]: Visited 47 different actions 180 times. Merged at 19 different actions 65 times. Never widened. Performed 534 root evaluator evaluations with a maximum evaluation depth of 4. Performed 534 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 13:06:39,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:39,374 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:06:39,392 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 65.68% of their original sizes. [2018-11-18 13:06:39,392 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:06:39,622 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-18 13:06:39,622 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:06:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:06:39,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-18 13:06:39,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:39,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 13:06:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 13:06:39,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-18 13:06:39,624 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 20 states. [2018-11-18 13:06:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:40,135 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2018-11-18 13:06:40,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 13:06:40,135 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-18 13:06:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:40,136 INFO L225 Difference]: With dead ends: 113 [2018-11-18 13:06:40,136 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 13:06:40,136 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 13:06:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 13:06:40,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-11-18 13:06:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 13:06:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-11-18 13:06:40,143 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 65 [2018-11-18 13:06:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:40,143 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-11-18 13:06:40,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 13:06:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-18 13:06:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 13:06:40,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:40,144 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:40,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:40,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:40,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1009598676, now seen corresponding path program 1 times [2018-11-18 13:06:40,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:40,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:40,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:40,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:40,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:40,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-18 13:06:40,199 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:40,200 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:40,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:40,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:06:40,253 INFO L272 AbstractInterpreter]: Visited 53 different actions 189 times. Merged at 21 different actions 63 times. Never widened. Performed 557 root evaluator evaluations with a maximum evaluation depth of 6. Performed 557 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-18 13:06:40,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:40,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:06:40,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:40,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 13:06:40,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:40,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:06:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:40,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:06:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:06:40,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:06:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:40,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:06:40,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-18 13:06:40,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:06:40,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:06:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:06:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:06:40,424 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 5 states. [2018-11-18 13:06:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:40,486 INFO L93 Difference]: Finished difference Result 160 states and 199 transitions. [2018-11-18 13:06:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:06:40,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-18 13:06:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:40,488 INFO L225 Difference]: With dead ends: 160 [2018-11-18 13:06:40,488 INFO L226 Difference]: Without dead ends: 106 [2018-11-18 13:06:40,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:06:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-18 13:06:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2018-11-18 13:06:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 13:06:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-11-18 13:06:40,500 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 66 [2018-11-18 13:06:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:40,500 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-11-18 13:06:40,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:06:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-11-18 13:06:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 13:06:40,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:40,500 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:40,500 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:40,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:40,501 INFO L82 PathProgramCache]: Analyzing trace with hash 134592434, now seen corresponding path program 1 times [2018-11-18 13:06:40,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:40,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:40,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:40,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:40,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:40,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:40,558 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 13:06:40,558 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:40,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:40,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:40,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:06:40,592 INFO L272 AbstractInterpreter]: Visited 53 different actions 180 times. Merged at 21 different actions 53 times. Never widened. Performed 526 root evaluator evaluations with a maximum evaluation depth of 6. Performed 526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-18 13:06:40,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:40,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:06:40,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:40,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 13:06:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:40,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:06:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:40,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:06:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:40,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:06:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 13:06:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:06:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 10] total 18 [2018-11-18 13:06:40,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:06:40,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:06:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:06:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:06:40,954 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 8 states. [2018-11-18 13:06:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:41,036 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2018-11-18 13:06:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:06:41,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-18 13:06:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:41,038 INFO L225 Difference]: With dead ends: 104 [2018-11-18 13:06:41,038 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 13:06:41,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:06:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 13:06:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-11-18 13:06:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 13:06:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-11-18 13:06:41,046 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 68 [2018-11-18 13:06:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:41,047 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-18 13:06:41,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:06:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-11-18 13:06:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 13:06:41,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:41,047 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:41,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:41,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2040961462, now seen corresponding path program 2 times [2018-11-18 13:06:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:41,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:41,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:41,100 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 13:06:41,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 13:06:41,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:41,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 13:06:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:06:41,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 13:06:41,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 13:06:41,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:06:41,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:06:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 13:06:41,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:06:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 13:06:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:06:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2018-11-18 13:06:41,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:06:41,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:06:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:06:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:06:41,359 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 13 states. [2018-11-18 13:06:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:41,652 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2018-11-18 13:06:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 13:06:41,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-11-18 13:06:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:41,653 INFO L225 Difference]: With dead ends: 209 [2018-11-18 13:06:41,653 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 13:06:41,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-18 13:06:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 13:06:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2018-11-18 13:06:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 13:06:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2018-11-18 13:06:41,663 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 68 [2018-11-18 13:06:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:41,664 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2018-11-18 13:06:41,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:06:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2018-11-18 13:06:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 13:06:41,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:41,665 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:41,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:41,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1022658039, now seen corresponding path program 1 times [2018-11-18 13:06:41,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:06:41,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:41,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:41,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:41,701 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-18 13:06:41,701 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:41,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:41,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:41,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:06:41,737 INFO L272 AbstractInterpreter]: Visited 53 different actions 186 times. Merged at 21 different actions 63 times. Never widened. Performed 516 root evaluator evaluations with a maximum evaluation depth of 6. Performed 516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 13:06:41,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:41,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:06:41,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:41,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 13:06:41,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:41,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:06:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:41,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:06:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:06:41,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:06:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:41,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:06:41,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-18 13:06:41,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:06:41,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:06:41,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:06:41,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:06:41,885 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 6 states. [2018-11-18 13:06:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:41,945 INFO L93 Difference]: Finished difference Result 215 states and 270 transitions. [2018-11-18 13:06:41,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 13:06:41,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-18 13:06:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:41,946 INFO L225 Difference]: With dead ends: 215 [2018-11-18 13:06:41,946 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 13:06:41,947 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:06:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 13:06:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2018-11-18 13:06:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 13:06:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-11-18 13:06:41,955 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 70 [2018-11-18 13:06:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:41,955 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2018-11-18 13:06:41,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:06:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2018-11-18 13:06:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 13:06:41,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:06:41,956 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:06:41,957 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:06:41,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1285856917, now seen corresponding path program 1 times [2018-11-18 13:06:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:06:41,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:06:41,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:06:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:06:42,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:42,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:06:42,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-18 13:06:42,019 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 13:06:42,020 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:06:42,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:06:42,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:06:42,059 INFO L272 AbstractInterpreter]: Visited 53 different actions 177 times. Merged at 21 different actions 53 times. Never widened. Performed 485 root evaluator evaluations with a maximum evaluation depth of 6. Performed 485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 13:06:42,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:06:42,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:06:42,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:06:42,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/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 13:06:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:06:42,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:06:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:06:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:06:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 13:06:42,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:06:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 13:06:42,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:06:42,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2018-11-18 13:06:42,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:06:42,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:06:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:06:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-18 13:06:42,517 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 14 states. [2018-11-18 13:06:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:06:42,830 INFO L93 Difference]: Finished difference Result 222 states and 278 transitions. [2018-11-18 13:06:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 13:06:42,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 13:06:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:06:42,831 INFO L225 Difference]: With dead ends: 222 [2018-11-18 13:06:42,831 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:06:42,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-11-18 13:06:42,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:06:42,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:06:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:06:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:06:42,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2018-11-18 13:06:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:06:42,833 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:06:42,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:06:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:06:42,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:06:42,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:06:43,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:06:43,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:06:43,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:06:43,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:06:43,705 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-11-18 13:06:43,768 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-18 13:06:43,768 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-18 13:06:43,768 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (= mulflt_~__retres10~1 0)) (.cse1 (= mulflt_~b 0)) (.cse2 (not (= |mulflt_#in~b| 0)))) (and (or (and .cse0 (= mulflt_~a 0) .cse1) (not (= |mulflt_#in~a| 0)) .cse2) (let ((.cse3 (not (= 0 (mod |mulflt_#in~b| 4294967296))))) (or (and (= mulflt_~a |mulflt_#in~a|) (= mulflt_~b |mulflt_#in~b|) .cse3) .cse0 (and (= mulflt_~b |mulflt_#in~a|) .cse3 (not (= (mod |mulflt_#in~a| 4294967296) 0))))) (or (and .cse0 (= (mod mulflt_~a 4294967295) 0) .cse1) (not (= (mod |mulflt_#in~a| 4294967295) 0)) .cse2))) [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= |base2flt_#in~m| 0)) (and (= base2flt_~__retres4~0 0) (= base2flt_~m 0) (= base2flt_~e 0)) (not (= |base2flt_#in~e| 0))) [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-18 13:06:43,769 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (and (<= base2flt_~m |base2flt_#in~m|) (<= |base2flt_#in~m| base2flt_~m) (= base2flt_~e 0)) (not (= |base2flt_#in~m| 1)) (= (mod base2flt_~m 2) 0) .cse0) (or (not (= |base2flt_#in~m| 0)) .cse0) (not (= base2flt_~m 0)))) [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 1)) .cse0 (and (= (mod base2flt_~m 2) 0) (not (= base2flt_~m 0)))) (or (not (= |base2flt_#in~m| 0)) .cse0))) [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (let ((.cse1 (* 4 |base2flt_#in~m|)) (.cse0 (+ (div base2flt_~m 4294967296) 1))) (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= |base2flt_#in~e| base2flt_~e) (or (<= .cse0 0) (<= base2flt_~m .cse1)) (or (<= .cse1 base2flt_~m) (< 0 .cse0)))) [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 13:06:43,770 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:06:43,770 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L428 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-18 13:06:43,771 INFO L421 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~zero~0 0) (= main_~tmp___0~0 0)) [2018-11-18 13:06:43,771 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 13:06:43,772 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= main_~zero~0 0))) (or (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0) .cse0) (and (= main_~tmp~2 0) .cse0 (forall ((v_mulflt_~a_16 Int)) (<= (mod main_~b~0 4294967296) (mod v_mulflt_~a_16 4294967296))) (= main_~sb~0 0)) (<= (+ main_~sb~0 1) 0))) [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-18 13:06:43,772 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-18 13:06:43,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:06:43 BoogieIcfgContainer [2018-11-18 13:06:43,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:06:43,782 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:06:43,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:06:43,783 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:06:43,783 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:06:31" (3/4) ... [2018-11-18 13:06:43,786 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:06:43,790 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:06:43,790 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-18 13:06:43,790 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-18 13:06:43,790 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:06:43,790 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 13:06:43,793 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-18 13:06:43,793 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 13:06:43,794 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 13:06:43,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) [2018-11-18 13:06:43,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((m <= \old(m) && \old(m) <= m) && e == 0) || !(\old(m) == 1)) || m % 2 == 0) || !(\old(e) == 0)) && (!(\old(m) == 0) || !(\old(e) == 0))) && !(m == 0) [2018-11-18 13:06:43,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) [2018-11-18 13:06:43,811 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 1) || !(\old(e) == 0)) || (m % 2 == 0 && !(m == 0))) && (!(\old(m) == 0) || !(\old(e) == 0)) [2018-11-18 13:06:43,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__retres10 == 0 && a == 0) && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && ((((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296)) || __retres10 == 0) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0)))) && ((((__retres10 == 0 && a % 4294967295 == 0) && b == 0) || !(\old(a) % 4294967295 == 0)) || !(\old(b) == 0)) [2018-11-18 13:06:43,834 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9942d7ae-3580-4e0f-be6e-cc03e4983ffa/bin-2019/utaipan/witness.graphml [2018-11-18 13:06:43,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:06:43,835 INFO L168 Benchmark]: Toolchain (without parser) took 13349.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.5 MB). Free memory was 959.3 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,835 INFO L168 Benchmark]: CDTParser took 0.16 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 13:06:43,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.58 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:06:43,836 INFO L168 Benchmark]: Boogie Preprocessor took 58.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,836 INFO L168 Benchmark]: RCFGBuilder took 244.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,836 INFO L168 Benchmark]: TraceAbstraction took 12776.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.1 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,837 INFO L168 Benchmark]: Witness Printer took 51.65 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 172.5 kB). Peak memory consumption was 172.5 kB. Max. memory is 11.5 GB. [2018-11-18 13:06:43,838 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.19 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.58 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12776.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -88.1 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. * Witness Printer took 51.65 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 172.5 kB). Peak memory consumption was 172.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((!(\old(m) == 1) || !(\old(e) == 0)) || (m % 2 == 0 && !(m == 0))) && (!(\old(m) == 0) || !(\old(e) == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((__retres10 == 0 && a == 0) && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && ((((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296)) || __retres10 == 0) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0)))) && ((((__retres10 == 0 && a % 4294967295 == 0) && b == 0) || !(\old(a) % 4294967295 == 0)) || !(\old(b) == 0)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((m <= \old(m) && \old(m) <= m) && e == 0) || !(\old(m) == 1)) || m % 2 == 0) || !(\old(e) == 0)) && (!(\old(m) == 0) || !(\old(e) == 0))) && !(m == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 926 SDtfs, 987 SDslu, 7961 SDs, 0 SdLazy, 1226 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 1356 GetRequests, 985 SyntacticMatches, 9 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2330 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 12 AbstIntIterations, 8 AbstIntStrong, 0.7454160705770151 AbsIntWeakeningRatio, 1.3240343347639485 AbsIntAvgWeakeningVarsNumRemoved, 1.1051502145922747 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 317 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 213 PreInvPairs, 562 NumberOfFragments, 263 HoareAnnotationTreeSize, 213 FomulaSimplifications, 2336573 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1248 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1251 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1594 ConstructedInterpolants, 36 QuantifiedInterpolants, 227865 SizeOfPredicates, 16 NumberOfNonLiveVariables, 836 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 649/894 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...