./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45b185c6c694406b0734db5727dff1b8fd93ebcf ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:20:44,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:20:44,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:20:44,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:20:44,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:20:44,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:20:44,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:20:44,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:20:44,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:20:44,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:20:44,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:20:44,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:20:44,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:20:44,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:20:44,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:20:44,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:20:44,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:20:44,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:20:44,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:20:44,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:20:44,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:20:44,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:20:44,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:20:44,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:20:44,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:20:44,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:20:44,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:20:44,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:20:44,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:20:44,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:20:44,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:20:44,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:20:44,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:20:44,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:20:44,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:20:44,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:20:44,359 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:20:44,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:20:44,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:20:44,370 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:20:44,370 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:20:44,371 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:20:44,371 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:20:44,372 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:20:44,372 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:20:44,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:20:44,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:20:44,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:20:44,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:20:44,374 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:20:44,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:20:44,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:20:44,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:20:44,374 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:20:44,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:20:44,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:20:44,375 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:20:44,375 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_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-11-18 11:20:44,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:20:44,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:20:44,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:20:44,409 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:20:44,410 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:20:44,410 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 11:20:44,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/data/ad6862c84/5400622f330443a6a3d4c3a58a91e73a/FLAG9ccd6642d [2018-11-18 11:20:44,854 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:20:44,855 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/sv-benchmarks/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 11:20:44,861 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/data/ad6862c84/5400622f330443a6a3d4c3a58a91e73a/FLAG9ccd6642d [2018-11-18 11:20:44,869 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/data/ad6862c84/5400622f330443a6a3d4c3a58a91e73a [2018-11-18 11:20:44,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:20:44,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:20:44,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:20:44,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:20:44,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:20:44,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:20:44" (1/1) ... [2018-11-18 11:20:44,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae6f900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:44, skipping insertion in model container [2018-11-18 11:20:44,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:20:44" (1/1) ... [2018-11-18 11:20:44,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:20:44,908 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:20:45,036 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:20:45,038 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:20:45,063 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:20:45,071 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:20:45,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45 WrapperNode [2018-11-18 11:20:45,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:20:45,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:20:45,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:20:45,072 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:20:45,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:20:45,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:20:45,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:20:45,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:20:45,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... [2018-11-18 11:20:45,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:20:45,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:20:45,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:20:45,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:20:45,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:20:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:20:45,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:20:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-18 11:20:45,200 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-18 11:20:45,200 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 11:20:45,200 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 11:20:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:20:45,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:20:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:20:45,201 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:20:45,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 11:20:45,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 11:20:45,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:20:45,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:20:45 BoogieIcfgContainer [2018-11-18 11:20:45,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:20:45,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:20:45,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:20:45,485 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:20:45,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:20:44" (1/3) ... [2018-11-18 11:20:45,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67134e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:20:45, skipping insertion in model container [2018-11-18 11:20:45,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:20:45" (2/3) ... [2018-11-18 11:20:45,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67134e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:20:45, skipping insertion in model container [2018-11-18 11:20:45,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:20:45" (3/3) ... [2018-11-18 11:20:45,487 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 11:20:45,494 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:20:45,499 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:20:45,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:20:45,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:20:45,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:20:45,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:20:45,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:20:45,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:20:45,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:20:45,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:20:45,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:20:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-18 11:20:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:20:45,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:45,554 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:45,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:45,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:45,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1190107182, now seen corresponding path program 1 times [2018-11-18 11:20:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:45,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:45,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:45,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 11:20:45,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:20:45,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:20:45,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:45,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:20:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:20:45,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:20:45,726 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-11-18 11:20:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:45,761 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2018-11-18 11:20:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:20:45,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 11:20:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:45,769 INFO L225 Difference]: With dead ends: 122 [2018-11-18 11:20:45,770 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 11:20:45,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:20:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 11:20:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-18 11:20:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 11:20:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2018-11-18 11:20:45,804 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 48 [2018-11-18 11:20:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:45,805 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2018-11-18 11:20:45,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:20:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2018-11-18 11:20:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 11:20:45,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:45,808 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:45,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:45,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1530966986, now seen corresponding path program 1 times [2018-11-18 11:20:45,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:45,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:45,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:45,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:45,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:45,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:45,910 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-18 11:20:45,911 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [140], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:45,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:45,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:46,017 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:46,018 INFO L272 AbstractInterpreter]: Visited 13 different actions 15 times. Never merged. Never widened. Performed 45 root evaluator evaluations with a maximum evaluation depth of 3. Performed 45 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 11:20:46,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:46,027 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:46,078 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 79.33% of their original sizes. [2018-11-18 11:20:46,078 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:46,140 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-18 11:20:46,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:46,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:46,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-18 11:20:46,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:46,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:20:46,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:20:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:20:46,143 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 10 states. [2018-11-18 11:20:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:46,814 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2018-11-18 11:20:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 11:20:46,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-18 11:20:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:46,816 INFO L225 Difference]: With dead ends: 130 [2018-11-18 11:20:46,817 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 11:20:46,818 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:20:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 11:20:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2018-11-18 11:20:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 11:20:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-11-18 11:20:46,826 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 50 [2018-11-18 11:20:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:46,827 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-11-18 11:20:46,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:20:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-18 11:20:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:20:46,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:46,828 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:46,828 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:46,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -756422958, now seen corresponding path program 1 times [2018-11-18 11:20:46,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:46,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:46,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:46,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:46,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:46,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:46,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-11-18 11:20:46,874 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:46,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:46,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:46,888 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:46,888 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 53 root evaluator evaluations with a maximum evaluation depth of 4. Performed 53 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 11:20:46,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:46,898 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:46,922 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 71.85% of their original sizes. [2018-11-18 11:20:46,922 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:46,965 INFO L415 sIntCurrentIteration]: We unified 55 AI predicates to 55 [2018-11-18 11:20:46,965 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:46,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:46,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2018-11-18 11:20:46,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:46,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:20:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:20:46,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:20:46,966 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 11 states. [2018-11-18 11:20:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:47,549 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-18 11:20:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:20:47,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-18 11:20:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:47,550 INFO L225 Difference]: With dead ends: 128 [2018-11-18 11:20:47,551 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 11:20:47,551 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:20:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 11:20:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-18 11:20:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-18 11:20:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-11-18 11:20:47,558 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 56 [2018-11-18 11:20:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-11-18 11:20:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:20:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-11-18 11:20:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 11:20:47,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:47,560 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:47,560 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:47,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:47,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1748923792, now seen corresponding path program 1 times [2018-11-18 11:20:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:47,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:47,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:47,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:47,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:47,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:47,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-18 11:20:47,668 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [67], [72], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:47,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:47,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:47,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:47,686 INFO L272 AbstractInterpreter]: Visited 19 different actions 22 times. Never merged. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 4. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 23 variables. [2018-11-18 11:20:47,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:47,707 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:47,723 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64.67% of their original sizes. [2018-11-18 11:20:47,723 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:47,790 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-18 11:20:47,790 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:47,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:47,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-18 11:20:47,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:47,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 11:20:47,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 11:20:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:20:47,791 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 11 states. [2018-11-18 11:20:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:48,575 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2018-11-18 11:20:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:20:48,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 11:20:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:48,576 INFO L225 Difference]: With dead ends: 136 [2018-11-18 11:20:48,576 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 11:20:48,577 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:20:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 11:20:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-11-18 11:20:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 11:20:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-11-18 11:20:48,584 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 58 [2018-11-18 11:20:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:48,584 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-11-18 11:20:48,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 11:20:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-11-18 11:20:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:20:48,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:48,585 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:48,585 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:48,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1704529893, now seen corresponding path program 1 times [2018-11-18 11:20:48,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:48,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:48,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:48,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:48,661 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 11:20:48,661 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:48,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:48,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:48,716 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:48,716 INFO L272 AbstractInterpreter]: Visited 34 different actions 93 times. Merged at 7 different actions 28 times. Never widened. Performed 265 root evaluator evaluations with a maximum evaluation depth of 4. Performed 265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:20:48,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:48,755 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:48,782 INFO L227 lantSequenceWeakener]: Weakened 31 states. On average, predicates are now at 63.33% of their original sizes. [2018-11-18 11:20:48,783 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:48,947 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 11:20:48,947 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:48,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-18 11:20:48,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:48,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 11:20:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 11:20:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:20:48,949 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 21 states. [2018-11-18 11:20:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:50,306 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2018-11-18 11:20:50,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 11:20:50,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2018-11-18 11:20:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:50,307 INFO L225 Difference]: With dead ends: 152 [2018-11-18 11:20:50,307 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 11:20:50,308 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 75 GetRequests, 42 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-11-18 11:20:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 11:20:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2018-11-18 11:20:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 11:20:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2018-11-18 11:20:50,317 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 60 [2018-11-18 11:20:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:50,317 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2018-11-18 11:20:50,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 11:20:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2018-11-18 11:20:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:20:50,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:50,318 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:50,319 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:50,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1579320153, now seen corresponding path program 1 times [2018-11-18 11:20:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:50,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:50,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:50,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:50,394 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 11:20:50,394 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:50,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:50,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:50,423 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:50,424 INFO L272 AbstractInterpreter]: Visited 42 different actions 101 times. Merged at 7 different actions 28 times. Never widened. Performed 277 root evaluator evaluations with a maximum evaluation depth of 4. Performed 277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:20:50,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:50,470 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:50,495 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 65.18% of their original sizes. [2018-11-18 11:20:50,495 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:50,781 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 11:20:50,781 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:50,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:50,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-18 11:20:50,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:50,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 11:20:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 11:20:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-11-18 11:20:50,782 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 27 states. [2018-11-18 11:20:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:53,083 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2018-11-18 11:20:53,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 11:20:53,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-11-18 11:20:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:53,084 INFO L225 Difference]: With dead ends: 137 [2018-11-18 11:20:53,085 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 11:20:53,085 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-11-18 11:20:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 11:20:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2018-11-18 11:20:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 11:20:53,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-11-18 11:20:53,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 60 [2018-11-18 11:20:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:53,095 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-11-18 11:20:53,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 11:20:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-11-18 11:20:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 11:20:53,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:53,097 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:53,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:53,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:53,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1636578455, now seen corresponding path program 1 times [2018-11-18 11:20:53,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:53,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:53,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:53,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:53,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:53,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-18 11:20:53,393 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [147], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:53,394 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:53,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:53,421 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:53,421 INFO L272 AbstractInterpreter]: Visited 46 different actions 105 times. Merged at 7 different actions 28 times. Never widened. Performed 285 root evaluator evaluations with a maximum evaluation depth of 4. Performed 285 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:20:53,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:53,426 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:53,454 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 65.92% of their original sizes. [2018-11-18 11:20:53,454 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:53,687 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-18 11:20:53,687 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:53,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:53,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-11-18 11:20:53,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:53,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 11:20:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 11:20:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-11-18 11:20:53,688 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 31 states. [2018-11-18 11:20:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:20:57,678 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2018-11-18 11:20:57,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-18 11:20:57,678 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-11-18 11:20:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:20:57,679 INFO L225 Difference]: With dead ends: 139 [2018-11-18 11:20:57,679 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 11:20:57,680 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=2917, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 11:20:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 11:20:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2018-11-18 11:20:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 11:20:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2018-11-18 11:20:57,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 60 [2018-11-18 11:20:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:20:57,686 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2018-11-18 11:20:57,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 11:20:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2018-11-18 11:20:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:20:57,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:20:57,688 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:20:57,688 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:20:57,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1528990243, now seen corresponding path program 1 times [2018-11-18 11:20:57,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:20:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:57,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:20:57,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:20:57,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:20:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:20:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:20:57,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:20:57,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:20:57,744 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-18 11:20:57,744 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [92], [98], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:20:57,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:20:57,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:20:57,789 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:20:57,789 INFO L272 AbstractInterpreter]: Visited 47 different actions 140 times. Merged at 15 different actions 39 times. Never widened. Performed 393 root evaluator evaluations with a maximum evaluation depth of 4. Performed 393 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:20:57,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:20:57,831 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:20:57,861 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 64.24% of their original sizes. [2018-11-18 11:20:57,861 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:20:58,274 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-18 11:20:58,274 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:20:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:20:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [5] total 34 [2018-11-18 11:20:58,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:20:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-18 11:20:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-18 11:20:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2018-11-18 11:20:58,275 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 31 states. [2018-11-18 11:21:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:01,631 INFO L93 Difference]: Finished difference Result 174 states and 218 transitions. [2018-11-18 11:21:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 11:21:01,632 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-11-18 11:21:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:01,633 INFO L225 Difference]: With dead ends: 174 [2018-11-18 11:21:01,633 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 11:21:01,634 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=2685, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 11:21:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 11:21:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2018-11-18 11:21:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 11:21:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2018-11-18 11:21:01,650 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 65 [2018-11-18 11:21:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:01,651 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2018-11-18 11:21:01,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-18 11:21:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2018-11-18 11:21:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:21:01,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:01,652 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:01,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:01,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 465154463, now seen corresponding path program 1 times [2018-11-18 11:21:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:01,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:01,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:01,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 11:21:01,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:21:01,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:21:01,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:21:01,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:21:01,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:21:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:21:01,737 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand 4 states. [2018-11-18 11:21:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:01,873 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-18 11:21:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:21:01,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-18 11:21:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:01,874 INFO L225 Difference]: With dead ends: 113 [2018-11-18 11:21:01,874 INFO L226 Difference]: Without dead ends: 101 [2018-11-18 11:21:01,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:21:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-18 11:21:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2018-11-18 11:21:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 11:21:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2018-11-18 11:21:01,883 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 65 [2018-11-18 11:21:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:01,884 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2018-11-18 11:21:01,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:21:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2018-11-18 11:21:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:21:01,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:01,885 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:01,885 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:01,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 850568993, now seen corresponding path program 1 times [2018-11-18 11:21:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:01,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:01,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:01,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:02,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:02,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:02,002 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-18 11:21:02,003 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [10], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:02,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:02,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:02,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 11:21:02,052 INFO L272 AbstractInterpreter]: Visited 47 different actions 180 times. Merged at 19 different actions 65 times. Never widened. Performed 534 root evaluator evaluations with a maximum evaluation depth of 4. Performed 534 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:21:02,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:02,059 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 11:21:02,078 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 65.68% of their original sizes. [2018-11-18 11:21:02,078 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 11:21:02,204 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-18 11:21:02,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 11:21:02,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:21:02,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-18 11:21:02,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:21:02,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 11:21:02,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 11:21:02,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-18 11:21:02,205 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand 20 states. [2018-11-18 11:21:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:02,677 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2018-11-18 11:21:02,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 11:21:02,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-11-18 11:21:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:02,678 INFO L225 Difference]: With dead ends: 123 [2018-11-18 11:21:02,678 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 11:21:02,679 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 82 GetRequests, 48 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-11-18 11:21:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 11:21:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2018-11-18 11:21:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 11:21:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2018-11-18 11:21:02,689 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 65 [2018-11-18 11:21:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:02,690 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2018-11-18 11:21:02,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 11:21:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2018-11-18 11:21:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 11:21:02,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:02,691 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:02,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:02,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1022157286, now seen corresponding path program 1 times [2018-11-18 11:21:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:02,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:02,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:02,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:02,751 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-18 11:21:02,751 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [92], [98], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:02,752 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:02,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:02,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:02,786 INFO L272 AbstractInterpreter]: Visited 53 different actions 147 times. Merged at 15 different actions 39 times. Never widened. Performed 400 root evaluator evaluations with a maximum evaluation depth of 6. Performed 400 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:21:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:02,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:02,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:02,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:02,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:02,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 11:21:02,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:03,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:03,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-18 11:21:03,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:03,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:21:03,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:21:03,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:21:03,026 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 5 states. [2018-11-18 11:21:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:03,257 INFO L93 Difference]: Finished difference Result 184 states and 240 transitions. [2018-11-18 11:21:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:21:03,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-11-18 11:21:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:03,258 INFO L225 Difference]: With dead ends: 184 [2018-11-18 11:21:03,258 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 11:21:03,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:21:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 11:21:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2018-11-18 11:21:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 11:21:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-11-18 11:21:03,281 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 66 [2018-11-18 11:21:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:03,281 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-11-18 11:21:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:21:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-11-18 11:21:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:21:03,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:03,284 INFO L375 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, 1, 1, 1] [2018-11-18 11:21:03,284 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:03,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1897163528, now seen corresponding path program 1 times [2018-11-18 11:21:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:03,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:03,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:03,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:03,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:03,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 11:21:03,475 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [92], [98], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:03,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:03,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:03,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:03,512 INFO L272 AbstractInterpreter]: Visited 54 different actions 210 times. Merged at 21 different actions 63 times. Never widened. Performed 564 root evaluator evaluations with a maximum evaluation depth of 6. Performed 564 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-18 11:21:03,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:03,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:03,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:03,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:03,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:03,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:03,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 11:21:03,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:21:03,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:21:03,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 10] total 18 [2018-11-18 11:21:03,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:21:03,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:21:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:21:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-18 11:21:03,995 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 8 states. [2018-11-18 11:21:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:04,081 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2018-11-18 11:21:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:21:04,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-18 11:21:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:04,082 INFO L225 Difference]: With dead ends: 118 [2018-11-18 11:21:04,082 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 11:21:04,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:21:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 11:21:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-11-18 11:21:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 11:21:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2018-11-18 11:21:04,090 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 68 [2018-11-18 11:21:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:04,090 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2018-11-18 11:21:04,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:21:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2018-11-18 11:21:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:21:04,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:04,091 INFO L375 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, 1, 1, 1] [2018-11-18 11:21:04,091 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:04,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 490456712, now seen corresponding path program 2 times [2018-11-18 11:21:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:04,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:04,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:04,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:04,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:04,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:04,315 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:21:04,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:21:04,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:04,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:21:04,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:21:04,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 11:21:04,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:21:04,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:21:04,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:21:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:21:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [6] total 27 [2018-11-18 11:21:05,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:21:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 11:21:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 11:21:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-11-18 11:21:05,383 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 13 states. [2018-11-18 11:21:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:07,735 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2018-11-18 11:21:07,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 11:21:07,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-11-18 11:21:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:07,736 INFO L225 Difference]: With dead ends: 126 [2018-11-18 11:21:07,736 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 11:21:07,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2018-11-18 11:21:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 11:21:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2018-11-18 11:21:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 11:21:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2018-11-18 11:21:07,745 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 68 [2018-11-18 11:21:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:07,745 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2018-11-18 11:21:07,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 11:21:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2018-11-18 11:21:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 11:21:07,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:07,746 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:07,746 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:07,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2040961462, now seen corresponding path program 1 times [2018-11-18 11:21:07,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:07,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:21:07,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:07,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:07,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:07,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:07,954 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-18 11:21:07,955 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:07,956 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:07,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:08,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:08,000 INFO L272 AbstractInterpreter]: Visited 53 different actions 180 times. Merged at 21 different actions 53 times. Never widened. Performed 526 root evaluator evaluations with a maximum evaluation depth of 6. Performed 526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 10 fixpoints after 5 different actions. Largest state had 23 variables. [2018-11-18 11:21:08,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:08,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:08,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:08,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:08,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:08,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:08,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:08,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 11:21:08,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:08,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 20 [2018-11-18 11:21:08,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:08,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:21:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:21:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-18 11:21:08,547 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand 14 states. [2018-11-18 11:21:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:08,987 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-11-18 11:21:08,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 11:21:08,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-11-18 11:21:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:08,989 INFO L225 Difference]: With dead ends: 257 [2018-11-18 11:21:08,989 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 11:21:08,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 11:21:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 11:21:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 118. [2018-11-18 11:21:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-18 11:21:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2018-11-18 11:21:09,003 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 68 [2018-11-18 11:21:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:09,003 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2018-11-18 11:21:09,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:21:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2018-11-18 11:21:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:21:09,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:09,004 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:09,004 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:09,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1022658039, now seen corresponding path program 1 times [2018-11-18 11:21:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:09,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:09,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:09,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:09,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:09,073 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-18 11:21:09,073 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:09,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:09,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:09,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:09,119 INFO L272 AbstractInterpreter]: Visited 53 different actions 170 times. Merged at 21 different actions 49 times. Never widened. Performed 459 root evaluator evaluations with a maximum evaluation depth of 6. Performed 459 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-11-18 11:21:09,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:09,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:09,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:09,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:09,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:09,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:09,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 11:21:09,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:09,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:09,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-18 11:21:09,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:21:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:21:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:21:09,360 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand 6 states. [2018-11-18 11:21:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:09,477 INFO L93 Difference]: Finished difference Result 245 states and 312 transitions. [2018-11-18 11:21:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:21:09,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-18 11:21:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:09,480 INFO L225 Difference]: With dead ends: 245 [2018-11-18 11:21:09,480 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 11:21:09,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:21:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 11:21:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2018-11-18 11:21:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 11:21:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2018-11-18 11:21:09,493 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 70 [2018-11-18 11:21:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:09,493 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2018-11-18 11:21:09,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:21:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2018-11-18 11:21:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:21:09,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:09,494 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:09,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:09,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1285856917, now seen corresponding path program 1 times [2018-11-18 11:21:09,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:09,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 11:21:09,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:09,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:09,654 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-18 11:21:09,654 INFO L202 CegarAbsIntRunner]: [0], [1], [6], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [94], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:09,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:09,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:09,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:09,693 INFO L272 AbstractInterpreter]: Visited 53 different actions 177 times. Merged at 21 different actions 53 times. Never widened. Performed 485 root evaluator evaluations with a maximum evaluation depth of 6. Performed 485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:21:09,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:09,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:09,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:09,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:09,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:09,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 11:21:09,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 11:21:10,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 9] total 21 [2018-11-18 11:21:10,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:10,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 11:21:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 11:21:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:21:10,134 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 15 states. [2018-11-18 11:21:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:10,788 INFO L93 Difference]: Finished difference Result 270 states and 340 transitions. [2018-11-18 11:21:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 11:21:10,789 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-18 11:21:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:10,790 INFO L225 Difference]: With dead ends: 270 [2018-11-18 11:21:10,790 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 11:21:10,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 11:21:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 11:21:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2018-11-18 11:21:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 11:21:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-11-18 11:21:10,800 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 72 [2018-11-18 11:21:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:10,800 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-18 11:21:10,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 11:21:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-11-18 11:21:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 11:21:10,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:10,801 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:10,801 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:10,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1391251620, now seen corresponding path program 1 times [2018-11-18 11:21:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:10,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:21:10,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:10,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:10,838 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-18 11:21:10,838 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [65], [67], [70], [78], [82], [88], [92], [94], [98], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:10,839 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:10,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:10,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:10,892 INFO L272 AbstractInterpreter]: Visited 55 different actions 293 times. Merged at 22 different actions 107 times. Never widened. Performed 966 root evaluator evaluations with a maximum evaluation depth of 6. Performed 966 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 12 fixpoints after 4 different actions. Largest state had 23 variables. [2018-11-18 11:21:10,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:10,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:10,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:10,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:10,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:10,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 11:21:10,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:21:11,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:11,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-18 11:21:11,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:11,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:21:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:21:11,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:21:11,045 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 7 states. [2018-11-18 11:21:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:11,079 INFO L93 Difference]: Finished difference Result 225 states and 277 transitions. [2018-11-18 11:21:11,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:21:11,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-18 11:21:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:11,081 INFO L225 Difference]: With dead ends: 225 [2018-11-18 11:21:11,081 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 11:21:11,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-11-18 11:21:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 11:21:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2018-11-18 11:21:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 11:21:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2018-11-18 11:21:11,092 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 79 [2018-11-18 11:21:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2018-11-18 11:21:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:21:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2018-11-18 11:21:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 11:21:11,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:11,093 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:11,093 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:11,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1922179006, now seen corresponding path program 1 times [2018-11-18 11:21:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:11,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:21:11,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:11,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:11,194 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-18 11:21:11,194 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [12], [15], [41], [42], [43], [46], [48], [51], [55], [61], [67], [70], [72], [78], [82], [88], [92], [94], [98], [104], [106], [107], [111], [113], [115], [117], [119], [124], [129], [131], [134], [137], [142], [145], [149], [157], [160], [162], [168], [169], [170], [172], [173], [174], [175], [176], [177], [178], [179], [180], [181], [182] [2018-11-18 11:21:11,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:21:11,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:21:11,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:21:11,237 INFO L272 AbstractInterpreter]: Visited 55 different actions 255 times. Merged at 22 different actions 87 times. Never widened. Performed 797 root evaluator evaluations with a maximum evaluation depth of 6. Performed 797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 7 different actions. Largest state had 23 variables. [2018-11-18 11:21:11,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:11,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:21:11,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:11,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:11,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:11,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:21:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:11,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-18 11:21:11,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 11:21:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:11,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 15] total 29 [2018-11-18 11:21:11,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:11,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 11:21:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 11:21:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-11-18 11:21:11,772 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand 16 states. [2018-11-18 11:21:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:12,202 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2018-11-18 11:21:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 11:21:12,203 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-18 11:21:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:12,203 INFO L225 Difference]: With dead ends: 235 [2018-11-18 11:21:12,204 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 11:21:12,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 11:21:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 11:21:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 103. [2018-11-18 11:21:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 11:21:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-11-18 11:21:12,213 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 81 [2018-11-18 11:21:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:12,214 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-11-18 11:21:12,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 11:21:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-11-18 11:21:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 11:21:12,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:12,215 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:21:12,215 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:12,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash -819102221, now seen corresponding path program 2 times [2018-11-18 11:21:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:12,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:21:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:12,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:21:12,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:12,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:12,254 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:21:12,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:21:12,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:12,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:21:12,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:21:12,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 11:21:12,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:21:12,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 11:21:12,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 11:21:12,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2018-11-18 11:21:12,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:12,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 11:21:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:21:12,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-11-18 11:21:12,630 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 17 states. [2018-11-18 11:21:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:12,851 INFO L93 Difference]: Finished difference Result 223 states and 266 transitions. [2018-11-18 11:21:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:21:12,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2018-11-18 11:21:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:12,852 INFO L225 Difference]: With dead ends: 223 [2018-11-18 11:21:12,852 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 11:21:12,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-11-18 11:21:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 11:21:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 100. [2018-11-18 11:21:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-18 11:21:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-18 11:21:12,860 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 83 [2018-11-18 11:21:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:12,860 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-18 11:21:12,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 11:21:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-18 11:21:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 11:21:12,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:21:12,861 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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] [2018-11-18 11:21:12,862 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:21:12,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:21:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 954527067, now seen corresponding path program 2 times [2018-11-18 11:21:12,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:21:12,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:12,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:21:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:21:12,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:21:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:21:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 11:21:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:12,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:21:12,947 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 11:21:12,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 11:21:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:21:12,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:21:12,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 11:21:12,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 11:21:39,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 11:21:39,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 11:21:39,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:21:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 11:21:39,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:21:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-18 11:21:39,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:21:39,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 26 [2018-11-18 11:21:39,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:21:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 11:21:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 11:21:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-11-18 11:21:39,941 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 17 states. [2018-11-18 11:21:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:21:40,358 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2018-11-18 11:21:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 11:21:40,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-11-18 11:21:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:21:40,358 INFO L225 Difference]: With dead ends: 197 [2018-11-18 11:21:40,358 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:21:40,359 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 11:21:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:21:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:21:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:21:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:21:40,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-11-18 11:21:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:21:40,360 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:21:40,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 11:21:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:21:40,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:21:40,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:21:40,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:40,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:21:41,497 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2018-11-18 11:21:41,629 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 23 [2018-11-18 11:21:41,639 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:21:41,639 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:21:41,639 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 209) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 209) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L428 ceAbstractionStarter]: At program point mulfltENTRY(lines 137 209) the Hoare annotation is: true [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L421 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (let ((.cse0 (not (= |mulflt_#in~a| 0))) (.cse1 (= mulflt_~__retres10~1 0))) (and (or .cse0 .cse1) (or (and (= mulflt_~a 0) (= mulflt_~b 0)) .cse0 (not (= |mulflt_#in~b| 0))) (let ((.cse4 (mod |mulflt_#in~b| 4294967296))) (let ((.cse3 (not (= 0 .cse4))) (.cse2 (mod |mulflt_#in~a| 4294967296))) (or (and (<= (mod mulflt_~b 4294967296) .cse2) (= mulflt_~a |mulflt_#in~a|) .cse3 (<= .cse4 .cse2)) (and (= mulflt_~b |mulflt_#in~a|) .cse3 (not (= .cse2 0))) .cse1))))) [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-18 11:21:41,640 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= |base2flt_#in~m| 0)) (and (= base2flt_~m 0) (= base2flt_~__retres4~0 0) (= base2flt_~e 0)) (not (= |base2flt_#in~e| 0))) [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L421 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 (not (= |base2flt_#in~m| 1)) (and (= base2flt_~m |base2flt_#in~m|) (= base2flt_~e 0)) (= (mod base2flt_~m 2) 0) .cse0))) [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| 0)))) (and (or (not (= |base2flt_#in~m| 1)) .cse0 (and (= (mod base2flt_~m 2) 0) (not (= base2flt_~m 0)))) (or (not (= |base2flt_#in~m| 0)) .cse0))) [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-18 11:21:41,641 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (let ((.cse1 (* 4 |base2flt_#in~m|)) (.cse0 (+ (div base2flt_~m 4294967296) 1))) (and (or (<= 4194304 |base2flt_#in~m|) (<= (+ |base2flt_#in~m| 1) 0)) (<= |base2flt_#in~e| base2flt_~e) (or (<= .cse0 0) (<= base2flt_~m .cse1)) (or (<= .cse1 base2flt_~m) (< 0 .cse0)))) [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:21:41,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 210 266) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point L246-1(lines 246 262) no Hoare annotation was computed. [2018-11-18 11:21:41,642 INFO L425 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-11-18 11:21:41,643 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 210 266) no Hoare annotation was computed. [2018-11-18 11:21:41,643 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-11-18 11:21:41,643 INFO L425 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-11-18 11:21:41,643 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 11:21:41,643 INFO L425 ceAbstractionStarter]: For program point L230-1(line 230) no Hoare annotation was computed. [2018-11-18 11:21:41,643 INFO L428 ceAbstractionStarter]: At program point L228(line 228) the Hoare annotation is: true [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point L228-1(line 228) no Hoare annotation was computed. [2018-11-18 11:21:41,644 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 210 266) the Hoare annotation is: true [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-11-18 11:21:41,644 INFO L421 ceAbstractionStarter]: At program point L247-2(lines 247 256) the Hoare annotation is: (and (= main_~tmp___1~0 0) (= main_~zero~0 0) (= main_~tmp___0~0 0)) [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-11-18 11:21:41,644 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 11:21:41,644 INFO L421 ceAbstractionStarter]: At program point L233-2(lines 233 242) the Hoare annotation is: (let ((.cse0 (= main_~tmp~2 0)) (.cse1 (= main_~sa~0 0)) (.cse2 (= main_~zero~0 0))) (or (<= (+ main_~sa~0 1) 0) (and (<= (mod main_~a~0 4294967296) 0) .cse0 .cse1 (= 0 main_~zero~0)) (and (= 0 (mod main_~b~0 4294967296)) .cse0 .cse2 .cse1) (and (<= 1 main_~tmp~2) (<= 1 main_~sa~0) .cse2))) [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-18 11:21:41,644 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 0 main_~zero~0) [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point L229-1(line 229) no Hoare annotation was computed. [2018-11-18 11:21:41,644 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-18 11:21:41,644 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-18 11:21:41,645 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-18 11:21:41,645 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-18 11:21:41,645 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-18 11:21:41,645 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-18 11:21:41,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:21:41 BoogieIcfgContainer [2018-11-18 11:21:41,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:21:41,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:21:41,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:21:41,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:21:41,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:20:45" (3/4) ... [2018-11-18 11:21:41,670 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:21:41,676 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:21:41,676 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-18 11:21:41,676 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-18 11:21:41,677 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:21:41,678 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 11:21:41,682 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-18 11:21:41,682 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 11:21:41,683 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:21:41,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(m) == 0) || ((m == 0 && __retres4 == 0) && e == 0)) || !(\old(e) == 0) [2018-11-18 11:21:41,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((!(\old(m) == 1) || (m == \old(m) && e == 0)) || m % 2 == 0) || !(\old(e) == 0)) [2018-11-18 11:21:41,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) [2018-11-18 11:21:41,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(m) == 1) || !(\old(e) == 0)) || (m % 2 == 0 && !(m == 0))) && (!(\old(m) == 0) || !(\old(e) == 0)) [2018-11-18 11:21:41,701 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(a) == 0) || __retres10 == 0) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0))) && (((((b % 4294967296 <= \old(a) % 4294967296 && a == \old(a)) && !(0 == \old(b) % 4294967296)) && \old(b) % 4294967296 <= \old(a) % 4294967296) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) || __retres10 == 0) [2018-11-18 11:21:41,726 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40ea6289-294a-4fbc-a5a3-cae8970b6c91/bin-2019/utaipan/witness.graphml [2018-11-18 11:21:41,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:21:41,728 INFO L168 Benchmark]: Toolchain (without parser) took 56855.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.6 MB). Free memory was 962.4 MB in the beginning and 868.6 MB in the end (delta: 93.8 MB). Peak memory consumption was 386.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,728 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 983.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:21:41,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.17 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.04 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:21:41,729 INFO L168 Benchmark]: Boogie Preprocessor took 64.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,729 INFO L168 Benchmark]: RCFGBuilder took 323.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,729 INFO L168 Benchmark]: TraceAbstraction took 56182.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 877.7 MB in the end (delta: 226.4 MB). Peak memory consumption was 450.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,729 INFO L168 Benchmark]: Witness Printer took 61.80 ms. Allocated memory is still 1.3 GB. Free memory was 877.7 MB in the beginning and 868.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:21:41,731 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 983.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.17 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.04 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56182.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 877.7 MB in the end (delta: 226.4 MB). Peak memory consumption was 450.7 MB. Max. memory is 11.5 GB. * Witness Printer took 61.80 ms. Allocated memory is still 1.3 GB. Free memory was 877.7 MB in the beginning and 868.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((!(\old(m) == 1) || !(\old(e) == 0)) || (m % 2 == 0 && !(m == 0))) && (!(\old(m) == 0) || !(\old(e) == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (!(\old(m) == 0) || ((m == 0 && __retres4 == 0) && e == 0)) || !(\old(e) == 0) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((4194304 <= \old(m) || \old(m) + 1 <= 0) && \old(e) <= e) && (m / 4294967296 + 1 <= 0 || m <= 4 * \old(m))) && (4 * \old(m) <= m || 0 < m / 4294967296 + 1) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((!(\old(a) == 0) || __retres10 == 0) && (((a == 0 && b == 0) || !(\old(a) == 0)) || !(\old(b) == 0))) && (((((b % 4294967296 <= \old(a) % 4294967296 && a == \old(a)) && !(0 == \old(b) % 4294967296)) && \old(b) % 4294967296 <= \old(a) % 4294967296) || ((b == \old(a) && !(0 == \old(b) % 4294967296)) && !(\old(a) % 4294967296 == 0))) || __retres10 == 0) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((!(\old(m) == 0) || !(\old(e) == 0)) && !(m == 0)) && (((!(\old(m) == 1) || (m == \old(m) && e == 0)) || m % 2 == 0) || !(\old(e) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. SAFE Result, 56.1s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1243 SDtfs, 1406 SDslu, 10578 SDs, 0 SdLazy, 2843 SolverSat, 206 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 2238 GetRequests, 1696 SyntacticMatches, 18 SemanticMatches, 524 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3091 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 15 AbstIntIterations, 8 AbstIntStrong, 0.7439854554124944 AbsIntWeakeningRatio, 1.3240343347639485 AbsIntAvgWeakeningVarsNumRemoved, 1.1051502145922747 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 486 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 311 PreInvPairs, 891 NumberOfFragments, 265 HoareAnnotationTreeSize, 311 FomulaSimplifications, 322066378 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 18 FomulaSimplificationsInter, 25439 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 26.9s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2767 ConstructedInterpolants, 71 QuantifiedInterpolants, 507433 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1715 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 40 InterpolantComputations, 5 PerfectInterpolantSequences, 1252/1803 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...