./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i --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_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 9eff01e8b41fd58fd007a4a54a96fca4ce69974c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:17:05,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:17:05,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:17:05,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:17:05,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:17:05,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:17:05,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:17:05,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:17:05,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:17:05,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:17:05,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:17:05,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:17:05,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:17:05,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:17:05,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:17:05,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:17:05,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:17:05,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:17:05,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:17:05,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:17:05,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:17:05,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:17:05,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:17:05,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:17:05,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:17:05,742 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:17:05,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:17:05,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:17:05,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:17:05,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:17:05,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:17:05,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:17:05,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:17:05,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:17:05,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:17:05,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:17:05,747 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:17:05,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:17:05,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:17:05,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:17:05,755 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:17:05,755 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:17:05,756 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:17:05,756 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:17:05,757 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:17:05,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:17:05,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:17:05,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:17:05,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:17:05,758 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:17:05,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:17:05,759 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:17:05,759 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:17:05,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:17:05,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:17:05,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:17:05,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:17:05,760 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:17:05,760 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_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-11-18 15:17:05,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:17:05,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:17:05,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:17:05,797 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:17:05,797 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:17:05,798 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-18 15:17:05,837 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/data/da457b76e/dca74dfa255a45428c0d8e90cdf497bf/FLAGc7412113e [2018-11-18 15:17:06,236 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:17:06,236 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-11-18 15:17:06,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/data/da457b76e/dca74dfa255a45428c0d8e90cdf497bf/FLAGc7412113e [2018-11-18 15:17:06,251 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/data/da457b76e/dca74dfa255a45428c0d8e90cdf497bf [2018-11-18 15:17:06,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:17:06,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:17:06,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:17:06,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:17:06,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:17:06,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06, skipping insertion in model container [2018-11-18 15:17:06,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:17:06,278 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:17:06,391 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:17:06,393 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:17:06,406 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:17:06,419 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:17:06,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06 WrapperNode [2018-11-18 15:17:06,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:17:06,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:17:06,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:17:06,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:17:06,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:17:06,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:17:06,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:17:06,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:17:06,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... [2018-11-18 15:17:06,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:17:06,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:17:06,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:17:06,491 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:17:06,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 15:17:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:17:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:17:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:17:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:17:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:17:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:17:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:17:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:17:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:17:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 15:17:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 15:17:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:17:06,660 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:17:06,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:17:06 BoogieIcfgContainer [2018-11-18 15:17:06,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:17:06,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:17:06,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:17:06,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:17:06,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:17:06" (1/3) ... [2018-11-18 15:17:06,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800d0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:17:06, skipping insertion in model container [2018-11-18 15:17:06,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:17:06" (2/3) ... [2018-11-18 15:17:06,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800d0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:17:06, skipping insertion in model container [2018-11-18 15:17:06,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:17:06" (3/3) ... [2018-11-18 15:17:06,667 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-18 15:17:06,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:17:06,680 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:17:06,692 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:17:06,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:17:06,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:17:06,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:17:06,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:17:06,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:17:06,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:17:06,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:17:06,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:17:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 15:17:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 15:17:06,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:06,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:06,730 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:06,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-18 15:17:06,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:06,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:06,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:06,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:06,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:06,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:17:06,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:17:06,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:17:06,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:17:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:17:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:17:06,835 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 15:17:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:06,849 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-18 15:17:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:17:06,849 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 15:17:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:06,854 INFO L225 Difference]: With dead ends: 51 [2018-11-18 15:17:06,854 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 15:17:06,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:17:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 15:17:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 15:17:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 15:17:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-18 15:17:06,879 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-18 15:17:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:06,879 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-18 15:17:06,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:17:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-18 15:17:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 15:17:06,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:06,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:06,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:06,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-18 15:17:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:06,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:06,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:06,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:17:06,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:17:06,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:17:06,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:17:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:17:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:17:06,976 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-11-18 15:17:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:07,032 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-18 15:17:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:17:07,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 15:17:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:07,034 INFO L225 Difference]: With dead ends: 42 [2018-11-18 15:17:07,034 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 15:17:07,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:17:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 15:17:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-18 15:17:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 15:17:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-18 15:17:07,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-18 15:17:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:07,039 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-18 15:17:07,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:17:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 15:17:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 15:17:07,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:07,039 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:07,039 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:07,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-11-18 15:17:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:07,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:17:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:17:07,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:17:07,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:17:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:17:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:17:07,107 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-11-18 15:17:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:07,180 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-18 15:17:07,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:17:07,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-18 15:17:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:07,182 INFO L225 Difference]: With dead ends: 53 [2018-11-18 15:17:07,182 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 15:17:07,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:17:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 15:17:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-18 15:17:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:17:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 15:17:07,190 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-11-18 15:17:07,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:07,190 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 15:17:07,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:17:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 15:17:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 15:17:07,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:07,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:07,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:07,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:07,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-11-18 15:17:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:07,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:07,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:17:07,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:07,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:17:07,493 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-18 15:17:07,494 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-11-18 15:17:07,516 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:17:07,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:17:07,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:17:07,711 INFO L272 AbstractInterpreter]: Visited 22 different actions 51 times. Merged at 8 different actions 23 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 4 different actions. Largest state had 26 variables. [2018-11-18 15:17:07,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:07,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:17:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:07,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 15:17:07,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:07,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:17:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:07,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:17:07,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 15:17:07,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-18 15:17:07,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-18 15:17:07,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 15:17:07,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-18 15:17:07,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 15:17:07,980 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:17:07,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 15:17:07,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 15:17:07,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:07,999 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:3 [2018-11-18 15:17:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:08,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:17:08,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-11-18 15:17:08,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 15:17:08,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:08,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-18 15:17:08,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:08,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:17:08,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:17:08,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-18 15:17:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:08,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:17:08,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 27 [2018-11-18 15:17:08,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:17:08,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 15:17:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 15:17:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-11-18 15:17:08,345 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 18 states. [2018-11-18 15:17:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:08,710 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2018-11-18 15:17:08,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 15:17:08,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-18 15:17:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:08,711 INFO L225 Difference]: With dead ends: 70 [2018-11-18 15:17:08,711 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 15:17:08,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 15:17:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 15:17:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-11-18 15:17:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 15:17:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-18 15:17:08,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 24 [2018-11-18 15:17:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:08,723 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-18 15:17:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 15:17:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 15:17:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 15:17:08,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:08,724 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:08,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:08,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 2 times [2018-11-18 15:17:08,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:08,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:09,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:09,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:17:09,001 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:17:09,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:17:09,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:09,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 15:17:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:17:09,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:17:09,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 15:17:09,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:17:09,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:17:09,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 15:17:09,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 15:17:09,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-18 15:17:09,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 15:17:09,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-18 15:17:09,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-18 15:17:09,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:09,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-18 15:17:09,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-18 15:17:09,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-18 15:17:09,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:17:09,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-18 15:17:09,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 15:17:09,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2018-11-18 15:17:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:17:09,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:17:09,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 15:17:09,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-18 15:17:09,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 15:17:09,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-18 15:17:09,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-18 15:17:09,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:09,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:17:09,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:17:09,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:92, output treesize:50 [2018-11-18 15:17:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:17:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:17:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 32 [2018-11-18 15:17:09,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:17:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 15:17:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 15:17:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-11-18 15:17:09,549 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 23 states. [2018-11-18 15:17:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:10,039 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-11-18 15:17:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 15:17:10,039 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-11-18 15:17:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:10,041 INFO L225 Difference]: With dead ends: 115 [2018-11-18 15:17:10,041 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 15:17:10,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1502, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 15:17:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 15:17:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 52. [2018-11-18 15:17:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 15:17:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-18 15:17:10,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 30 [2018-11-18 15:17:10,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:10,048 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-18 15:17:10,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 15:17:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 15:17:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 15:17:10,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:10,049 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:17:10,049 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:10,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1011030201, now seen corresponding path program 1 times [2018-11-18 15:17:10,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:10,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:10,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:17:10,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:10,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:17:10,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:10,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:17:10,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-18 15:17:10,119 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-11-18 15:17:10,120 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:17:10,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:17:10,218 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:17:10,218 INFO L272 AbstractInterpreter]: Visited 27 different actions 100 times. Merged at 13 different actions 43 times. Never widened. Performed 458 root evaluator evaluations with a maximum evaluation depth of 4. Performed 458 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 5 different actions. Largest state had 28 variables. [2018-11-18 15:17:10,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:10,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:17:10,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:10,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 15:17:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:10,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:17:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:10,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:17:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:17:10,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:17:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:17:10,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:17:10,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-18 15:17:10,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:17:10,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:17:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:17:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:17:10,339 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 11 states. [2018-11-18 15:17:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:10,409 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-18 15:17:10,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:17:10,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-18 15:17:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:10,410 INFO L225 Difference]: With dead ends: 82 [2018-11-18 15:17:10,410 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 15:17:10,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:17:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 15:17:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-11-18 15:17:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 15:17:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-18 15:17:10,416 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 33 [2018-11-18 15:17:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:10,416 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-18 15:17:10,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:17:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-18 15:17:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 15:17:10,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:10,417 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:10,417 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:10,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 3 times [2018-11-18 15:17:10,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:10,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:17:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:10,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:17:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:17:10,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:10,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:17:10,464 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:17:10,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:17:10,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:17:10,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/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 15:17:10,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 15:17:10,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-18 15:17:10,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 15:17:10,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:17:10,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:17:10,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2018-11-18 15:17:10,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-18 15:17:10,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 15:17:10,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2018-11-18 15:17:10,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:10,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-18 15:17:10,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-18 15:17:10,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2018-11-18 15:17:10,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-18 15:17:10,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,701 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:10,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:10,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:17:10,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 15:17:10,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:10,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:17:10,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:17:10,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-18 15:17:10,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2018-11-18 15:17:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:17:10,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:17:10,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2018-11-18 15:17:10,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-18 15:17:10,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 15:17:10,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-18 15:17:10,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-18 15:17:10,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:17:10,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:17:10,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:17:10,970 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2018-11-18 15:17:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:17:11,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:17:11,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 31 [2018-11-18 15:17:11,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:17:11,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 15:17:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 15:17:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-11-18 15:17:11,060 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 20 states. [2018-11-18 15:17:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:17:11,526 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-11-18 15:17:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 15:17:11,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-18 15:17:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:17:11,527 INFO L225 Difference]: With dead ends: 124 [2018-11-18 15:17:11,527 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 15:17:11,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 15:17:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 15:17:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 61. [2018-11-18 15:17:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 15:17:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-11-18 15:17:11,537 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 33 [2018-11-18 15:17:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:17:11,537 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-11-18 15:17:11,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 15:17:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-11-18 15:17:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 15:17:11,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:17:11,538 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:17:11,538 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:17:11,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:17:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash -669879850, now seen corresponding path program 2 times [2018-11-18 15:17:11,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:17:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:11,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:17:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:17:11,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:17:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:17:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:17:11,585 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 15:17:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:17:11 BoogieIcfgContainer [2018-11-18 15:17:11,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:17:11,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:17:11,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:17:11,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:17:11,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:17:06" (3/4) ... [2018-11-18 15:17:11,619 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 15:17:11,659 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2c9f82dd-4797-459c-8bd4-33ef5155ae58/bin-2019/utaipan/witness.graphml [2018-11-18 15:17:11,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:17:11,660 INFO L168 Benchmark]: Toolchain (without parser) took 5406.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 960.3 MB in the beginning and 916.3 MB in the end (delta: 44.1 MB). Peak memory consumption was 226.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,661 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:17:11,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,662 INFO L168 Benchmark]: Boogie Preprocessor took 55.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,662 INFO L168 Benchmark]: RCFGBuilder took 169.51 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,664 INFO L168 Benchmark]: TraceAbstraction took 4953.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 200.0 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:17:11,665 INFO L168 Benchmark]: Witness Printer took 44.54 ms. Allocated memory is still 1.2 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:17:11,666 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.36 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 169.51 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4953.20 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 916.3 MB in the end (delta: 200.0 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. * Witness Printer took 44.54 ms. Allocated memory is still 1.2 GB. Free memory is still 916.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] FCALL char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={5:0}] [L18] COND TRUE i= 0 [L26] EXPR, FCALL str1[0] [L26] FCALL str2[j] = str1[0] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L25] COND TRUE i >= 0 [L26] EXPR, FCALL str1[0] [L26] FCALL str2[j] = str1[0] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={5:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={5:0}] [L31] COND TRUE i