./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Ackermann01-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/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 c2f1e635c5c806286d01eb0b8ff07448b8253a7a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:40:34,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:40:34,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:40:34,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:40:34,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:40:34,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:40:34,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:40:34,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:40:34,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:40:34,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:40:34,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:40:34,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:40:34,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:40:34,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:40:34,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:40:34,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:40:34,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:40:34,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:40:34,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:40:34,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:40:34,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:40:34,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:40:34,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:40:34,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:40:34,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:40:34,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:40:34,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:40:34,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:40:34,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:40:34,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:40:34,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:40:34,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:40:34,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:40:34,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:40:34,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:40:34,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:40:34,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:40:34,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:40:34,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:40:34,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:40:34,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:40:34,339 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:40:34,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:40:34,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:40:34,350 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:40:34,350 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:40:34,350 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:40:34,350 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:40:34,350 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:40:34,351 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:40:34,351 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:40:34,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:40:34,352 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:40:34,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:40:34,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:40:34,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:40:34,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:40:34,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:40:34,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:40:34,354 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:40:34,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:40:34,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:40:34,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:40:34,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:40:34,355 INFO L138 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/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2019-12-07 13:40:34,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:40:34,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:40:34,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:40:34,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:40:34,466 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:40:34,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/../../sv-benchmarks/c/recursive/Ackermann01-2.c [2019-12-07 13:40:34,505 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/data/81f2391f0/c9d400009fe94588a466efaa334d5e61/FLAGe028316ef [2019-12-07 13:40:34,818 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:40:34,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/sv-benchmarks/c/recursive/Ackermann01-2.c [2019-12-07 13:40:34,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/data/81f2391f0/c9d400009fe94588a466efaa334d5e61/FLAGe028316ef [2019-12-07 13:40:34,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/data/81f2391f0/c9d400009fe94588a466efaa334d5e61 [2019-12-07 13:40:34,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:40:34,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:40:34,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:40:34,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:40:34,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:40:34,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:40:34" (1/1) ... [2019-12-07 13:40:34,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:34, skipping insertion in model container [2019-12-07 13:40:34,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:40:34" (1/1) ... [2019-12-07 13:40:34,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:40:34,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:40:34,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:40:34,990 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:40:35,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:40:35,010 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:40:35,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35 WrapperNode [2019-12-07 13:40:35,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:40:35,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:40:35,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:40:35,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:40:35,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:40:35,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:40:35,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:40:35,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:40:35,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... [2019-12-07 13:40:35,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:40:35,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:40:35,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:40:35,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:40:35,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/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 [2019-12-07 13:40:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:40:35,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:40:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-12-07 13:40:35,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-12-07 13:40:35,195 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:40:35,195 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 13:40:35,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:35 BoogieIcfgContainer [2019-12-07 13:40:35,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:40:35,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:40:35,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:40:35,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:40:35,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:40:34" (1/3) ... [2019-12-07 13:40:35,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4328a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:40:35, skipping insertion in model container [2019-12-07 13:40:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:40:35" (2/3) ... [2019-12-07 13:40:35,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4328a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:40:35, skipping insertion in model container [2019-12-07 13:40:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:35" (3/3) ... [2019-12-07 13:40:35,201 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2019-12-07 13:40:35,207 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:40:35,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 13:40:35,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 13:40:35,233 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:40:35,233 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:40:35,233 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:40:35,233 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:40:35,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:40:35,233 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:40:35,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:40:35,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:40:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 13:40:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:40:35,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:35,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:35,248 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2019-12-07 13:40:35,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:35,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677929367] [2019-12-07 13:40:35,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:40:35,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677929367] [2019-12-07 13:40:35,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:40:35,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:40:35,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980687998] [2019-12-07 13:40:35,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:40:35,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:40:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:40:35,404 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 7 states. [2019-12-07 13:40:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:35,510 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-12-07 13:40:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:40:35,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 13:40:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:35,518 INFO L225 Difference]: With dead ends: 33 [2019-12-07 13:40:35,518 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 13:40:35,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:40:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 13:40:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 13:40:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:40:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-12-07 13:40:35,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2019-12-07 13:40:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:35,550 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-12-07 13:40:35,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:40:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-12-07 13:40:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:40:35,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:35,551 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:35,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2019-12-07 13:40:35,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:35,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284091507] [2019-12-07 13:40:35,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:40:35,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284091507] [2019-12-07 13:40:35,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068733303] [2019-12-07 13:40:35,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:35,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:40:35,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:40:35,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 13:40:35,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:40:35,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 14 [2019-12-07 13:40:35,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246471879] [2019-12-07 13:40:35,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:40:35,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:40:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:40:35,794 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 8 states. [2019-12-07 13:40:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:35,894 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-12-07 13:40:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:40:35,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 13:40:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:35,896 INFO L225 Difference]: With dead ends: 28 [2019-12-07 13:40:35,896 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 13:40:35,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:40:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 13:40:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-12-07 13:40:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:40:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-12-07 13:40:35,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2019-12-07 13:40:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:35,902 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-12-07 13:40:35,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:40:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-12-07 13:40:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:40:35,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:35,903 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:36,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:36,104 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash -193744714, now seen corresponding path program 1 times [2019-12-07 13:40:36,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:36,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108525566] [2019-12-07 13:40:36,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 13:40:36,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108525566] [2019-12-07 13:40:36,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801093711] [2019-12-07 13:40:36,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:36,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:40:36,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:40:36,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 13:40:36,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66448187] [2019-12-07 13:40:36,332 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 13:40:36,332 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:40:36,336 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:40:36,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:40:36,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2019-12-07 13:40:36,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258179990] [2019-12-07 13:40:36,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:40:36,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:40:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:40:36,338 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 12 states. [2019-12-07 13:40:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:36,428 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-12-07 13:40:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:40:36,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-12-07 13:40:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:36,430 INFO L225 Difference]: With dead ends: 47 [2019-12-07 13:40:36,430 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 13:40:36,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:40:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 13:40:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-12-07 13:40:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:40:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-12-07 13:40:36,437 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2019-12-07 13:40:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:36,437 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-12-07 13:40:36,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:40:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-12-07 13:40:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:40:36,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:36,439 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:36,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:36,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2019-12-07 13:40:36,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:36,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382498] [2019-12-07 13:40:36,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:40:36,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382498] [2019-12-07 13:40:36,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116176153] [2019-12-07 13:40:36,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:36,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:40:36,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:40:36,791 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 13:40:37,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1358838892] [2019-12-07 13:40:37,125 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:40:37,125 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:40:37,125 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:40:37,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:40:37,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 22 [2019-12-07 13:40:37,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216129679] [2019-12-07 13:40:37,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 13:40:37,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 13:40:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-12-07 13:40:37,127 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 22 states. [2019-12-07 13:40:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:37,491 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-12-07 13:40:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 13:40:37,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-12-07 13:40:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:37,494 INFO L225 Difference]: With dead ends: 52 [2019-12-07 13:40:37,494 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 13:40:37,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 13:40:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 13:40:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-12-07 13:40:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 13:40:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-12-07 13:40:37,505 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 31 [2019-12-07 13:40:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:37,505 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-12-07 13:40:37,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 13:40:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-12-07 13:40:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:40:37,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:37,507 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:37,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:37,709 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1839104701, now seen corresponding path program 2 times [2019-12-07 13:40:37,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:37,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835793245] [2019-12-07 13:40:37,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 13:40:37,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835793245] [2019-12-07 13:40:37,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72990202] [2019-12-07 13:40:37,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:37,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:40:37,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:40:37,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:40:37,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 13:40:38,073 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 13:40:38,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:40:38,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 9] total 32 [2019-12-07 13:40:38,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260503990] [2019-12-07 13:40:38,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:40:38,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:40:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:40:38,490 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 9 states. [2019-12-07 13:40:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:38,620 INFO L93 Difference]: Finished difference Result 54 states and 97 transitions. [2019-12-07 13:40:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:40:38,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-12-07 13:40:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:38,622 INFO L225 Difference]: With dead ends: 54 [2019-12-07 13:40:38,622 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 13:40:38,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 13:40:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 13:40:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 13:40:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 13:40:38,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 92 transitions. [2019-12-07 13:40:38,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 92 transitions. Word has length 45 [2019-12-07 13:40:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:38,631 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 92 transitions. [2019-12-07 13:40:38,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:40:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 92 transitions. [2019-12-07 13:40:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:40:38,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:38,634 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:38,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:38,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 753543944, now seen corresponding path program 3 times [2019-12-07 13:40:38,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:38,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55033605] [2019-12-07 13:40:38,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 30 proven. 102 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 13:40:39,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55033605] [2019-12-07 13:40:39,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984294068] [2019-12-07 13:40:39,139 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:39,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:40:39,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:40:39,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:40:39,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 71 proven. 49 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 13:40:39,291 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 71 proven. 58 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 13:40:40,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [527442135] [2019-12-07 13:40:40,084 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:40:40,084 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:40:40,084 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:40:40,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:40:40,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10, 13] total 39 [2019-12-07 13:40:40,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853586305] [2019-12-07 13:40:40,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 13:40:40,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 13:40:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 13:40:40,087 INFO L87 Difference]: Start difference. First operand 50 states and 92 transitions. Second operand 39 states. [2019-12-07 13:40:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:41,574 INFO L93 Difference]: Finished difference Result 118 states and 352 transitions. [2019-12-07 13:40:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 13:40:41,575 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2019-12-07 13:40:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:41,577 INFO L225 Difference]: With dead ends: 118 [2019-12-07 13:40:41,577 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 13:40:41,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=715, Invalid=3707, Unknown=0, NotChecked=0, Total=4422 [2019-12-07 13:40:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 13:40:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2019-12-07 13:40:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 13:40:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2019-12-07 13:40:41,594 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 65 [2019-12-07 13:40:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:41,595 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2019-12-07 13:40:41,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 13:40:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2019-12-07 13:40:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 13:40:41,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:40:41,600 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 12, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:40:41,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:41,801 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:40:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:40:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1282360195, now seen corresponding path program 4 times [2019-12-07 13:40:41,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:40:41,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272529696] [2019-12-07 13:40:41,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:40:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 14 proven. 464 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-12-07 13:40:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272529696] [2019-12-07 13:40:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223248930] [2019-12-07 13:40:42,383 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:40:42,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 13:40:42,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:40:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 138 proven. 250 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-12-07 13:40:42,596 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:40:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 138 proven. 302 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-12-07 13:40:44,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280985536] [2019-12-07 13:40:44,576 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 13:40:44,576 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:40:44,577 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:40:44,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:40:44,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 9, 13] total 46 [2019-12-07 13:40:44,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827685813] [2019-12-07 13:40:44,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-07 13:40:44,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:40:44,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-07 13:40:44,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 13:40:44,579 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand 46 states. [2019-12-07 13:40:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:40:48,716 INFO L93 Difference]: Finished difference Result 215 states and 609 transitions. [2019-12-07 13:40:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-07 13:40:48,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 125 [2019-12-07 13:40:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:40:48,717 INFO L225 Difference]: With dead ends: 215 [2019-12-07 13:40:48,717 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:40:48,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 247 SyntacticMatches, 17 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1368, Invalid=7374, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 13:40:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:40:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:40:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:40:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:40:48,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-12-07 13:40:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:40:48,722 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:40:48,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-07 13:40:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:40:48,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:40:48,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:40:48,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:40:49,395 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 22 [2019-12-07 13:40:49,501 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 19 [2019-12-07 13:40:49,507 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:40:49,507 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:40:49,507 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L249 CegarLoopResult]: At program point L26(lines 26 46) the Hoare annotation is: true [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L242 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= ULTIMATE.start_main_~m~0 3) (<= 0 ULTIMATE.start_main_~n~0)) [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L246 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2019-12-07 13:40:49,508 INFO L242 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (or (not (<= 0 |ackermann_#in~m|)) (<= 1 |ackermann_#in~m|)) (<= (+ |ackermann_#in~n| (* 2 ackermann_~m)) (+ (* 2 |ackermann_#in~m|) ackermann_~n))) [2019-12-07 13:40:49,509 INFO L249 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-12-07 13:40:49,509 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (+ |ackermann_#in~n| (* 2 ackermann_~m))) (.cse1 (* 2 |ackermann_#in~m|))) (and (= ackermann_~m |ackermann_#in~m|) (or (not (<= 0 |ackermann_#in~m|)) (<= 1 |ackermann_#in~m|)) (<= .cse0 .cse1) (<= .cse0 (+ .cse1 ackermann_~n)))) [2019-12-07 13:40:49,509 INFO L242 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (<= (+ |ackermann_#in~n| (* 2 ackermann_~m)) (+ (* 2 |ackermann_#in~m|) ackermann_~n)))) (or (and .cse0 (<= 3 |ackermann_#in~m|) (<= 3 (+ |ackermann_#t~ret1| |ackermann_#in~m|)) .cse1) (and (<= 1 |ackermann_#in~m|) .cse0 (<= 2 |ackermann_#t~ret1|) .cse1))) [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2019-12-07 13:40:49,509 INFO L246 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2019-12-07 13:40:49,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:40:49 BoogieIcfgContainer [2019-12-07 13:40:49,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:40:49,518 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:40:49,518 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:40:49,518 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:40:49,519 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:40:35" (3/4) ... [2019-12-07 13:40:49,522 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:40:49,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2019-12-07 13:40:49,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 13:40:49,531 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 13:40:49,572 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5e9aea12-d129-40a6-9757-098a6eda87b1/bin/utaipan/witness.graphml [2019-12-07 13:40:49,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:40:49,574 INFO L168 Benchmark]: Toolchain (without parser) took 14740.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 944.2 MB in the beginning and 821.8 MB in the end (delta: 122.4 MB). Peak memory consumption was 355.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:40:49,574 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:40:49,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:40:49,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:40:49,575 INFO L168 Benchmark]: Boogie Preprocessor took 11.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:40:49,576 INFO L168 Benchmark]: RCFGBuilder took 153.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:40:49,576 INFO L168 Benchmark]: TraceAbstraction took 14320.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 252.4 MB). Peak memory consumption was 385.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:40:49,577 INFO L168 Benchmark]: Witness Printer took 54.73 ms. Allocated memory is still 1.3 GB. Free memory was 824.6 MB in the beginning and 821.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:40:49,579 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14320.85 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 133.2 MB). Free memory was 1.1 GB in the beginning and 824.6 MB in the end (delta: 252.4 MB). Peak memory consumption was 385.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.73 ms. Allocated memory is still 1.3 GB. Free memory was 824.6 MB in the beginning and 821.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 13.6s, OverallIterations: 7, TraceHistogramMax: 18, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 132 SDtfs, 324 SDslu, 984 SDs, 0 SdLazy, 5473 SolverSat, 1006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 561 SyntacticMatches, 37 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 142 PreInvPairs, 266 NumberOfFragments, 109 HoareAnnotationTreeSize, 142 FomulaSimplifications, 13205 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4182 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 627 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 214724 SizeOfPredicates, 30 NumberOfNonLiveVariables, 871 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 1846/3144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...