./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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 45b185c6c694406b0734db5727dff1b8fd93ebcf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 00:08:57,814 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:08:57,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:08:57,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:08:57,822 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:08:57,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:08:57,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:08:57,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:08:57,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:08:57,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:08:57,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:08:57,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:08:57,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:08:57,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:08:57,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:08:57,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:08:57,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:08:57,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:08:57,829 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:08:57,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:08:57,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:08:57,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:08:57,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:08:57,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:08:57,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:08:57,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:08:57,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:08:57,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:08:57,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:08:57,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:08:57,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:08:57,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:08:57,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:08:57,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:08:57,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:08:57,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:08:57,836 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 00:08:57,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:08:57,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:08:57,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:08:57,844 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:08:57,844 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 00:08:57,844 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 00:08:57,845 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 00:08:57,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:08:57,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:08:57,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:08:57,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:08:57,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 00:08:57,848 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_c525b214-03ff-40fe-a607-b65ba02c468d/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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-12-02 00:08:57,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:08:57,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:08:57,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:08:57,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:08:57,879 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:08:57,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 00:08:57,917 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/data/08770d7d4/8d095c5ac718415298a1cae54ace786e/FLAG3f921a2ae [2018-12-02 00:08:58,278 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:08:58,278 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 00:08:58,282 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/data/08770d7d4/8d095c5ac718415298a1cae54ace786e/FLAG3f921a2ae [2018-12-02 00:08:58,649 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/data/08770d7d4/8d095c5ac718415298a1cae54ace786e [2018-12-02 00:08:58,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:08:58,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:08:58,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:08:58,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:08:58,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:08:58,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3757d378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58, skipping insertion in model container [2018-12-02 00:08:58,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:08:58,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:08:58,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:08:58,779 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:08:58,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:08:58,808 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:08:58,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58 WrapperNode [2018-12-02 00:08:58,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:08:58,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:08:58,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:08:58,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:08:58,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:08:58,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:08:58,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:08:58,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:08:58,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... [2018-12-02 00:08:58,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:08:58,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:08:58,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:08:58,868 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:08:58,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:08:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 00:08:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-12-02 00:08:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-02 00:08:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:08:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 00:08:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 00:08:58,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 00:08:59,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:08:59,078 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 00:08:59,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:08:59 BoogieIcfgContainer [2018-12-02 00:08:59,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:08:59,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:08:59,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:08:59,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:08:59,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:08:58" (1/3) ... [2018-12-02 00:08:59,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca897cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:08:59, skipping insertion in model container [2018-12-02 00:08:59,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:08:58" (2/3) ... [2018-12-02 00:08:59,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca897cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:08:59, skipping insertion in model container [2018-12-02 00:08:59,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:08:59" (3/3) ... [2018-12-02 00:08:59,083 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 00:08:59,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:08:59,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 00:08:59,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 00:08:59,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:08:59,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:08:59,120 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:08:59,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:08:59,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:08:59,120 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:08:59,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:08:59,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:08:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-02 00:08:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 00:08:59,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:08:59,135 INFO L402 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-12-02 00:08:59,136 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:08:59,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:08:59,139 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-12-02 00:08:59,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:08:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:08:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:08:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:08:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 00:08:59,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:08:59,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:08:59,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:08:59,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:08:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:08:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:08:59,265 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-02 00:08:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:08:59,290 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-12-02 00:08:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:08:59,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 00:08:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:08:59,297 INFO L225 Difference]: With dead ends: 118 [2018-12-02 00:08:59,297 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 00:08:59,299 INFO L631 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-12-02 00:08:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 00:08:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 00:08:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 00:08:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-12-02 00:08:59,324 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-12-02 00:08:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:08:59,325 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-12-02 00:08:59,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:08:59,325 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-12-02 00:08:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 00:08:59,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:08:59,327 INFO L402 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-12-02 00:08:59,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:08:59,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:08:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-12-02 00:08:59,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:08:59,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:08:59,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:08:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:08:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 00:08:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:08:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:08:59,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:08:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:08:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:08:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:08:59,370 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-12-02 00:08:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:08:59,393 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-12-02 00:08:59,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:08:59,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 00:08:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:08:59,394 INFO L225 Difference]: With dead ends: 64 [2018-12-02 00:08:59,394 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 00:08:59,395 INFO L631 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-12-02 00:08:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 00:08:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 00:08:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 00:08:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-12-02 00:08:59,399 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-12-02 00:08:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:08:59,399 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-12-02 00:08:59,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:08:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-12-02 00:08:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 00:08:59,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:08:59,400 INFO L402 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-12-02 00:08:59,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:08:59,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:08:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-12-02 00:08:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:08:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:08:59,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:08:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:08:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:08:59,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:08:59,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:08:59,442 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-02 00:08:59,443 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [138], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:08:59,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:08:59,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:08:59,528 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:08:59,529 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 43 root evaluator evaluations with a maximum evaluation depth of 3. Performed 43 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-12-02 00:08:59,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:08:59,534 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:08:59,578 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-12-02 00:08:59,578 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:08:59,615 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-02 00:08:59,616 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:08:59,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:08:59,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-12-02 00:08:59,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:08:59,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:08:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:08:59,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:08:59,617 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 10 states. [2018-12-02 00:08:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:08:59,955 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-12-02 00:08:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 00:08:59,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-02 00:08:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:08:59,957 INFO L225 Difference]: With dead ends: 124 [2018-12-02 00:08:59,957 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 00:08:59,957 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-12-02 00:08:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 00:08:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-12-02 00:08:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 00:08:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-12-02 00:08:59,964 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2018-12-02 00:08:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:08:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-12-02 00:08:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:08:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-12-02 00:08:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 00:08:59,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:08:59,965 INFO L402 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] [2018-12-02 00:08:59,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:08:59,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:08:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-12-02 00:08:59,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:08:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:08:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:08:59,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:08:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:08:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:08:59,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:08:59,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:08:59,997 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-02 00:08:59,997 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:08:59,999 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:08:59,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:00,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:00,007 INFO L272 AbstractInterpreter]: Visited 17 different actions 20 times. Never merged. Never widened. Performed 51 root evaluator evaluations with a maximum evaluation depth of 4. Performed 51 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-12-02 00:09:00,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:00,013 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:00,027 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2018-12-02 00:09:00,027 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:00,072 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-02 00:09:00,072 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:00,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:00,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-12-02 00:09:00,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:09:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:09:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:09:00,073 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 11 states. [2018-12-02 00:09:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:00,344 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2018-12-02 00:09:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:09:00,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-02 00:09:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:00,345 INFO L225 Difference]: With dead ends: 122 [2018-12-02 00:09:00,345 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 00:09:00,346 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-12-02 00:09:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 00:09:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-12-02 00:09:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 00:09:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-12-02 00:09:00,351 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2018-12-02 00:09:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:00,351 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-12-02 00:09:00,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:09:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-12-02 00:09:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 00:09:00,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:00,352 INFO L402 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] [2018-12-02 00:09:00,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:00,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 801154692, now seen corresponding path program 1 times [2018-12-02 00:09:00,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:00,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:00,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:00,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:00,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:00,408 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 00:09:00,408 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [66], [71], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:00,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:00,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:00,416 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:00,416 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 55 root evaluator evaluations with a maximum evaluation depth of 4. Performed 55 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-12-02 00:09:00,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:00,417 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:00,431 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 66.3% of their original sizes. [2018-12-02 00:09:00,432 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:00,476 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-02 00:09:00,476 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:00,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:00,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-02 00:09:00,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:00,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:09:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:09:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:09:00,477 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 11 states. [2018-12-02 00:09:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:00,789 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2018-12-02 00:09:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 00:09:00,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-12-02 00:09:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:00,790 INFO L225 Difference]: With dead ends: 129 [2018-12-02 00:09:00,790 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 00:09:00,790 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 47 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-12-02 00:09:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 00:09:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-12-02 00:09:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 00:09:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-12-02 00:09:00,795 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 57 [2018-12-02 00:09:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:00,795 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-12-02 00:09:00,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:09:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-12-02 00:09:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 00:09:00,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:00,796 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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-12-02 00:09:00,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:00,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1162955476, now seen corresponding path program 1 times [2018-12-02 00:09:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:00,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:00,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:00,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:00,829 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-02 00:09:00,829 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:00,831 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:00,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:00,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:00,870 INFO L272 AbstractInterpreter]: Visited 33 different actions 79 times. Merged at 6 different actions 18 times. Never widened. Performed 237 root evaluator evaluations with a maximum evaluation depth of 4. Performed 237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-02 00:09:00,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:00,872 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:00,897 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 61.95% of their original sizes. [2018-12-02 00:09:00,897 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:01,031 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-02 00:09:01,031 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:01,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:01,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-02 00:09:01,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:01,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 00:09:01,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 00:09:01,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:09:01,032 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 21 states. [2018-12-02 00:09:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:01,803 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2018-12-02 00:09:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 00:09:01,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-12-02 00:09:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:01,804 INFO L225 Difference]: With dead ends: 142 [2018-12-02 00:09:01,804 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 00:09:01,805 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 00:09:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 00:09:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2018-12-02 00:09:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 00:09:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-12-02 00:09:01,815 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 58 [2018-12-02 00:09:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:01,815 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-12-02 00:09:01,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 00:09:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-12-02 00:09:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 00:09:01,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:01,816 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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-12-02 00:09:01,816 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:01,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2120894570, now seen corresponding path program 1 times [2018-12-02 00:09:01,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:01,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:01,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:01,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:01,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:01,859 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-02 00:09:01,859 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [145], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:01,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:01,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:01,880 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:01,880 INFO L272 AbstractInterpreter]: Visited 45 different actions 84 times. Merged at 6 different actions 12 times. Never widened. Performed 226 root evaluator evaluations with a maximum evaluation depth of 4. Performed 226 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-12-02 00:09:01,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:01,881 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:01,905 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 65.05% of their original sizes. [2018-12-02 00:09:01,905 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:02,130 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-02 00:09:02,130 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:02,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:02,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-12-02 00:09:02,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:02,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 00:09:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 00:09:02,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-12-02 00:09:02,132 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 31 states. [2018-12-02 00:09:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:03,357 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2018-12-02 00:09:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 00:09:03,357 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-12-02 00:09:03,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:03,358 INFO L225 Difference]: With dead ends: 137 [2018-12-02 00:09:03,358 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 00:09:03,359 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 30 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-12-02 00:09:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 00:09:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2018-12-02 00:09:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 00:09:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-12-02 00:09:03,365 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 58 [2018-12-02 00:09:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:03,365 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-12-02 00:09:03,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 00:09:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-12-02 00:09:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 00:09:03,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:03,366 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:09:03,366 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:03,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1063907295, now seen corresponding path program 1 times [2018-12-02 00:09:03,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:03,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:03,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:03,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:03,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:03,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-02 00:09:03,391 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:03,392 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:03,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:03,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:03,432 INFO L272 AbstractInterpreter]: Visited 45 different actions 165 times. Merged at 18 different actions 57 times. Never widened. Performed 585 root evaluator evaluations with a maximum evaluation depth of 4. Performed 585 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-12-02 00:09:03,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:03,433 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:03,453 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 61.85% of their original sizes. [2018-12-02 00:09:03,454 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:03,766 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-02 00:09:03,766 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:03,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:03,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [5] total 35 [2018-12-02 00:09:03,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:03,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 00:09:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 00:09:03,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-12-02 00:09:03,767 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 32 states. [2018-12-02 00:09:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:11,077 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2018-12-02 00:09:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-02 00:09:11,077 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-02 00:09:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:11,078 INFO L225 Difference]: With dead ends: 166 [2018-12-02 00:09:11,078 INFO L226 Difference]: Without dead ends: 150 [2018-12-02 00:09:11,080 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=337, Invalid=2969, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 00:09:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-02 00:09:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 97. [2018-12-02 00:09:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 00:09:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2018-12-02 00:09:11,092 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 62 [2018-12-02 00:09:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2018-12-02 00:09:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 00:09:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2018-12-02 00:09:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 00:09:11,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:11,093 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:09:11,093 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:11,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash -851500765, now seen corresponding path program 1 times [2018-12-02 00:09:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:11,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:11,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:11,116 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-02 00:09:11,116 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:11,117 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:11,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:11,144 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:09:11,144 INFO L272 AbstractInterpreter]: Visited 45 different actions 158 times. Merged at 18 different actions 51 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 4. Performed 497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-02 00:09:11,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:11,145 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:09:11,158 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 62.83% of their original sizes. [2018-12-02 00:09:11,158 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:09:11,271 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-02 00:09:11,271 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:09:11,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:09:11,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-02 00:09:11,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:11,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 00:09:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 00:09:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:09:11,272 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 21 states. [2018-12-02 00:09:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:11,712 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2018-12-02 00:09:11,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 00:09:11,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-12-02 00:09:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:11,713 INFO L225 Difference]: With dead ends: 133 [2018-12-02 00:09:11,713 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 00:09:11,714 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 00:09:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 00:09:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-12-02 00:09:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 00:09:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-12-02 00:09:11,721 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 62 [2018-12-02 00:09:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:11,721 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-12-02 00:09:11,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 00:09:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-12-02 00:09:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 00:09:11,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:11,722 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:09:11,722 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:11,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -265783978, now seen corresponding path program 1 times [2018-12-02 00:09:11,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:11,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:11,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:11,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:11,748 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-02 00:09:11,748 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [96], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:11,749 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:11,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:11,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:11,781 INFO L272 AbstractInterpreter]: Visited 51 different actions 167 times. Merged at 20 different actions 49 times. Never widened. Performed 587 root evaluator evaluations with a maximum evaluation depth of 6. Performed 587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 6 different actions. Largest state had 23 variables. [2018-12-02 00:09:11,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:11,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:11,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:11,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:09:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:11,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:11,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:09:11,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:11,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:11,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-02 00:09:11,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:11,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:09:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:09:11,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:09:11,914 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 5 states. [2018-12-02 00:09:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:11,961 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2018-12-02 00:09:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:09:11,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-02 00:09:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:11,962 INFO L225 Difference]: With dead ends: 151 [2018-12-02 00:09:11,962 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 00:09:11,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 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-12-02 00:09:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 00:09:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-12-02 00:09:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 00:09:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-12-02 00:09:11,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 63 [2018-12-02 00:09:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:11,973 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-02 00:09:11,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:09:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-12-02 00:09:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 00:09:11,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:11,974 INFO L402 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-12-02 00:09:11,974 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:11,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1530868887, now seen corresponding path program 1 times [2018-12-02 00:09:11,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:11,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:11,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:12,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:12,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:12,036 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-02 00:09:12,036 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:12,037 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:12,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:12,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:12,082 INFO L272 AbstractInterpreter]: Visited 52 different actions 230 times. Merged at 21 different actions 79 times. Never widened. Performed 743 root evaluator evaluations with a maximum evaluation depth of 6. Performed 743 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-02 00:09:12,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:12,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:12,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:12,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:09:12,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:12,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:12,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 00:09:12,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-02 00:09:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:12,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 27 [2018-12-02 00:09:12,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:12,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 00:09:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 00:09:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-12-02 00:09:12,517 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 14 states. [2018-12-02 00:09:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:12,862 INFO L93 Difference]: Finished difference Result 176 states and 232 transitions. [2018-12-02 00:09:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 00:09:12,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-12-02 00:09:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:12,863 INFO L225 Difference]: With dead ends: 176 [2018-12-02 00:09:12,863 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 00:09:12,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 00:09:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 00:09:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2018-12-02 00:09:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 00:09:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2018-12-02 00:09:12,874 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 65 [2018-12-02 00:09:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:12,874 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2018-12-02 00:09:12,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 00:09:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2018-12-02 00:09:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 00:09:12,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:12,875 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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-12-02 00:09:12,875 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:12,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2088958439, now seen corresponding path program 1 times [2018-12-02 00:09:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:12,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:12,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:12,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:12,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:12,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:12,911 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-02 00:09:12,911 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:12,913 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:12,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:12,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:12,950 INFO L272 AbstractInterpreter]: Visited 51 different actions 164 times. Merged at 20 different actions 47 times. Never widened. Performed 498 root evaluator evaluations with a maximum evaluation depth of 6. Performed 498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-02 00:09:12,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:12,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:12,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:12,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:09:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:12,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:12,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:09:12,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-02 00:09:13,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:13,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:09:13,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:09:13,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:09:13,062 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 6 states. [2018-12-02 00:09:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:13,118 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2018-12-02 00:09:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:09:13,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 00:09:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:13,120 INFO L225 Difference]: With dead ends: 170 [2018-12-02 00:09:13,120 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 00:09:13,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 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-12-02 00:09:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 00:09:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-12-02 00:09:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 00:09:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-12-02 00:09:13,129 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 66 [2018-12-02 00:09:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:13,130 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-12-02 00:09:13,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:09:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-12-02 00:09:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 00:09:13,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:13,130 INFO L402 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] [2018-12-02 00:09:13,131 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:13,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1544781722, now seen corresponding path program 1 times [2018-12-02 00:09:13,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:13,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:13,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:13,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:13,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:13,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:13,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-02 00:09:13,180 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:13,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:13,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:13,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:13,210 INFO L272 AbstractInterpreter]: Visited 51 different actions 161 times. Merged at 20 different actions 42 times. Never widened. Performed 497 root evaluator evaluations with a maximum evaluation depth of 6. Performed 497 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-12-02 00:09:13,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:13,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:13,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:13,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:09:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:13,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:13,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-02 00:09:13,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 00:09:13,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:13,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 22 [2018-12-02 00:09:13,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:13,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 00:09:13,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 00:09:13,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-12-02 00:09:13,570 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 15 states. [2018-12-02 00:09:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:13,924 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2018-12-02 00:09:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 00:09:13,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2018-12-02 00:09:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:13,925 INFO L225 Difference]: With dead ends: 194 [2018-12-02 00:09:13,925 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 00:09:13,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-12-02 00:09:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 00:09:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2018-12-02 00:09:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 00:09:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2018-12-02 00:09:13,936 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 68 [2018-12-02 00:09:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:13,936 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2018-12-02 00:09:13,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 00:09:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-12-02 00:09:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 00:09:13,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:13,937 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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, 1, 1] [2018-12-02 00:09:13,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:13,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -476381260, now seen corresponding path program 1 times [2018-12-02 00:09:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:13,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:13,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:13,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:13,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:13,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:13,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:13,980 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-12-02 00:09:13,980 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:13,981 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:13,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:14,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:14,004 INFO L272 AbstractInterpreter]: Visited 51 different actions 161 times. Merged at 20 different actions 47 times. Never widened. Performed 457 root evaluator evaluations with a maximum evaluation depth of 6. Performed 457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-02 00:09:14,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:14,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:14,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:14,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/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-12-02 00:09:14,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:14,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:14,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:09:14,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:14,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:14,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-12-02 00:09:14,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:14,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:09:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:09:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:09:14,106 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand 7 states. [2018-12-02 00:09:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:14,175 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2018-12-02 00:09:14,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 00:09:14,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-02 00:09:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:14,176 INFO L225 Difference]: With dead ends: 183 [2018-12-02 00:09:14,176 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 00:09:14,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-12-02 00:09:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 00:09:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2018-12-02 00:09:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 00:09:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-12-02 00:09:14,188 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 69 [2018-12-02 00:09:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:14,189 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-12-02 00:09:14,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:09:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-12-02 00:09:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 00:09:14,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:14,190 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:09:14,190 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:14,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1056741109, now seen corresponding path program 1 times [2018-12-02 00:09:14,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:14,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:14,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:14,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:14,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:14,253 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-02 00:09:14,253 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [92], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:14,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:14,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:14,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:14,286 INFO L272 AbstractInterpreter]: Visited 51 different actions 166 times. Merged at 20 different actions 49 times. Never widened. Performed 483 root evaluator evaluations with a maximum evaluation depth of 6. Performed 483 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-12-02 00:09:14,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:14,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:14,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:14,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:09:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:14,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:14,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 00:09:14,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-02 00:09:14,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:09:14,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 10] total 20 [2018-12-02 00:09:14,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:09:14,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:09:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:09:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-02 00:09:14,504 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 8 states. [2018-12-02 00:09:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:14,536 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-12-02 00:09:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:09:14,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-12-02 00:09:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:14,537 INFO L225 Difference]: With dead ends: 104 [2018-12-02 00:09:14,537 INFO L226 Difference]: Without dead ends: 89 [2018-12-02 00:09:14,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:09:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-02 00:09:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-12-02 00:09:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 00:09:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2018-12-02 00:09:14,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 71 [2018-12-02 00:09:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:14,546 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2018-12-02 00:09:14,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:09:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-12-02 00:09:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 00:09:14,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:14,547 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-12-02 00:09:14,547 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:14,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:14,548 INFO L82 PathProgramCache]: Analyzing trace with hash -336734405, now seen corresponding path program 1 times [2018-12-02 00:09:14,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:14,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:14,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:14,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:14,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 00:09:14,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:14,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:14,604 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-02 00:09:14,604 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:14,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:14,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:14,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:14,669 INFO L272 AbstractInterpreter]: Visited 52 different actions 255 times. Merged at 21 different actions 96 times. Never widened. Performed 808 root evaluator evaluations with a maximum evaluation depth of 6. Performed 808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-02 00:09:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:14,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:14,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:09:14,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:14,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:14,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-02 00:09:14,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 00:09:15,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:15,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 9] total 22 [2018-12-02 00:09:15,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:15,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 00:09:15,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 00:09:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-12-02 00:09:15,026 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 16 states. [2018-12-02 00:09:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:17,633 INFO L93 Difference]: Finished difference Result 200 states and 241 transitions. [2018-12-02 00:09:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 00:09:17,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2018-12-02 00:09:17,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:17,635 INFO L225 Difference]: With dead ends: 200 [2018-12-02 00:09:17,635 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 00:09:17,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 00:09:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 00:09:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2018-12-02 00:09:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 00:09:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-02 00:09:17,641 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 71 [2018-12-02 00:09:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:17,641 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-02 00:09:17,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 00:09:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-02 00:09:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 00:09:17,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:17,642 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1] [2018-12-02 00:09:17,642 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:17,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1992333140, now seen corresponding path program 1 times [2018-12-02 00:09:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:17,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:17,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:17,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 00:09:17,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:17,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:17,669 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-12-02 00:09:17,669 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [64], [66], [69], [77], [86], [90], [92], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:17,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:17,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:17,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:17,713 INFO L272 AbstractInterpreter]: Visited 53 different actions 278 times. Merged at 21 different actions 107 times. Never widened. Performed 870 root evaluator evaluations with a maximum evaluation depth of 6. Performed 870 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-02 00:09:17,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:17,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:17,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:17,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:09:17,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:17,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:17,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 00:09:17,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 00:09:17,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:17,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-12-02 00:09:17,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:17,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:09:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:09:17,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-12-02 00:09:17,859 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-12-02 00:09:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:17,891 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2018-12-02 00:09:17,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:09:17,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-12-02 00:09:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:17,891 INFO L225 Difference]: With dead ends: 168 [2018-12-02 00:09:17,891 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 00:09:17,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=119, Unknown=0, NotChecked=0, Total=210 [2018-12-02 00:09:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 00:09:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2018-12-02 00:09:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-02 00:09:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-02 00:09:17,897 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 76 [2018-12-02 00:09:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:17,897 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-02 00:09:17,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:09:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-02 00:09:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 00:09:17,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:09:17,898 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:09:17,898 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:09:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -581082707, now seen corresponding path program 1 times [2018-12-02 00:09:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:09:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:17,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:09:17,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:09:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 41 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 00:09:17,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:17,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:09:17,958 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 79 with the following transitions: [2018-12-02 00:09:17,958 INFO L205 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [60], [66], [69], [71], [77], [86], [90], [92], [96], [102], [104], [105], [109], [111], [113], [115], [117], [122], [127], [129], [132], [135], [140], [143], [147], [155], [158], [160], [166], [167], [168], [170], [171], [172], [173], [174], [175], [176], [177], [178], [179], [180] [2018-12-02 00:09:17,958 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:09:17,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:09:17,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:09:17,990 INFO L272 AbstractInterpreter]: Visited 53 different actions 230 times. Merged at 21 different actions 78 times. Never widened. Performed 689 root evaluator evaluations with a maximum evaluation depth of 6. Performed 689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-02 00:09:17,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:09:17,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:09:17,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:09:17,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:09:17,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:09:17,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:09:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:09:18,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:09:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-02 00:09:18,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:09:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 00:09:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:09:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 24 [2018-12-02 00:09:18,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:09:18,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 00:09:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 00:09:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-12-02 00:09:18,290 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 17 states. [2018-12-02 00:09:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:09:18,672 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-12-02 00:09:18,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 00:09:18,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2018-12-02 00:09:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:09:18,672 INFO L225 Difference]: With dead ends: 163 [2018-12-02 00:09:18,673 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 00:09:18,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 00:09:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 00:09:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 00:09:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 00:09:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 00:09:18,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-02 00:09:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:09:18,674 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:09:18,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 00:09:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:09:18,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 00:09:18,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 00:09:18,838 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 80 [2018-12-02 00:09:18,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:18,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:19,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:09:20,008 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2018-12-02 00:09:20,015 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-12-02 00:09:20,015 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse1 (mod |mulflt_#in~a| 4294967296)) (.cse0 (= mulflt_~__retres10~1 0))) (and (or (and (= mulflt_~a 0) (= mulflt_~b 0)) (not (= |mulflt_#in~a| 0)) (not (= |mulflt_#in~b| 0))) (or .cse0 (<= (mod mulflt_~b 4294967296) .cse1)) (or (and (= mulflt_~b |mulflt_#in~a|) (not (= .cse1 0))) .cse0 (and (exists ((mulflt_~b Int)) (let ((.cse2 (mod mulflt_~b 4294967296))) (and (<= .cse2 (mod |mulflt_#in~a| 4294967296)) (not (= .cse2 0))))) (= mulflt_~a |mulflt_#in~a|) (not (= 0 (mod |mulflt_#in~b| 4294967296))))))) [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L444 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-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-02 00:09:20,016 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 0)) .cse0) (not (= base2flt_~m 0)) (or (and (<= base2flt_~m |base2flt_#in~m|) (<= |base2flt_#in~m| base2flt_~m) (= base2flt_~e 0)) (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (= (mod base2flt_~m 4) 0)) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L444 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| 0)) .cse0) (or (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (and (not (= base2flt_~m 0)) (= (mod base2flt_~m 4) 0))) (not (= |base2flt_#in~m| 1)) .cse0))) [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L444 ceAbstractionStarter]: At program point L47-2(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-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 00:09:20,017 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-12-02 00:09:20,017 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-12-02 00:09:20,018 INFO L444 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-12-02 00:09:20,018 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 00:09:20,019 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0)) (<= (+ main_~sa~0 1) 0) (and (= main_~tmp~2 0) (<= (mod main_~a~0 4294967296) 0) (= main_~sa~0 0) (= 0 main_~zero~0))) [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-02 00:09:20,019 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-02 00:09:20,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:09:20 BoogieIcfgContainer [2018-12-02 00:09:20,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:09:20,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:09:20,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:09:20,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:09:20,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:08:59" (3/4) ... [2018-12-02 00:09:20,035 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 00:09:20,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 00:09:20,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-12-02 00:09:20,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-02 00:09:20,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 00:09:20,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 00:09:20,042 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 00:09:20,043 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 00:09:20,043 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 00:09:20,059 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) [2018-12-02 00:09:20,059 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-12-02 00:09:20,059 WARN L221 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-12-02 00:09:20,059 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\old(e) == 0)) [2018-12-02 00:09:20,060 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && (__retres10 == 0 || b % 4294967296 <= \old(a) % 4294967296)) && (((b == \old(a) && !(\old(a) % 4294967296 == 0)) || __retres10 == 0) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && a == \old(a)) && !(0 == \old(b) % 4294967296))) [2018-12-02 00:09:20,077 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c525b214-03ff-40fe-a607-b65ba02c468d/bin-2019/utaipan/witness.graphml [2018-12-02 00:09:20,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:09:20,078 INFO L168 Benchmark]: Toolchain (without parser) took 21425.94 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 525.9 MB). Free memory was 952.5 MB in the beginning and 1.5 GB in the end (delta: -520.5 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-12-02 00:09:20,078 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:09:20,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.5 MB in the beginning and 939.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 00:09:20,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:09:20,079 INFO L168 Benchmark]: Boogie Preprocessor took 17.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:09:20,079 INFO L168 Benchmark]: RCFGBuilder took 210.73 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:09:20,079 INFO L168 Benchmark]: TraceAbstraction took 20952.14 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -375.9 MB). Peak memory consumption was 626.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:09:20,079 INFO L168 Benchmark]: Witness Printer took 45.37 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:09:20,081 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 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.33 ms. Allocated memory is still 1.0 GB. Free memory was 952.5 MB in the beginning and 939.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.73 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20952.14 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 393.7 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -375.9 MB). Peak memory consumption was 626.5 MB. Max. memory is 11.5 GB. * Witness Printer took 45.37 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] * 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) == 0) || !(\old(e) == 0)) && ((((m == 2 && e + 1 == 0) || (!(m == 0) && m % 4 == 0)) || !(\old(m) == 1)) || !(\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: 147]: Loop Invariant [2018-12-02 00:09:20,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] [2018-12-02 00:09:20,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[mulflt_~b,QUANTIFIED] Derived loop invariant: ((((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) && (__retres10 == 0 || b % 4294967296 <= \old(a) % 4294967296)) && (((b == \old(a) && !(\old(a) % 4294967296 == 0)) || __retres10 == 0) || (((\exists mulflt_~b : int :: mulflt_~b % 4294967296 <= \old(a) % 4294967296 && !(mulflt_~b % 4294967296 == 0)) && a == \old(a)) && !(0 == \old(b) % 4294967296))) - 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: 27]: Loop Invariant Derived loop invariant: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((((m <= \old(m) && \old(m) <= m) && e == 0) || (m == 2 && e + 1 == 0) || m % 4 == 0) || !(\old(m) == 1)) || !(\old(e) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 20.9s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1104 SDtfs, 1103 SDslu, 8594 SDs, 0 SdLazy, 2591 SolverSat, 176 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1908 GetRequests, 1453 SyntacticMatches, 18 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 16 AbstIntIterations, 7 AbstIntStrong, 0.7462859152099663 AbsIntWeakeningRatio, 1.369620253164557 AbsIntAvgWeakeningVarsNumRemoved, 0.810126582278481 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 447 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 252 PreInvPairs, 759 NumberOfFragments, 268 HoareAnnotationTreeSize, 252 FomulaSimplifications, 626211218 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 18 FomulaSimplificationsInter, 50327 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2345 ConstructedInterpolants, 66 QuantifiedInterpolants, 395868 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1650 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 36 InterpolantComputations, 3 PerfectInterpolantSequences, 1018/1534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...