./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:46:39,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:46:39,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:46:39,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:46:39,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:46:39,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:46:39,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:46:39,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:46:39,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:46:39,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:46:39,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:46:39,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:46:39,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:46:39,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:46:39,036 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:46:39,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:46:39,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:46:39,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:46:39,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:46:39,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:46:39,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:46:39,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:46:39,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:46:39,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:46:39,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:46:39,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:46:39,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:46:39,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:46:39,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:46:39,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:46:39,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:46:39,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:46:39,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:46:39,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:46:39,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:46:39,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:46:39,045 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:46:39,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:46:39,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:46:39,052 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:46:39,052 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:46:39,052 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:46:39,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:46:39,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:46:39,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:46:39,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:46:39,054 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:46:39,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:46:39,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:46:39,055 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_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12b1dd0058eac32d4e9fcabcf1e935c527e522e6 [2018-12-02 01:46:39,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:46:39,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:46:39,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:46:39,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:46:39,082 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:46:39,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 01:46:39,115 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/data/56ae4759e/127d939ba5fe4c3caf8c5ec06c91d6cd/FLAG9c3e92103 [2018-12-02 01:46:39,568 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:46:39,569 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/sv-benchmarks/c/bitvector/soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 01:46:39,574 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/data/56ae4759e/127d939ba5fe4c3caf8c5ec06c91d6cd/FLAG9c3e92103 [2018-12-02 01:46:39,961 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/data/56ae4759e/127d939ba5fe4c3caf8c5ec06c91d6cd [2018-12-02 01:46:39,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:46:39,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:46:39,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:46:39,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:46:39,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:46:39,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:46:39" (1/1) ... [2018-12-02 01:46:39,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e47b5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:39, skipping insertion in model container [2018-12-02 01:46:39,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:46:39" (1/1) ... [2018-12-02 01:46:39,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:46:39,997 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:46:40,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:46:40,106 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:46:40,127 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:46:40,135 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:46:40,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40 WrapperNode [2018-12-02 01:46:40,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:46:40,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:46:40,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:46:40,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:46:40,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:46:40,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:46:40,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:46:40,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:46:40,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... [2018-12-02 01:46:40,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:46:40,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:46:40,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:46:40,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:46:40,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:46:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:46:40,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:46:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-12-02 01:46:40,235 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-12-02 01:46:40,235 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-02 01:46:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-02 01:46:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:46:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:46:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:46:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:46:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 01:46:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 01:46:40,392 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:46:40,392 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 01:46:40,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:46:40 BoogieIcfgContainer [2018-12-02 01:46:40,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:46:40,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:46:40,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:46:40,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:46:40,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:46:39" (1/3) ... [2018-12-02 01:46:40,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de2ddb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:46:40, skipping insertion in model container [2018-12-02 01:46:40,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:46:40" (2/3) ... [2018-12-02 01:46:40,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de2ddb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:46:40, skipping insertion in model container [2018-12-02 01:46:40,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:46:40" (3/3) ... [2018-12-02 01:46:40,398 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-02 01:46:40,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:46:40,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:46:40,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:46:40,435 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:46:40,435 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:46:40,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:46:40,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:46:40,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:46:40,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:46:40,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:46:40,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:46:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-02 01:46:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 01:46:40,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:40,450 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 01:46:40,452 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:40,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash -848954410, now seen corresponding path program 1 times [2018-12-02 01:46:40,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:40,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:40,568 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 01:46:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:46:40,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:40,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:46:40,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:46:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:46:40,582 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-02 01:46:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:40,618 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2018-12-02 01:46:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:46:40,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 01:46:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:40,626 INFO L225 Difference]: With dead ends: 118 [2018-12-02 01:46:40,626 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 01:46:40,628 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 01:46:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 01:46:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 01:46:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 01:46:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2018-12-02 01:46:40,654 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 48 [2018-12-02 01:46:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:40,655 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2018-12-02 01:46:40,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:46:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2018-12-02 01:46:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 01:46:40,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:40,657 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 01:46:40,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:40,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash -796554308, now seen corresponding path program 1 times [2018-12-02 01:46:40,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:40,697 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 01:46:40,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:40,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:40,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:40,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:40,699 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand 4 states. [2018-12-02 01:46:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:40,718 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2018-12-02 01:46:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:46:40,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 01:46:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:40,719 INFO L225 Difference]: With dead ends: 64 [2018-12-02 01:46:40,719 INFO L226 Difference]: Without dead ends: 52 [2018-12-02 01:46:40,720 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 01:46:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-02 01:46:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-02 01:46:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 01:46:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2018-12-02 01:46:40,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 50 [2018-12-02 01:46:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:40,724 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2018-12-02 01:46:40,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:40,724 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2018-12-02 01:46:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 01:46:40,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:40,725 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 01:46:40,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:40,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1817622662, now seen corresponding path program 1 times [2018-12-02 01:46:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:40,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:40,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:40,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:40,766 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 01:46:40,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:40,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:40,767 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-02 01:46:40,768 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 01:46:40,789 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:40,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:40,854 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:40,855 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 01:46:40,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:40,859 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:40,893 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-12-02 01:46:40,893 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:40,928 INFO L418 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-12-02 01:46:40,929 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:40,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:40,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-12-02 01:46:40,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:40,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 01:46:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 01:46:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:46:40,930 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand 10 states. [2018-12-02 01:46:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:41,278 INFO L93 Difference]: Finished difference Result 124 states and 164 transitions. [2018-12-02 01:46:41,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 01:46:41,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-12-02 01:46:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:41,280 INFO L225 Difference]: With dead ends: 124 [2018-12-02 01:46:41,280 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 01:46:41,281 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 01:46:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 01:46:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-12-02 01:46:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 01:46:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-12-02 01:46:41,289 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 50 [2018-12-02 01:46:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:41,290 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-12-02 01:46:41,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 01:46:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-12-02 01:46:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 01:46:41,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:41,291 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 01:46:41,291 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:41,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -30301019, now seen corresponding path program 1 times [2018-12-02 01:46:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:41,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:41,325 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 01:46:41,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:41,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:41,326 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-12-02 01:46:41,326 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 01:46:41,328 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:41,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:41,338 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:41,338 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 01:46:41,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:41,341 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:41,360 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 71.46% of their original sizes. [2018-12-02 01:46:41,360 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:41,402 INFO L418 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-12-02 01:46:41,402 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:41,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-12-02 01:46:41,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:41,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:46:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:46:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:46:41,403 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 11 states. [2018-12-02 01:46:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:41,678 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2018-12-02 01:46:41,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:46:41,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-12-02 01:46:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:41,680 INFO L225 Difference]: With dead ends: 122 [2018-12-02 01:46:41,680 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 01:46:41,680 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 01:46:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 01:46:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-12-02 01:46:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 01:46:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-12-02 01:46:41,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 55 [2018-12-02 01:46:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:41,688 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-12-02 01:46:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:46:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-12-02 01:46:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 01:46:41,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:41,690 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 01:46:41,690 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:41,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 801154692, now seen corresponding path program 1 times [2018-12-02 01:46:41,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:41,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:41,759 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 01:46:41,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:41,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:41,760 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-02 01:46:41,760 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 01:46:41,761 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:41,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:41,767 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:41,767 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 01:46:41,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:41,769 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:41,782 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 66.3% of their original sizes. [2018-12-02 01:46:41,782 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:41,818 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-02 01:46:41,819 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:41,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:41,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-12-02 01:46:41,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:41,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:46:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:46:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:46:41,819 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 11 states. [2018-12-02 01:46:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:42,097 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2018-12-02 01:46:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 01:46:42,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-12-02 01:46:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:42,098 INFO L225 Difference]: With dead ends: 129 [2018-12-02 01:46:42,098 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 01:46:42,099 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 01:46:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 01:46:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2018-12-02 01:46:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 01:46:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-12-02 01:46:42,105 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 57 [2018-12-02 01:46:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:42,106 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-12-02 01:46:42,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:46:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-12-02 01:46:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 01:46:42,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:42,107 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 01:46:42,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:42,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1162955476, now seen corresponding path program 1 times [2018-12-02 01:46:42,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:42,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:42,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:42,140 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 01:46:42,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:42,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:42,140 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-02 01:46:42,140 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 01:46:42,141 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:42,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:42,170 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:42,170 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 01:46:42,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:42,172 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:42,191 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 61.95% of their original sizes. [2018-12-02 01:46:42,191 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:42,333 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-02 01:46:42,333 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:42,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-12-02 01:46:42,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:42,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 01:46:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 01:46:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:46:42,334 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 21 states. [2018-12-02 01:46:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:42,982 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2018-12-02 01:46:42,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 01:46:42,983 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-12-02 01:46:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:42,983 INFO L225 Difference]: With dead ends: 142 [2018-12-02 01:46:42,983 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 01:46:42,984 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 01:46:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 01:46:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2018-12-02 01:46:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 01:46:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-12-02 01:46:42,990 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 58 [2018-12-02 01:46:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:42,990 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-12-02 01:46:42,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 01:46:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-12-02 01:46:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 01:46:42,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:42,991 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 01:46:42,991 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:42,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2120894570, now seen corresponding path program 1 times [2018-12-02 01:46:42,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:42,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:42,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:42,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:42,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:43,026 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 01:46:43,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:43,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:43,027 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-02 01:46:43,027 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 01:46:43,028 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:43,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:43,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:43,052 INFO L272 AbstractInterpreter]: Visited 45 different actions 87 times. Merged at 6 different actions 14 times. Never widened. Performed 256 root evaluator evaluations with a maximum evaluation depth of 4. Performed 256 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 5 different actions. Largest state had 23 variables. [2018-12-02 01:46:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:43,054 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:43,084 INFO L227 lantSequenceWeakener]: Weakened 40 states. On average, predicates are now at 63.8% of their original sizes. [2018-12-02 01:46:43,084 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:43,344 INFO L418 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-12-02 01:46:43,344 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-12-02 01:46:43,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:43,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 01:46:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 01:46:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-12-02 01:46:43,345 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 31 states. [2018-12-02 01:46:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:44,407 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2018-12-02 01:46:44,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 01:46:44,407 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-12-02 01:46:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:44,408 INFO L225 Difference]: With dead ends: 122 [2018-12-02 01:46:44,408 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 01:46:44,409 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=2514, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 01:46:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 01:46:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-12-02 01:46:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 01:46:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-12-02 01:46:44,418 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 58 [2018-12-02 01:46:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:44,418 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-12-02 01:46:44,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 01:46:44,419 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-12-02 01:46:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:46:44,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:44,419 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 01:46:44,420 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:44,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:44,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1063907295, now seen corresponding path program 1 times [2018-12-02 01:46:44,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:44,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:44,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:44,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:44,460 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 01:46:44,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:46:44,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:46:44,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-02 01:46:44,461 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 01:46:44,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:46:44,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:46:44,504 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:46:44,504 INFO L272 AbstractInterpreter]: Visited 45 different actions 143 times. Merged at 18 different actions 43 times. Never widened. Performed 419 root evaluator evaluations with a maximum evaluation depth of 4. Performed 419 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 4 different actions. Largest state had 23 variables. [2018-12-02 01:46:44,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:44,505 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:46:44,533 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 63.2% of their original sizes. [2018-12-02 01:46:44,533 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:46:45,230 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-02 01:46:45,230 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:46:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:46:45,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [5] total 32 [2018-12-02 01:46:45,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:45,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 01:46:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 01:46:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-12-02 01:46:45,233 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 29 states. [2018-12-02 01:47:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:04,984 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2018-12-02 01:47:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 01:47:04,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-12-02 01:47:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:04,985 INFO L225 Difference]: With dead ends: 146 [2018-12-02 01:47:04,985 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 01:47:04,986 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 01:47:04,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 01:47:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2018-12-02 01:47:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 01:47:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2018-12-02 01:47:04,993 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 62 [2018-12-02 01:47:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:04,994 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2018-12-02 01:47:04,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 01:47:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2018-12-02 01:47:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:47:04,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:04,995 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 01:47:04,995 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:04,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash -851500765, now seen corresponding path program 1 times [2018-12-02 01:47:04,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:04,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:04,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:04,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:04,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:05,017 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 01:47:05,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:05,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:05,018 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-12-02 01:47:05,018 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 01:47:05,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:05,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:05,046 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 01:47:05,046 INFO L272 AbstractInterpreter]: Visited 45 different actions 155 times. Merged at 18 different actions 49 times. Never widened. Performed 467 root evaluator evaluations with a maximum evaluation depth of 4. Performed 467 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-02 01:47:05,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:05,049 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 01:47:05,065 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 64.5% of their original sizes. [2018-12-02 01:47:05,065 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 01:47:05,185 INFO L418 sIntCurrentIteration]: We unified 61 AI predicates to 61 [2018-12-02 01:47:05,185 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 01:47:05,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:47:05,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-12-02 01:47:05,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:47:05,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 01:47:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 01:47:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:47:05,186 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand 20 states. [2018-12-02 01:47:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:05,568 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2018-12-02 01:47:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 01:47:05,568 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-12-02 01:47:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:05,569 INFO L225 Difference]: With dead ends: 126 [2018-12-02 01:47:05,569 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 01:47:05,569 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 01:47:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 01:47:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 75. [2018-12-02 01:47:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 01:47:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-12-02 01:47:05,575 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 62 [2018-12-02 01:47:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:05,575 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-12-02 01:47:05,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 01:47:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-12-02 01:47:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 01:47:05,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:05,575 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 01:47:05,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:05,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash -265783978, now seen corresponding path program 1 times [2018-12-02 01:47:05,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:05,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:05,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:05,595 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 01:47:05,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:05,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:05,596 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-02 01:47:05,596 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 01:47:05,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:05,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:05,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:47:05,623 INFO L272 AbstractInterpreter]: Visited 51 different actions 147 times. Merged at 14 different actions 45 times. Never widened. Performed 464 root evaluator evaluations with a maximum evaluation depth of 6. Performed 464 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 7 different actions. Largest state had 23 variables. [2018-12-02 01:47:05,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:05,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:47:05,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:05,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:05,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:05,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:47:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:05,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:05,667 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 01:47:05,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:05,715 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 01:47:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:47:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-02 01:47:05,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:47:05,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:47:05,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:47:05,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:47:05,740 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 5 states. [2018-12-02 01:47:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:05,782 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2018-12-02 01:47:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:47:05,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-02 01:47:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:05,783 INFO L225 Difference]: With dead ends: 151 [2018-12-02 01:47:05,784 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 01:47:05,784 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 01:47:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 01:47:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-12-02 01:47:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 01:47:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2018-12-02 01:47:05,790 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 63 [2018-12-02 01:47:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:05,790 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2018-12-02 01:47:05,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:47:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-12-02 01:47:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 01:47:05,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:05,791 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 01:47:05,791 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:05,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1530868887, now seen corresponding path program 1 times [2018-12-02 01:47:05,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:05,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:05,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:05,828 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 01:47:05,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:05,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:05,829 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-02 01:47:05,829 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 01:47:05,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:05,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:05,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:47:05,874 INFO L272 AbstractInterpreter]: Visited 52 different actions 234 times. Merged at 21 different actions 81 times. Never widened. Performed 772 root evaluator evaluations with a maximum evaluation depth of 6. Performed 772 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 3 different actions. Largest state had 23 variables. [2018-12-02 01:47:05,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:05,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:47:05,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:05,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:05,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:05,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:47:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:05,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 01:47:05,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 01:47:06,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:47:06,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 10] total 18 [2018-12-02 01:47:06,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:47:06,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:47:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:47:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:47:06,158 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 8 states. [2018-12-02 01:47:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:06,239 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2018-12-02 01:47:06,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:47:06,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-12-02 01:47:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:06,240 INFO L225 Difference]: With dead ends: 96 [2018-12-02 01:47:06,240 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 01:47:06,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:47:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 01:47:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-12-02 01:47:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 01:47:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-12-02 01:47:06,248 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 65 [2018-12-02 01:47:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:06,248 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-12-02 01:47:06,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:47:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-12-02 01:47:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 01:47:06,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:06,249 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 01:47:06,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:06,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 889285657, now seen corresponding path program 2 times [2018-12-02 01:47:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:06,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:06,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:06,302 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 01:47:06,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:06,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:06,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 01:47:06,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 01:47:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:06,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:06,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:47:06,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 01:47:06,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-02 01:47:06,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:47:06,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 01:47:06,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 01:47:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:47:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [6] total 21 [2018-12-02 01:47:06,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:47:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:47:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:47:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:47:06,558 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 11 states. [2018-12-02 01:47:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:06,674 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-12-02 01:47:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 01:47:06,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-12-02 01:47:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:06,675 INFO L225 Difference]: With dead ends: 100 [2018-12-02 01:47:06,675 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 01:47:06,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-12-02 01:47:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 01:47:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-12-02 01:47:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 01:47:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-12-02 01:47:06,680 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 65 [2018-12-02 01:47:06,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:06,680 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-12-02 01:47:06,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:47:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-12-02 01:47:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 01:47:06,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:06,680 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:47:06,680 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:06,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1372971101, now seen corresponding path program 1 times [2018-12-02 01:47:06,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:06,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:47:06,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:06,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 01:47:06,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:06,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:06,716 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-12-02 01:47:06,717 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 01:47:06,717 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:06,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:06,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:47:06,743 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 01:47:06,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:06,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:47:06,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:06,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:06,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:06,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:47:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:06,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 01:47:06,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 01:47:07,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:47:07,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2018-12-02 01:47:07,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:47:07,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 01:47:07,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 01:47:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:47:07,017 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 14 states. [2018-12-02 01:47:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:07,427 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2018-12-02 01:47:07,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 01:47:07,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-12-02 01:47:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:07,428 INFO L225 Difference]: With dead ends: 193 [2018-12-02 01:47:07,428 INFO L226 Difference]: Without dead ends: 142 [2018-12-02 01:47:07,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 01:47:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-02 01:47:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 96. [2018-12-02 01:47:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 01:47:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-12-02 01:47:07,435 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 65 [2018-12-02 01:47:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:07,435 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-12-02 01:47:07,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 01:47:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-12-02 01:47:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:47:07,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:07,435 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 01:47:07,435 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:07,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 16355109, now seen corresponding path program 1 times [2018-12-02 01:47:07,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:07,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:07,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:07,455 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 01:47:07,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:07,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:07,456 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-12-02 01:47:07,456 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 01:47:07,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:07,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:07,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:47:07,481 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 01:47:07,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:07,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:47:07,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:07,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:07,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:07,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:47:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:07,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:07,508 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 01:47:07,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:07,561 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 01:47:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:47:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-02 01:47:07,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:47:07,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:47:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:47:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:47:07,576 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 6 states. [2018-12-02 01:47:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:07,619 INFO L93 Difference]: Finished difference Result 200 states and 248 transitions. [2018-12-02 01:47:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:47:07,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 01:47:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:07,620 INFO L225 Difference]: With dead ends: 200 [2018-12-02 01:47:07,620 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 01:47:07,620 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 01:47:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 01:47:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2018-12-02 01:47:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 01:47:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-12-02 01:47:07,630 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 66 [2018-12-02 01:47:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:07,630 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-12-02 01:47:07,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:47:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-12-02 01:47:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:47:07,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:47:07,631 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 01:47:07,631 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:47:07,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -644872026, now seen corresponding path program 1 times [2018-12-02 01:47:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:47:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:07,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:47:07,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:47:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:07,679 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 01:47:07,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:07,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:47:07,680 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-02 01:47:07,680 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 01:47:07,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:47:07,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:47:07,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:47:07,705 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 01:47:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:47:07,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:47:07,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:47:07,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/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 01:47:07,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:47:07,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:47:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:47:07,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:47:07,810 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 01:47:07,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:47:07,952 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 01:47:07,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:47:07,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 20 [2018-12-02 01:47:07,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:47:07,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 01:47:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 01:47:07,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:47:07,977 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 14 states. [2018-12-02 01:47:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:47:08,226 INFO L93 Difference]: Finished difference Result 204 states and 254 transitions. [2018-12-02 01:47:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 01:47:08,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-12-02 01:47:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:47:08,226 INFO L225 Difference]: With dead ends: 204 [2018-12-02 01:47:08,226 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 01:47:08,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-12-02 01:47:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 01:47:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 01:47:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 01:47:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 01:47:08,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-12-02 01:47:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:47:08,227 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 01:47:08,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 01:47:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 01:47:08,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 01:47:08,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 01:47:08,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 01:47:08,678 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L451 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-12-02 01:47:08,678 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (and (let ((.cse0 (not (= 0 (mod |mulflt_#in~b| 4294967296))))) (or (and (= mulflt_~a |mulflt_#in~a|) (= mulflt_~b |mulflt_#in~b|) .cse0) (= mulflt_~__retres10~1 0) (and (= mulflt_~b |mulflt_#in~a|) .cse0 (not (= (mod |mulflt_#in~a| 4294967296) 0))))) (or (and (= mulflt_~a 0) (= mulflt_~b 0)) (not (= |mulflt_#in~a| 0)) (not (= |mulflt_#in~b| 0)))) [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-02 01:47:08,679 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 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-02 01:47:08,679 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 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-02 01:47:08,679 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-02 01:47:08,679 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-02 01:47:08,680 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 (not (= |base2flt_#in~m| 1)) (and (not (= base2flt_~m 0)) (or (and (= base2flt_~m 2) (= (+ base2flt_~e 1) 0)) (= (mod base2flt_~m 4) 0))) .cse0))) [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-02 01:47:08,680 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 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 01:47:08,680 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L451 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-12-02 01:47:08,680 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-12-02 01:47:08,680 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-12-02 01:47:08,680 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 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 01:47:08,681 INFO L444 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (or (and (= main_~tmp~2 0) (= main_~zero~0 0) (forall ((v_mulflt_~a_16 Int)) (<= (mod main_~b~0 4294967296) (mod v_mulflt_~a_16 4294967296))) (= main_~sb~0 0)) (<= (+ main_~sb~0 1) 0) (and (<= 1 main_~tmp~2) (<= 1 main_~sb~0))) [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-02 01:47:08,681 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-02 01:47:08,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:47:08 BoogieIcfgContainer [2018-12-02 01:47:08,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:47:08,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:47:08,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:47:08,692 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:47:08,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:46:40" (3/4) ... [2018-12-02 01:47:08,695 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 01:47:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 01:47:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-12-02 01:47:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-02 01:47:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 01:47:08,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 01:47:08,704 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-02 01:47:08,704 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-02 01:47:08,704 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 01:47:08,724 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 01:47:08,724 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 01:47:08,724 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 01:47:08,724 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || !(\old(e) == 0)) && ((!(\old(m) == 1) || (!(m == 0) && ((m == 2 && e + 1 == 0) || m % 4 == 0))) || !(\old(e) == 0)) [2018-12-02 01:47:08,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296)) || __retres10 == 0) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) [2018-12-02 01:47:08,748 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8d6aca9f-5035-4e5c-a4fc-6d86f8d5edac/bin-2019/utaipan/witness.graphml [2018-12-02 01:47:08,748 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:47:08,749 INFO L168 Benchmark]: Toolchain (without parser) took 28785.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.3 MB). Free memory was 953.3 MB in the beginning and 1.4 GB in the end (delta: -444.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:47:08,750 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:47:08,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:47:08,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.9 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:47:08,750 INFO L168 Benchmark]: Boogie Preprocessor took 23.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:47:08,750 INFO L168 Benchmark]: RCFGBuilder took 189.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:47:08,751 INFO L168 Benchmark]: TraceAbstraction took 28298.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -271.7 MB). Peak memory consumption was 478.9 MB. Max. memory is 11.5 GB. [2018-12-02 01:47:08,751 INFO L168 Benchmark]: Witness Printer took 56.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 436.3 kB). Peak memory consumption was 436.3 kB. Max. memory is 11.5 GB. [2018-12-02 01:47:08,752 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.23 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 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 43.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.9 MB in the beginning and 1.2 GB in the end (delta: -216.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 189.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28298.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -271.7 MB). Peak memory consumption was 478.9 MB. Max. memory is 11.5 GB. * Witness Printer took 56.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 436.3 kB). Peak memory consumption was 436.3 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || !(\old(e) == 0)) && ((!(\old(m) == 1) || (!(m == 0) && ((m == 2 && e + 1 == 0) || m % 4 == 0))) || !(\old(e) == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || ((__retres4 == 0 && m == 0) && e == 0)) || !(\old(e) == 0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((a == \old(a) && b == \old(b)) && !(0 == \old(b) % 4294967296)) || __retres10 == 0) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) - InvariantResult [Line: 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, 28.2s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 23.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 908 SDtfs, 861 SDslu, 6987 SDs, 0 SdLazy, 1237 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1368 GetRequests, 1017 SyntacticMatches, 11 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 12 AbstIntIterations, 7 AbstIntStrong, 0.7460749447458314 AbsIntWeakeningRatio, 1.369620253164557 AbsIntAvgWeakeningVarsNumRemoved, 1.0050632911392405 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 268 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 192 PreInvPairs, 383 NumberOfFragments, 254 HoareAnnotationTreeSize, 192 FomulaSimplifications, 316959 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1042 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1649 ConstructedInterpolants, 45 QuantifiedInterpolants, 228924 SizeOfPredicates, 23 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 689/925 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...