./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/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 e655d34f6b59f7cc9a55d4dc4dc525a41685abad .................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:56:48,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:56:48,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:56:48,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:56:48,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:56:48,827 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:56:48,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:56:48,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:56:48,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:56:48,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:56:48,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:56:48,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:56:48,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:56:48,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:56:48,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:56:48,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:56:48,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:56:48,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:56:48,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:56:48,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:56:48,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:56:48,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:56:48,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:56:48,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:56:48,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:56:48,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:56:48,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:56:48,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:56:48,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:56:48,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:56:48,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:56:48,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:56:48,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:56:48,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:56:48,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:56:48,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:56:48,852 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:56:48,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:56:48,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:56:48,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:56:48,866 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:56:48,866 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:56:48,866 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:56:48,866 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:56:48,866 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:56:48,866 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:56:48,867 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:56:48,867 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:56:48,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:56:48,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:56:48,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:56:48,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:56:48,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:56:48,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:56:48,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:56:48,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:56:48,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:56:48,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:56:48,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:56:48,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:56:48,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:56:48,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:56:48,871 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:56:48,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:56:48,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:56:48,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:56:48,871 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_09b08dcc-e6ee-4226-a919-6a244b2f8461/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 -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad [2018-11-10 10:56:48,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:56:48,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:56:48,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:56:48,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:56:48,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:56:48,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/../../sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-11-10 10:56:48,961 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/data/4b05655a3/cb57227c691a4bb2b8c4eca728f2bc32/FLAGe5dabfe36 [2018-11-10 10:56:49,305 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:56:49,305 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/sv-benchmarks/c/loops/string_true-unreach-call_true-termination.i [2018-11-10 10:56:49,310 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/data/4b05655a3/cb57227c691a4bb2b8c4eca728f2bc32/FLAGe5dabfe36 [2018-11-10 10:56:49,321 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/data/4b05655a3/cb57227c691a4bb2b8c4eca728f2bc32 [2018-11-10 10:56:49,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:56:49,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:56:49,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:56:49,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:56:49,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:56:49,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10835ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49, skipping insertion in model container [2018-11-10 10:56:49,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:56:49,360 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:56:49,472 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:56:49,475 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:56:49,491 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:56:49,506 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:56:49,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49 WrapperNode [2018-11-10 10:56:49,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:56:49,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:56:49,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:56:49,507 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:56:49,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:56:49,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:56:49,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:56:49,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:56:49,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... [2018-11-10 10:56:49,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:56:49,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:56:49,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:56:49,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:56:49,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:56:49,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:56:49,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:56:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:56:49,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:56:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:56:49,692 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:56:49,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:56:49,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 10:56:49,927 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:56:49,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:49 BoogieIcfgContainer [2018-11-10 10:56:49,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:56:49,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:56:49,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:56:49,930 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:56:49,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:56:49" (1/3) ... [2018-11-10 10:56:49,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589dc6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:56:49, skipping insertion in model container [2018-11-10 10:56:49,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:56:49" (2/3) ... [2018-11-10 10:56:49,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589dc6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:56:49, skipping insertion in model container [2018-11-10 10:56:49,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:49" (3/3) ... [2018-11-10 10:56:49,932 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-11-10 10:56:49,942 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:56:49,949 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:56:49,966 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:56:49,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:56:49,992 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:56:49,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:56:49,992 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:56:49,992 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:56:49,993 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:56:49,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:56:49,993 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:56:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-10 10:56:50,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 10:56:50,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:56:50,009 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:50,011 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:56:50,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1091547452, now seen corresponding path program 1 times [2018-11-10 10:56:50,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:56:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:56:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:56:50,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:56:50,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:56:50,121 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:56:50,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 10:56:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:56:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:56:50,136 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-10 10:56:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:56:50,153 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2018-11-10 10:56:50,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:56:50,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-10 10:56:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:56:50,159 INFO L225 Difference]: With dead ends: 71 [2018-11-10 10:56:50,160 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 10:56:50,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:56:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 10:56:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 10:56:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 10:56:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 10:56:50,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2018-11-10 10:56:50,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:56:50,190 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 10:56:50,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 10:56:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-10 10:56:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:56:50,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:56:50,191 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:50,192 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:56:50,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash 499356089, now seen corresponding path program 1 times [2018-11-10 10:56:50,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:56:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:50,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:56:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:56:50,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:56:50,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:56:50,242 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:56:50,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:56:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:56:50,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:56:50,244 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-10 10:56:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:56:50,307 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2018-11-10 10:56:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:56:50,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 10:56:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:56:50,310 INFO L225 Difference]: With dead ends: 68 [2018-11-10 10:56:50,311 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 10:56:50,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:56:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 10:56:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-10 10:56:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 10:56:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-10 10:56:50,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2018-11-10 10:56:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:56:50,318 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-10 10:56:50,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:56:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-10 10:56:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 10:56:50,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:56:50,319 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:50,319 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:56:50,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1017977548, now seen corresponding path program 1 times [2018-11-10 10:56:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:56:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:50,321 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:56:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:56:50,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:56:50,390 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:56:50,391 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-10 10:56:50,392 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [31], [33], [35], [39], [43], [47], [49], [52], [58], [62], [64], [67], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115] [2018-11-10 10:56:50,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:56:50,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:56:51,172 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:56:51,174 INFO L272 AbstractInterpreter]: Visited 32 different actions 72 times. Merged at 6 different actions 30 times. Widened at 2 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-11-10 10:56:51,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:51,180 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:56:51,459 INFO L227 lantSequenceWeakener]: Weakened 33 states. On average, predicates are now at 79.83% of their original sizes. [2018-11-10 10:56:51,459 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:56:51,693 INFO L415 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2018-11-10 10:56:51,694 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:56:51,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:56:51,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-10 10:56:51,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:56:51,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:56:51,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:56:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:56:51,698 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 14 states. [2018-11-10 10:56:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:56:52,479 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-11-10 10:56:52,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:56:52,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-10 10:56:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:56:52,482 INFO L225 Difference]: With dead ends: 78 [2018-11-10 10:56:52,482 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 10:56:52,483 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:56:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 10:56:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-11-10 10:56:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 10:56:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-10 10:56:52,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 35 [2018-11-10 10:56:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:56:52,493 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-10 10:56:52,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:56:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-10 10:56:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:56:52,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:56:52,494 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:56:52,495 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:56:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1688336305, now seen corresponding path program 1 times [2018-11-10 10:56:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:56:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:56:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:56:52,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:56:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:56:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 10:56:52,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:56:52,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:56:52,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 10:56:52,546 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [28], [31], [33], [35], [39], [43], [47], [49], [52], [58], [62], [64], [67], [69], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115] [2018-11-10 10:56:52,549 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:56:52,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:56:53,999 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 10:56:53,999 INFO L272 AbstractInterpreter]: Visited 33 different actions 438 times. Merged at 14 different actions 296 times. Widened at 4 different actions 61 times. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-10 10:56:54,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:56:54,001 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 10:56:54,122 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 79.65% of their original sizes. [2018-11-10 10:56:54,122 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 10:56:54,229 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-10 10:56:54,229 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 10:56:54,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:56:54,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-10 10:56:54,230 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:56:54,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:56:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:56:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:56:54,231 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 14 states. [2018-11-10 10:56:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:56:54,871 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-11-10 10:56:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:56:54,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-10 10:56:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:56:54,871 INFO L225 Difference]: With dead ends: 62 [2018-11-10 10:56:54,872 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:56:54,872 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:56:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:56:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:56:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:56:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:56:54,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-10 10:56:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:56:54,873 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:56:54,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:56:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:56:54,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:56:54,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:56:55,269 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2018-11-10 10:56:55,438 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 10:56:55,439 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-11-10 10:56:55,439 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-11-10 10:56:55,440 INFO L421 ceAbstractionStarter]: At program point L32-4(lines 32 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L421 ceAbstractionStarter]: At program point L28-4(lines 28 29) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L421 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (let ((.cse2 (not (= |main_~#string_A~0.base| 0))) (.cse1 (not (= |main_~#string_B~0.base| 0)))) (or (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) .cse1 (<= .cse0 2) .cse2 (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) (and .cse2 .cse1 (<= main_~nc_A~0 |main_~#string_A~0.offset|) (<= (+ |main_~#string_B~0.offset| |main_~#string_A~0.offset|) 0) (<= main_~nc_A~0 main_~j~0) (<= 0 (+ main_~i~0 main_~nc_A~0)) (<= (+ main_~j~0 main_~nc_B~0) 0) (<= 0 (* 2 main_~nc_B~0)) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (= main_~i~0 0)))) [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 10:56:55,441 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-11-10 10:56:55,442 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-10 10:56:55,442 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-10 10:56:55,443 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-10 10:56:55,443 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-10 10:56:55,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:56:55 BoogieIcfgContainer [2018-11-10 10:56:55,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:56:55,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:56:55,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:56:55,453 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:56:55,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:56:49" (3/4) ... [2018-11-10 10:56:55,456 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:56:55,461 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:56:55,461 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:56:55,461 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 10:56:55,466 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2018-11-10 10:56:55,467 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-10 10:56:55,467 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-10 10:56:55,467 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 10:56:55,520 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_09b08dcc-e6ee-4226-a919-6a244b2f8461/bin-2019/utaipan/witness.graphml [2018-11-10 10:56:55,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:56:55,522 INFO L168 Benchmark]: Toolchain (without parser) took 6197.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 496.5 MB). Free memory was 959.2 MB in the beginning and 1.4 GB in the end (delta: -450.7 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,522 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:56:55,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,523 INFO L168 Benchmark]: Boogie Preprocessor took 27.78 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,523 INFO L168 Benchmark]: RCFGBuilder took 349.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,524 INFO L168 Benchmark]: TraceAbstraction took 5524.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -268.7 MB). Peak memory consumption was 602.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:56:55,524 INFO L168 Benchmark]: Witness Printer took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:56:55,526 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.70 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.78 ms. Allocated memory is still 1.0 GB. Free memory was 944.8 MB in the beginning and 942.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 349.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5524.82 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -268.7 MB). Peak memory consumption was 602.3 MB. Max. memory is 11.5 GB. * Witness Printer took 67.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((0 <= 2 * found && !(string_B == 0)) && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= 2 * string_A) && string_A <= string_B) || (((((((((!(string_A == 0) && !(string_B == 0)) && nc_A <= string_A) && string_B + string_A <= 0) && nc_A <= j) && 0 <= i + nc_A) && j + nc_B <= 0) && 0 <= 2 * nc_B) && 0 <= i + string_B) && i == 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 265 SDslu, 299 SDs, 0 SdLazy, 59 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9540265986160864 AbsIntWeakeningRatio, 1.6619718309859155 AbsIntAvgWeakeningVarsNumRemoved, 278.6056338028169 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 18 PreInvPairs, 36 NumberOfFragments, 281 HoareAnnotationTreeSize, 18 FomulaSimplifications, 3654 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1054 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 4572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...