./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/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 17db2a72807ac377d533a347dbb668103ea580a0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 07:08:45,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:08:45,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:08:45,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:08:45,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:08:45,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:08:45,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:08:45,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:08:45,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:08:45,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:08:45,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:08:45,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:08:45,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:08:45,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:08:45,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:08:45,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:08:45,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:08:45,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:08:45,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:08:45,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:08:45,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:08:45,863 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:08:45,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:08:45,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:08:45,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:08:45,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:08:45,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:08:45,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:08:45,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:08:45,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:08:45,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:08:45,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:08:45,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:08:45,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:08:45,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:08:45,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:08:45,868 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 07:08:45,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:08:45,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:08:45,876 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:08:45,876 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:08:45,876 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:08:45,877 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:08:45,877 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:08:45,877 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 07:08:45,877 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:08:45,877 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:08:45,877 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 07:08:45,878 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 07:08:45,878 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:08:45,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:08:45,878 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:08:45,879 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:08:45,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:08:45,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:08:45,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 07:08:45,881 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 07:08:45,881 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_b12f2290-38e2-4602-9ed9-4222daaff6a2/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 -> 17db2a72807ac377d533a347dbb668103ea580a0 [2018-12-09 07:08:45,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:08:45,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:08:45,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:08:45,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:08:45,913 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:08:45,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c [2018-12-09 07:08:45,947 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/data/d00bef27d/2820066191db45eba1dc710febd16482/FLAG088adc5e4 [2018-12-09 07:08:46,311 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:08:46,311 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/sv-benchmarks/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c [2018-12-09 07:08:46,315 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/data/d00bef27d/2820066191db45eba1dc710febd16482/FLAG088adc5e4 [2018-12-09 07:08:46,322 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/data/d00bef27d/2820066191db45eba1dc710febd16482 [2018-12-09 07:08:46,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:08:46,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:08:46,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:08:46,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:08:46,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:08:46,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73973e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46, skipping insertion in model container [2018-12-09 07:08:46,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:08:46,341 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:08:46,420 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:08:46,423 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:08:46,431 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:08:46,438 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:08:46,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46 WrapperNode [2018-12-09 07:08:46,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:08:46,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:08:46,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:08:46,439 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:08:46,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:08:46,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:08:46,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:08:46,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:08:46,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... [2018-12-09 07:08:46,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:08:46,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:08:46,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:08:46,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:08:46,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 07:08:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 07:08:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:08:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:08:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-09 07:08:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-09 07:08:46,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 07:08:46,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 07:08:46,608 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:08:46,609 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 07:08:46,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46 BoogieIcfgContainer [2018-12-09 07:08:46,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:08:46,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 07:08:46,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 07:08:46,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 07:08:46,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:08:46" (1/3) ... [2018-12-09 07:08:46,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4515e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:46, skipping insertion in model container [2018-12-09 07:08:46,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:08:46" (2/3) ... [2018-12-09 07:08:46,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4515e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:08:46, skipping insertion in model container [2018-12-09 07:08:46,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46" (3/3) ... [2018-12-09 07:08:46,614 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0_false-unreach-call_true-termination.c [2018-12-09 07:08:46,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 07:08:46,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 07:08:46,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 07:08:46,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 07:08:46,651 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 07:08:46,651 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 07:08:46,651 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:08:46,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:08:46,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 07:08:46,651 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:08:46,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 07:08:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-09 07:08:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 07:08:46,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:46,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:46,667 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:46,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-12-09 07:08:46,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:46,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:46,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:46,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:08:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:08:46,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:08:46,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:08:46,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:08:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:08:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:08:46,777 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-09 07:08:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:46,820 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-09 07:08:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:08:46,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 07:08:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:46,826 INFO L225 Difference]: With dead ends: 30 [2018-12-09 07:08:46,827 INFO L226 Difference]: Without dead ends: 18 [2018-12-09 07:08:46,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:08:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-09 07:08:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 07:08:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 07:08:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-09 07:08:46,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-09 07:08:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:46,852 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-09 07:08:46,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:08:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-09 07:08:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 07:08:46,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:46,853 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:46,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:46,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-12-09 07:08:46,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:46,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:46,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:46,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 07:08:46,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:46,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:46,900 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 07:08:46,901 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2018-12-09 07:08:46,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 07:08:46,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 07:08:47,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 07:08:47,015 INFO L272 AbstractInterpreter]: Visited 17 different actions 50 times. Never merged. Widened at 1 different actions 2 times. Performed 130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-09 07:08:47,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:47,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 07:08:47,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:47,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:47,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:08:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:47,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 07:08:47,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 07:08:47,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:47,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2018-12-09 07:08:47,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:47,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:08:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:08:47,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:08:47,195 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-12-09 07:08:47,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:47,232 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-09 07:08:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:08:47,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 07:08:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:47,233 INFO L225 Difference]: With dead ends: 25 [2018-12-09 07:08:47,233 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 07:08:47,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:08:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 07:08:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 07:08:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 07:08:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 07:08:47,237 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-09 07:08:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:47,237 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 07:08:47,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:08:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 07:08:47,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 07:08:47,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:47,238 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:47,238 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:47,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-12-09 07:08:47,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 07:08:47,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:47,275 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:47,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:47,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:47,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:08:47,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:08:47,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 07:08:47,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:47,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 07:08:47,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 07:08:47,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-12-09 07:08:47,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:47,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:08:47,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:08:47,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:08:47,494 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-12-09 07:08:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:47,538 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-09 07:08:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:08:47,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 07:08:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:47,539 INFO L225 Difference]: With dead ends: 28 [2018-12-09 07:08:47,539 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 07:08:47,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-09 07:08:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 07:08:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 07:08:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 07:08:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-09 07:08:47,542 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-12-09 07:08:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:47,542 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-09 07:08:47,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:08:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-09 07:08:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 07:08:47,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:47,543 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:47,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:47,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-12-09 07:08:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 07:08:47,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:47,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:47,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:47,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:47,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:08:47,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:08:47,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:08:47,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:47,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 07:08:47,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 07:08:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2018-12-09 07:08:47,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:47,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 07:08:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 07:08:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-09 07:08:47,888 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-12-09 07:08:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:47,930 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-09 07:08:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:08:47,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-09 07:08:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:47,931 INFO L225 Difference]: With dead ends: 31 [2018-12-09 07:08:47,931 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 07:08:47,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-09 07:08:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 07:08:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 07:08:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 07:08:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 07:08:47,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-12-09 07:08:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:47,934 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 07:08:47,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 07:08:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 07:08:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 07:08:47,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:47,935 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:47,935 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:47,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-12-09 07:08:47,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:47,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 07:08:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:47,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:47,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:47,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:47,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:47,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:08:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:48,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 07:08:48,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 07:08:48,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:48,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-12-09 07:08:48,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:48,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 07:08:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 07:08:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-09 07:08:48,390 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-12-09 07:08:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:48,435 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-09 07:08:48,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:08:48,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-09 07:08:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:48,436 INFO L225 Difference]: With dead ends: 34 [2018-12-09 07:08:48,436 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 07:08:48,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-12-09 07:08:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 07:08:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 07:08:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 07:08:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 07:08:48,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-12-09 07:08:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:48,439 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 07:08:48,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 07:08:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 07:08:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 07:08:48,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:48,440 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:48,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:48,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:48,440 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-12-09 07:08:48,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:48,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:48,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 07:08:48,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:48,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:48,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:48,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:48,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:48,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:08:48,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:08:48,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 07:08:48,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:48,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 07:08:48,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 07:08:49,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:49,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2018-12-09 07:08:49,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:49,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 07:08:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 07:08:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-12-09 07:08:49,110 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-12-09 07:08:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:49,158 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-09 07:08:49,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 07:08:49,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 07:08:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:49,159 INFO L225 Difference]: With dead ends: 37 [2018-12-09 07:08:49,159 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 07:08:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2018-12-09 07:08:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 07:08:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 07:08:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 07:08:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-09 07:08:49,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-12-09 07:08:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:49,163 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-09 07:08:49,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 07:08:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-09 07:08:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 07:08:49,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:49,164 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:49,164 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:49,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-12-09 07:08:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:49,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:49,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 07:08:49,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:49,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:49,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:49,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:49,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:49,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:49,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:08:49,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:08:49,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:08:49,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:49,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 07:08:49,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 07:08:50,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:50,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2018-12-09 07:08:50,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:50,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 07:08:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 07:08:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-09 07:08:50,034 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-12-09 07:08:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:50,105 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-09 07:08:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 07:08:50,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-09 07:08:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:50,106 INFO L225 Difference]: With dead ends: 40 [2018-12-09 07:08:50,106 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 07:08:50,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2018-12-09 07:08:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 07:08:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 07:08:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 07:08:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 07:08:50,111 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-12-09 07:08:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:50,111 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 07:08:50,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 07:08:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 07:08:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 07:08:50,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:50,112 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:50,112 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:50,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-12-09 07:08:50,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:50,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:50,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:50,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 07:08:50,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:50,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:50,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:50,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:50,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:50,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:50,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:50,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:08:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:50,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 07:08:50,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 07:08:51,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:51,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2018-12-09 07:08:51,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:51,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 07:08:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 07:08:51,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-12-09 07:08:51,276 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-12-09 07:08:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:51,375 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-09 07:08:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:08:51,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-09 07:08:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:51,376 INFO L225 Difference]: With dead ends: 43 [2018-12-09 07:08:51,376 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 07:08:51,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-12-09 07:08:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 07:08:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 07:08:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 07:08:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-09 07:08:51,380 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-12-09 07:08:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:51,380 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-09 07:08:51,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 07:08:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-09 07:08:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 07:08:51,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:51,381 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:51,381 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:51,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-12-09 07:08:51,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:51,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:51,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 07:08:51,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:51,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:51,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:51,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:51,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:51,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:51,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:08:51,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:08:51,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 07:08:51,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:51,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 07:08:51,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 07:08:52,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:52,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2018-12-09 07:08:52,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:52,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 07:08:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 07:08:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 07:08:52,980 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-12-09 07:08:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:53,063 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-09 07:08:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 07:08:53,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-12-09 07:08:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:53,064 INFO L225 Difference]: With dead ends: 46 [2018-12-09 07:08:53,064 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 07:08:53,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2018-12-09 07:08:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 07:08:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 07:08:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 07:08:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 07:08:53,067 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-12-09 07:08:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:53,067 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 07:08:53,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 07:08:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-09 07:08:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 07:08:53,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:53,068 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:53,068 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:53,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-12-09 07:08:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:53,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:53,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 07:08:53,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:53,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:53,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:53,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:53,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:53,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:08:53,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:08:53,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:08:53,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:53,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 07:08:53,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 07:08:55,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:55,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2018-12-09 07:08:55,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:55,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 07:08:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 07:08:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-12-09 07:08:55,150 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-12-09 07:08:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:55,233 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-09 07:08:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 07:08:55,234 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-12-09 07:08:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:55,234 INFO L225 Difference]: With dead ends: 49 [2018-12-09 07:08:55,234 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 07:08:55,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 07:08:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 07:08:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 07:08:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 07:08:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-09 07:08:55,238 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-12-09 07:08:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:55,238 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-09 07:08:55,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 07:08:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-09 07:08:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 07:08:55,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:55,239 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:55,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:55,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-12-09 07:08:55,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:55,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:08:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:55,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-09 07:08:55,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:55,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:55,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:55,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:55,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:55,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:55,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:08:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:55,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-09 07:08:55,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:08:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-09 07:08:57,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:08:57,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2018-12-09 07:08:57,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:08:57,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 07:08:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 07:08:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-12-09 07:08:57,988 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-12-09 07:08:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:08:58,088 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-12-09 07:08:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 07:08:58,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-12-09 07:08:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:08:58,089 INFO L225 Difference]: With dead ends: 52 [2018-12-09 07:08:58,089 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 07:08:58,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 07:08:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 07:08:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 07:08:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 07:08:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-09 07:08:58,092 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-12-09 07:08:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:08:58,093 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-09 07:08:58,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 07:08:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-09 07:08:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 07:08:58,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:08:58,094 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:08:58,094 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:08:58,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:08:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2018-12-09 07:08:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:08:58,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:58,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:08:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:08:58,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:08:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:08:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-09 07:08:58,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:58,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:08:58,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:08:58,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:08:58,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:08:58,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:08:58,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:08:58,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:08:58,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-09 07:08:58,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:08:58,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:08:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-09 07:08:58,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 07:09:01,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:01,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2018-12-09 07:09:01,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:01,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 07:09:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 07:09:01,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-12-09 07:09:01,555 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-12-09 07:09:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:01,669 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-09 07:09:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 07:09:01,669 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-12-09 07:09:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:01,670 INFO L225 Difference]: With dead ends: 55 [2018-12-09 07:09:01,670 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 07:09:01,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 07:09:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 07:09:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-09 07:09:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 07:09:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-09 07:09:01,673 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-12-09 07:09:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:01,674 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-09 07:09:01,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 07:09:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-09 07:09:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:09:01,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:01,675 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:01,675 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2018-12-09 07:09:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:01,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:09:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:01,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-09 07:09:01,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:01,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:01,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:01,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:01,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:01,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:09:01,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:09:01,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:09:01,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:09:01,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-09 07:09:01,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 07:09:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:06,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2018-12-09 07:09:06,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:06,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 07:09:06,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 07:09:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2018-12-09 07:09:06,092 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2018-12-09 07:09:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:06,221 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-09 07:09:06,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 07:09:06,222 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-12-09 07:09:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:06,222 INFO L225 Difference]: With dead ends: 58 [2018-12-09 07:09:06,222 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 07:09:06,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 07:09:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 07:09:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-09 07:09:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 07:09:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-09 07:09:06,227 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-12-09 07:09:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:06,227 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-09 07:09:06,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 07:09:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-09 07:09:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 07:09:06,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:06,228 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:06,228 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:06,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2018-12-09 07:09:06,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:06,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:06,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:09:06,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:06,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-09 07:09:06,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:06,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:06,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:06,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:06,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:06,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:09:06,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:09:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:06,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-09 07:09:06,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 07:09:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:11,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2018-12-09 07:09:11,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 07:09:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 07:09:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 07:09:11,887 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2018-12-09 07:09:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:12,012 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-09 07:09:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 07:09:12,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-12-09 07:09:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:12,013 INFO L225 Difference]: With dead ends: 61 [2018-12-09 07:09:12,013 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 07:09:12,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 07:09:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 07:09:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 07:09:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 07:09:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-09 07:09:12,016 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-12-09 07:09:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:12,017 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-09 07:09:12,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 07:09:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-09 07:09:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:09:12,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:12,017 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:12,017 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:12,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2018-12-09 07:09:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:12,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:09:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:12,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-09 07:09:12,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:12,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:12,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:12,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:12,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:12,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:12,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:09:12,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:09:12,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-09 07:09:12,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:09:12,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-09 07:09:12,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-09 07:09:18,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:18,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2018-12-09 07:09:18,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:18,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 07:09:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 07:09:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 07:09:18,633 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-12-09 07:09:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:18,776 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-12-09 07:09:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 07:09:18,776 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-12-09 07:09:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:18,777 INFO L225 Difference]: With dead ends: 64 [2018-12-09 07:09:18,777 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 07:09:18,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 30 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 07:09:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 07:09:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 07:09:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 07:09:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-09 07:09:18,780 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-12-09 07:09:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:18,781 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-09 07:09:18,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 07:09:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-09 07:09:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 07:09:18,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:18,782 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:18,782 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:18,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2018-12-09 07:09:18,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:18,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:09:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:18,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-09 07:09:18,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:18,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:18,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:18,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:18,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:18,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:18,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:09:18,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:09:18,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:09:18,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:09:18,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-09 07:09:18,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 07:09:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2018-12-09 07:09:27,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:27,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 07:09:27,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 07:09:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 07:09:27,259 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-12-09 07:09:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:27,420 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-09 07:09:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 07:09:27,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-12-09 07:09:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:27,421 INFO L225 Difference]: With dead ends: 67 [2018-12-09 07:09:27,421 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 07:09:27,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 32 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 07:09:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 07:09:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 07:09:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 07:09:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-09 07:09:27,424 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-12-09 07:09:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:27,424 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-09 07:09:27,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 07:09:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-09 07:09:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 07:09:27,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:27,425 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:27,425 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:27,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:27,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2018-12-09 07:09:27,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:27,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:27,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:09:27,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:27,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-09 07:09:27,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:27,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:27,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:27,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:27,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:27,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:09:27,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:09:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:27,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-09 07:09:27,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 07:09:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2018-12-09 07:09:38,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:38,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 07:09:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 07:09:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 07:09:38,935 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2018-12-09 07:09:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:39,102 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-12-09 07:09:39,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 07:09:39,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-12-09 07:09:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:39,103 INFO L225 Difference]: With dead ends: 70 [2018-12-09 07:09:39,103 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 07:09:39,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2018-12-09 07:09:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 07:09:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 07:09:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 07:09:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-09 07:09:39,106 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-12-09 07:09:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:39,106 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-09 07:09:39,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 07:09:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-09 07:09:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 07:09:39,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:39,107 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:39,107 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:39,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2018-12-09 07:09:39,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:39,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:09:39,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:39,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-09 07:09:39,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:39,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:39,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:39,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:39,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:39,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:39,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 07:09:39,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 07:09:39,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-09 07:09:39,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:09:39,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-09 07:09:39,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:09:41,326 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 07:09:41,428 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 07:09:41,535 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 07:09:41,643 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 07:09:41,751 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 07:09:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-09 07:09:52,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:09:52,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2018-12-09 07:09:52,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:09:52,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 07:09:52,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 07:09:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 07:09:52,464 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2018-12-09 07:09:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:09:52,624 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-09 07:09:52,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 07:09:52,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2018-12-09 07:09:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:09:52,625 INFO L225 Difference]: With dead ends: 73 [2018-12-09 07:09:52,625 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 07:09:52,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 193 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2018-12-09 07:09:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 07:09:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-09 07:09:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 07:09:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-09 07:09:52,629 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-12-09 07:09:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:09:52,629 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-09 07:09:52,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 07:09:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-09 07:09:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 07:09:52,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:09:52,630 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:09:52,630 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:09:52,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:09:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2018-12-09 07:09:52,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:09:52,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:52,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:09:52,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:09:52,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:09:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:09:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-09 07:09:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:52,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:09:52,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:09:52,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:09:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:09:52,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:09:52,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:09:52,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 07:09:52,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:09:52,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:09:52,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:09:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-09 07:09:52,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:10:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-09 07:10:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:10:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2018-12-09 07:10:07,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:10:07,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 07:10:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 07:10:07,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 07:10:07,553 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2018-12-09 07:10:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:10:07,748 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-09 07:10:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 07:10:07,748 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2018-12-09 07:10:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:10:07,749 INFO L225 Difference]: With dead ends: 76 [2018-12-09 07:10:07,749 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 07:10:07,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 07:10:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 07:10:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-09 07:10:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 07:10:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-09 07:10:07,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-12-09 07:10:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:10:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-09 07:10:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 07:10:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-09 07:10:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 07:10:07,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:10:07,754 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:10:07,754 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:10:07,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:10:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2018-12-09 07:10:07,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:10:07,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:10:07,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:10:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:10:07,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:10:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:10:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-09 07:10:07,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:10:07,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:10:07,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 07:10:07,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 07:10:07,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:10:07,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:10:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:10:07,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:10:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:10:07,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:10:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-09 07:10:07,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:10:16,321 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 07:10:16,431 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 07:10:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 07:10:25,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:10:25,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 44 [2018-12-09 07:10:25,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:10:25,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 07:10:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 07:10:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 07:10:25,991 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2018-12-09 07:10:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:10:26,204 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-09 07:10:26,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 07:10:26,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-12-09 07:10:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:10:26,205 INFO L225 Difference]: With dead ends: 79 [2018-12-09 07:10:26,205 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 07:10:26,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 213 SyntacticMatches, 41 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1365, Invalid=2667, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 07:10:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 07:10:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 07:10:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 07:10:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-09 07:10:26,210 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-12-09 07:10:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:10:26,210 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-09 07:10:26,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 07:10:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-09 07:10:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 07:10:26,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:10:26,211 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:10:26,211 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:10:26,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:10:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2018-12-09 07:10:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:10:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:10:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:10:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:10:26,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:10:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:10:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:10:26,245 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 07:10:26,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:10:26 BoogieIcfgContainer [2018-12-09 07:10:26,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 07:10:26,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:10:26,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:10:26,272 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:10:26,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:08:46" (3/4) ... [2018-12-09 07:10:26,274 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 07:10:26,306 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b12f2290-38e2-4602-9ed9-4222daaff6a2/bin-2019/utaipan/witness.graphml [2018-12-09 07:10:26,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:10:26,306 INFO L168 Benchmark]: Toolchain (without parser) took 99982.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 949.7 MB in the beginning and 819.0 MB in the end (delta: 130.7 MB). Peak memory consumption was 451.0 MB. Max. memory is 11.5 GB. [2018-12-09 07:10:26,307 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:10:26,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 113.55 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 941.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 07:10:26,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.40 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:10:26,307 INFO L168 Benchmark]: Boogie Preprocessor took 10.31 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:10:26,307 INFO L168 Benchmark]: RCFGBuilder took 148.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:10:26,308 INFO L168 Benchmark]: TraceAbstraction took 99662.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 819.0 MB in the end (delta: 289.5 MB). Peak memory consumption was 487.6 MB. Max. memory is 11.5 GB. [2018-12-09 07:10:26,308 INFO L168 Benchmark]: Witness Printer took 34.16 ms. Allocated memory is still 1.3 GB. Free memory is still 819.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:10:26,309 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 113.55 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 941.6 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.40 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.31 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 148.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99662.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 819.0 MB in the end (delta: 289.5 MB). Peak memory consumption was 487.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.16 ms. Allocated memory is still 1.3 GB. Free memory is still 819.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; VAL [a=20, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=20, b=0, sum(a, b)=20] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=20, b=0, result=20] [L16] __VERIFIER_error() VAL [a=20, b=0, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 99.6s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 523 SDslu, 1820 SDs, 0 SdLazy, 1409 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3445 GetRequests, 2339 SyntacticMatches, 419 SemanticMatches, 687 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8339 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 96.1s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 4116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045392 SizeOfPredicates, 228 NumberOfNonLiveVariables, 4123 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 8930/22800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...