./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.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_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 595c6555624af5bbcf79585a20acb2500e3eeee8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:43:18,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:43:18,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:43:18,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:43:18,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:43:18,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:43:18,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:43:18,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:43:18,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:43:18,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:43:18,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:43:18,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:43:18,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:43:18,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:43:18,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:43:18,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:43:18,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:43:18,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:43:18,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:43:18,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:43:18,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:43:18,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:43:18,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:43:18,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:43:18,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:43:18,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:43:18,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:43:18,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:43:18,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:43:18,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:43:18,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:43:18,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:43:18,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:43:18,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:43:18,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:43:18,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:43:18,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:43:18,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:43:18,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:43:18,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:43:18,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:43:18,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:43:18,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:43:18,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:43:18,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:43:18,239 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:43:18,239 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:43:18,240 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:43:18,240 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:43:18,240 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:43:18,240 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:43:18,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:43:18,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:43:18,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:43:18,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:43:18,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:43:18,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:43:18,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:43:18,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:43:18,244 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_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 -> 595c6555624af5bbcf79585a20acb2500e3eeee8 [2019-12-07 12:43:18,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:43:18,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:43:18,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:43:18,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:43:18,357 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:43:18,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-12-07 12:43:18,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/data/3f30ecf5b/cb66c40b36804648bd0108a801615c9c/FLAG7cb184297 [2019-12-07 12:43:18,795 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:43:18,795 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/sv-benchmarks/c/recursive-simple/fibo_2calls_6-1.c [2019-12-07 12:43:18,799 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/data/3f30ecf5b/cb66c40b36804648bd0108a801615c9c/FLAG7cb184297 [2019-12-07 12:43:18,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/data/3f30ecf5b/cb66c40b36804648bd0108a801615c9c [2019-12-07 12:43:18,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:43:18,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:43:18,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:43:18,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:43:18,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:43:18,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:43:18" (1/1) ... [2019-12-07 12:43:18,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c8857b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:18, skipping insertion in model container [2019-12-07 12:43:18,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:43:18" (1/1) ... [2019-12-07 12:43:18,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:43:18,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:43:18,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:43:18,939 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:43:18,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:43:19,001 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:43:19,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19 WrapperNode [2019-12-07 12:43:19,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:43:19,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:43:19,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:43:19,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:43:19,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:43:19,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:43:19,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:43:19,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:43:19,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... [2019-12-07 12:43:19,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:43:19,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:43:19,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:43:19,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:43:19,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:43:19,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:43:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-12-07 12:43:19,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-12-07 12:43:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-12-07 12:43:19,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-12-07 12:43:19,189 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:43:19,189 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 12:43:19,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:19 BoogieIcfgContainer [2019-12-07 12:43:19,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:43:19,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:43:19,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:43:19,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:43:19,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:43:18" (1/3) ... [2019-12-07 12:43:19,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0c3b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:43:19, skipping insertion in model container [2019-12-07 12:43:19,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:19" (2/3) ... [2019-12-07 12:43:19,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0c3b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:43:19, skipping insertion in model container [2019-12-07 12:43:19,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:19" (3/3) ... [2019-12-07 12:43:19,195 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-1.c [2019-12-07 12:43:19,201 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:43:19,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:43:19,213 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:43:19,227 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:43:19,227 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:43:19,227 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:43:19,227 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:43:19,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:43:19,228 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:43:19,228 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:43:19,228 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:43:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-12-07 12:43:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:43:19,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:19,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:19,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:19,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-12-07 12:43:19,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:19,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107639279] [2019-12-07 12:43:19,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:19,355 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 12:43:19,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107639279] [2019-12-07 12:43:19,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:19,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:43:19,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657646129] [2019-12-07 12:43:19,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:19,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:19,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:19,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:19,371 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2019-12-07 12:43:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:19,429 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2019-12-07 12:43:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:19,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 12:43:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:19,440 INFO L225 Difference]: With dead ends: 34 [2019-12-07 12:43:19,440 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 12:43:19,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 12:43:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 12:43:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 12:43:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 12:43:19,472 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-12-07 12:43:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:19,472 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 12:43:19,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 12:43:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:43:19,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:19,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:19,473 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-12-07 12:43:19,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:19,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434895924] [2019-12-07 12:43:19,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:19,507 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 12:43:19,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434895924] [2019-12-07 12:43:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:19,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:43:19,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266535580] [2019-12-07 12:43:19,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:19,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:19,510 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-12-07 12:43:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:19,547 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-12-07 12:43:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:19,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 12:43:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:19,548 INFO L225 Difference]: With dead ends: 32 [2019-12-07 12:43:19,549 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 12:43:19,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 12:43:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 12:43:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 12:43:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 12:43:19,556 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-12-07 12:43:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:19,556 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 12:43:19,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 12:43:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:43:19,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:19,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:19,558 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-12-07 12:43:19,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696138238] [2019-12-07 12:43:19,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:43:19,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696138238] [2019-12-07 12:43:19,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322870715] [2019-12-07 12:43:19,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:19,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:43:19,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:43:19,664 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:43:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:43:19,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273836225] [2019-12-07 12:43:19,791 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 12:43:19,791 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:19,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:43:19,799 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:43:19,799 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:43:19,853 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 3 for LOIs [2019-12-07 12:43:19,861 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 8 for LOIs [2019-12-07 12:43:19,864 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:43:19,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:19,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 7] total 15 [2019-12-07 12:43:19,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2719548] [2019-12-07 12:43:19,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:43:19,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:43:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:43:19,932 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-12-07 12:43:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:19,971 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-12-07 12:43:19,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:43:19,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 12:43:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:19,972 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:43:19,972 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 12:43:19,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:43:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 12:43:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 12:43:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:43:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-12-07 12:43:19,979 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2019-12-07 12:43:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:19,979 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-12-07 12:43:19,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:43:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-12-07 12:43:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:43:19,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:19,981 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:20,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:20,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-12-07 12:43:20,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:20,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207027150] [2019-12-07 12:43:20,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:43:20,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207027150] [2019-12-07 12:43:20,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467308447] [2019-12-07 12:43:20,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:20,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:43:20,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 12:43:20,333 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:43:20,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889880199] [2019-12-07 12:43:20,547 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:20,547 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:20,548 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 12:43:20,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:20,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 17 [2019-12-07 12:43:20,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424635148] [2019-12-07 12:43:20,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:43:20,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:43:20,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:43:20,551 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 17 states. [2019-12-07 12:43:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:20,781 INFO L93 Difference]: Finished difference Result 93 states and 136 transitions. [2019-12-07 12:43:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:43:20,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-12-07 12:43:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:20,783 INFO L225 Difference]: With dead ends: 93 [2019-12-07 12:43:20,783 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:43:20,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:43:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:43:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-12-07 12:43:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:43:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-12-07 12:43:20,793 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 35 [2019-12-07 12:43:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:20,793 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 12:43:20,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:43:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-12-07 12:43:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:43:20,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:20,794 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:20,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:20,995 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1922581139, now seen corresponding path program 1 times [2019-12-07 12:43:20,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:20,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299752221] [2019-12-07 12:43:20,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:43:21,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299752221] [2019-12-07 12:43:21,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675462564] [2019-12-07 12:43:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:21,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:43:21,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 12:43:21,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 12:43:21,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010272028] [2019-12-07 12:43:21,256 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:21,257 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:21,257 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 12:43:21,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:21,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 12 [2019-12-07 12:43:21,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922277421] [2019-12-07 12:43:21,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:43:21,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:21,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:43:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:43:21,258 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 12 states. [2019-12-07 12:43:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:21,339 INFO L93 Difference]: Finished difference Result 72 states and 102 transitions. [2019-12-07 12:43:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:43:21,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-07 12:43:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:21,340 INFO L225 Difference]: With dead ends: 72 [2019-12-07 12:43:21,340 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:43:21,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:43:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:43:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-12-07 12:43:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 12:43:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-12-07 12:43:21,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2019-12-07 12:43:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:21,348 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-12-07 12:43:21,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:43:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-12-07 12:43:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:43:21,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:21,350 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:21,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:21,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1125465908, now seen corresponding path program 1 times [2019-12-07 12:43:21,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:21,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57800194] [2019-12-07 12:43:21,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:43:21,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57800194] [2019-12-07 12:43:21,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467573315] [2019-12-07 12:43:21,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:21,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:43:21,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 12:43:21,732 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 12:43:22,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129194295] [2019-12-07 12:43:22,064 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:22,064 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:22,065 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 12:43:22,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:22,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 11] total 21 [2019-12-07 12:43:22,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619218769] [2019-12-07 12:43:22,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 12:43:22,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 12:43:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:43:22,067 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 21 states. [2019-12-07 12:43:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:22,465 INFO L93 Difference]: Finished difference Result 122 states and 185 transitions. [2019-12-07 12:43:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:43:22,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-12-07 12:43:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:22,466 INFO L225 Difference]: With dead ends: 122 [2019-12-07 12:43:22,467 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 12:43:22,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 95 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 12:43:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 12:43:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-12-07 12:43:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:43:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-12-07 12:43:22,476 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 49 [2019-12-07 12:43:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:22,477 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-12-07 12:43:22,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 12:43:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-12-07 12:43:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:43:22,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:22,479 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:22,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:22,680 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:22,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:22,680 INFO L82 PathProgramCache]: Analyzing trace with hash -751947822, now seen corresponding path program 1 times [2019-12-07 12:43:22,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:22,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944165696] [2019-12-07 12:43:22,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 12:43:22,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944165696] [2019-12-07 12:43:22,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38699592] [2019-12-07 12:43:22,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:22,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:43:22,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 12:43:22,794 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 12:43:23,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206539695] [2019-12-07 12:43:23,081 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:23,081 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:23,081 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 12:43:23,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:23,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 15 [2019-12-07 12:43:23,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904607101] [2019-12-07 12:43:23,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:43:23,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:23,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:43:23,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:43:23,082 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 15 states. [2019-12-07 12:43:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:23,191 INFO L93 Difference]: Finished difference Result 111 states and 200 transitions. [2019-12-07 12:43:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:43:23,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-12-07 12:43:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:23,193 INFO L225 Difference]: With dead ends: 111 [2019-12-07 12:43:23,194 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 12:43:23,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:43:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 12:43:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-12-07 12:43:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:43:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-12-07 12:43:23,211 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 51 [2019-12-07 12:43:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:23,211 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-12-07 12:43:23,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:43:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-12-07 12:43:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 12:43:23,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:23,216 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:23,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:23,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 596358304, now seen corresponding path program 1 times [2019-12-07 12:43:23,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:23,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415352673] [2019-12-07 12:43:23,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 31 proven. 91 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-12-07 12:43:23,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415352673] [2019-12-07 12:43:23,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559914266] [2019-12-07 12:43:23,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/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 12:43:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:23,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:43:23,679 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 13 proven. 87 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-12-07 12:43:23,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 13 proven. 97 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 12:43:24,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [885295748] [2019-12-07 12:43:24,254 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:24,254 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:24,254 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 12:43:24,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:24,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 13] total 29 [2019-12-07 12:43:24,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335672229] [2019-12-07 12:43:24,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 12:43:24,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 12:43:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:43:24,256 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 29 states. [2019-12-07 12:43:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:24,966 INFO L93 Difference]: Finished difference Result 190 states and 355 transitions. [2019-12-07 12:43:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 12:43:24,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2019-12-07 12:43:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:24,969 INFO L225 Difference]: With dead ends: 190 [2019-12-07 12:43:24,969 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 12:43:24,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 163 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=2507, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 12:43:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 12:43:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2019-12-07 12:43:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 12:43:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-12-07 12:43:24,985 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 90 [2019-12-07 12:43:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:24,986 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-12-07 12:43:24,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 12:43:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-12-07 12:43:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 12:43:24,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:24,990 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:25,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:25,191 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1032266949, now seen corresponding path program 2 times [2019-12-07 12:43:25,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:25,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365344251] [2019-12-07 12:43:25,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 204 proven. 388 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 12:43:25,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365344251] [2019-12-07 12:43:25,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119400224] [2019-12-07 12:43:25,546 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:25,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 12:43:25,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:43:25,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:43:25,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 361 proven. 6 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-12-07 12:43:25,624 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 254 proven. 21 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-12-07 12:43:26,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1327577465] [2019-12-07 12:43:26,093 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:26,093 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:26,094 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 12:43:26,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:26,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9, 9] total 32 [2019-12-07 12:43:26,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407297970] [2019-12-07 12:43:26,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 12:43:26,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 12:43:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:43:26,096 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 32 states. [2019-12-07 12:43:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:26,718 INFO L93 Difference]: Finished difference Result 229 states and 370 transitions. [2019-12-07 12:43:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 12:43:26,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 186 [2019-12-07 12:43:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:26,719 INFO L225 Difference]: With dead ends: 229 [2019-12-07 12:43:26,719 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 12:43:26,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 379 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 12:43:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 12:43:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-12-07 12:43:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 12:43:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2019-12-07 12:43:26,730 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 186 [2019-12-07 12:43:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:26,730 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2019-12-07 12:43:26,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 12:43:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2019-12-07 12:43:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 12:43:26,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:26,733 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:26,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:26,934 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1392033305, now seen corresponding path program 3 times [2019-12-07 12:43:26,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:26,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455394190] [2019-12-07 12:43:26,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 177 proven. 149 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-12-07 12:43:27,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455394190] [2019-12-07 12:43:27,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298887338] [2019-12-07 12:43:27,114 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:27,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:43:27,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:43:27,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:43:27,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 83 proven. 134 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-12-07 12:43:27,208 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 87 proven. 138 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-12-07 12:43:27,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [159208638] [2019-12-07 12:43:27,812 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:27,813 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:27,813 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 12:43:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:27,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 13] total 25 [2019-12-07 12:43:27,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576820232] [2019-12-07 12:43:27,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 12:43:27,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 12:43:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:43:27,815 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand 25 states. [2019-12-07 12:43:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:28,320 INFO L93 Difference]: Finished difference Result 258 states and 387 transitions. [2019-12-07 12:43:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:43:28,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-12-07 12:43:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:28,322 INFO L225 Difference]: With dead ends: 258 [2019-12-07 12:43:28,322 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 12:43:28,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 281 SyntacticMatches, 11 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:43:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 12:43:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2019-12-07 12:43:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 12:43:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-12-07 12:43:28,333 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 147 [2019-12-07 12:43:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:28,333 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-12-07 12:43:28,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 12:43:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2019-12-07 12:43:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-12-07 12:43:28,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:28,339 INFO L410 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 23, 19, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 11, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:28,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:28,540 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1866644877, now seen corresponding path program 4 times [2019-12-07 12:43:28,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:28,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448062494] [2019-12-07 12:43:28,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3780 backedges. 1124 proven. 879 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-12-07 12:43:28,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448062494] [2019-12-07 12:43:28,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147269225] [2019-12-07 12:43:28,985 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:29,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:43:29,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3780 backedges. 193 proven. 495 refuted. 0 times theorem prover too weak. 3092 trivial. 0 not checked. [2019-12-07 12:43:29,178 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3780 backedges. 191 proven. 505 refuted. 0 times theorem prover too weak. 3084 trivial. 0 not checked. [2019-12-07 12:43:30,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173737947] [2019-12-07 12:43:30,145 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:30,145 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:30,145 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 12:43:30,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:30,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11, 14] total 35 [2019-12-07 12:43:30,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949382675] [2019-12-07 12:43:30,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 12:43:30,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 12:43:30,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 12:43:30,147 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand 35 states. [2019-12-07 12:43:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:30,515 INFO L93 Difference]: Finished difference Result 161 states and 215 transitions. [2019-12-07 12:43:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:43:30,516 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 363 [2019-12-07 12:43:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:30,517 INFO L225 Difference]: With dead ends: 161 [2019-12-07 12:43:30,518 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 12:43:30,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 745 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=1572, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 12:43:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 12:43:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2019-12-07 12:43:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 12:43:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-12-07 12:43:30,524 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 363 [2019-12-07 12:43:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:30,525 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-12-07 12:43:30,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 12:43:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-12-07 12:43:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-12-07 12:43:30,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:30,527 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 18, 18, 17, 16, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 8, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:30,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:30,728 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1735461412, now seen corresponding path program 5 times [2019-12-07 12:43:30,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:30,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558043822] [2019-12-07 12:43:30,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 771 proven. 282 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2019-12-07 12:43:31,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558043822] [2019-12-07 12:43:31,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825905937] [2019-12-07 12:43:31,039 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:31,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 12:43:31,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:43:31,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:43:31,108 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 961 proven. 42 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-12-07 12:43:31,223 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 496 proven. 112 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2019-12-07 12:43:32,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1579344820] [2019-12-07 12:43:32,032 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:32,032 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:32,032 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 12:43:32,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:32,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 13] total 37 [2019-12-07 12:43:32,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712241165] [2019-12-07 12:43:32,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 12:43:32,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 12:43:32,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 12:43:32,034 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 37 states. [2019-12-07 12:43:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:32,691 INFO L93 Difference]: Finished difference Result 234 states and 304 transitions. [2019-12-07 12:43:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 12:43:32,691 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 282 [2019-12-07 12:43:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:32,693 INFO L225 Difference]: With dead ends: 234 [2019-12-07 12:43:32,693 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 12:43:32,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 559 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=2571, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 12:43:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 12:43:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-12-07 12:43:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 12:43:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-12-07 12:43:32,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 282 [2019-12-07 12:43:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:32,701 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-12-07 12:43:32,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 12:43:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-12-07 12:43:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-12-07 12:43:32,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:32,702 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:32,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:32,903 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:32,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:32,903 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 6 times [2019-12-07 12:43:32,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:32,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848983673] [2019-12-07 12:43:32,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 476 proven. 129 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2019-12-07 12:43:33,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848983673] [2019-12-07 12:43:33,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949566362] [2019-12-07 12:43:33,163 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:33,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:43:33,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:43:33,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:43:33,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 250 proven. 118 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-12-07 12:43:33,284 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 248 proven. 128 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2019-12-07 12:43:34,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877624617] [2019-12-07 12:43:34,014 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:34,014 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:34,015 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 12:43:34,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:34,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 14] total 31 [2019-12-07 12:43:34,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138606912] [2019-12-07 12:43:34,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 12:43:34,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 12:43:34,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2019-12-07 12:43:34,017 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 31 states. [2019-12-07 12:43:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:34,263 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-12-07 12:43:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:43:34,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 214 [2019-12-07 12:43:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:34,264 INFO L225 Difference]: With dead ends: 120 [2019-12-07 12:43:34,264 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 12:43:34,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 418 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 12:43:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 12:43:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2019-12-07 12:43:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 12:43:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-12-07 12:43:34,270 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 214 [2019-12-07 12:43:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:34,270 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-12-07 12:43:34,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 12:43:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-12-07 12:43:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 12:43:34,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:34,271 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:34,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:34,472 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 7 times [2019-12-07 12:43:34,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:43:34,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471996826] [2019-12-07 12:43:34,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-12-07 12:43:34,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471996826] [2019-12-07 12:43:34,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114779187] [2019-12-07 12:43:34,905 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:34,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 103 conjunts are in the unsatisfiable core [2019-12-07 12:43:34,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:43:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-12-07 12:43:35,285 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:43:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-12-07 12:43:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2139134541] [2019-12-07 12:43:36,189 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 12:43:36,189 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:43:36,189 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 12:43:36,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:43:36,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2019-12-07 12:43:36,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240103584] [2019-12-07 12:43:36,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 12:43:36,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:43:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 12:43:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:43:36,191 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 36 states. [2019-12-07 12:43:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:36,404 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2019-12-07 12:43:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 12:43:36,404 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 173 [2019-12-07 12:43:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:36,404 INFO L225 Difference]: With dead ends: 104 [2019-12-07 12:43:36,404 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:43:36,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 335 SyntacticMatches, 28 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:43:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:43:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:43:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:43:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:43:36,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2019-12-07 12:43:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:36,406 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:43:36,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 12:43:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:43:36,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:43:36,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:43:36,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:43:37,281 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 31 [2019-12-07 12:43:37,569 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 25 [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (= ULTIMATE.start_main_~x~0 6) [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-12-07 12:43:37,571 INFO L242 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 6 ULTIMATE.start_main_~x~0) [2019-12-07 12:43:37,571 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-12-07 12:43:37,571 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (< 1 fibo2_~n) (<= |fibo2_#in~n| fibo2_~n)) [2019-12-07 12:43:37,571 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< 3 |fibo2_#in~n|))) (and (<= fibo2_~n |fibo2_#in~n|) (or (not .cse0) (<= (+ fibo2_~n 5) (* 2 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|))) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) .cse0) (<= |fibo2_#in~n| fibo2_~n) (not (<= |fibo2_#in~n| 1)) (or (not (= 5 |fibo2_#in~n|)) (and (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 3))))) [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-12-07 12:43:37,572 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (not (<= |fibo1_#in~n| 3)) (<= |fibo1_#in~n| fibo1_~n)) [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (or (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2)) (< 4 fibo1_~n)) (or (not (= 6 |fibo1_#in~n|)) (and (<= |fibo1_#t~ret0| 5) (<= 5 |fibo1_#t~ret0|))) (<= |fibo1_#in~n| fibo1_~n) (<= (+ fibo1_~n 4) (* 2 |fibo1_#in~n|))) [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-12-07 12:43:37,572 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-12-07 12:43:37,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:43:37 BoogieIcfgContainer [2019-12-07 12:43:37,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:43:37,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:43:37,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:43:37,584 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:43:37,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:19" (3/4) ... [2019-12-07 12:43:37,586 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:43:37,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-12-07 12:43:37,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-12-07 12:43:37,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 12:43:37,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:43:37,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:43:37,620 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d5282c08-59ea-4ca0-b2e5-0969e20af867/bin/utaipan/witness.graphml [2019-12-07 12:43:37,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:43:37,621 INFO L168 Benchmark]: Toolchain (without parser) took 18810.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -417.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:43:37,621 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:43:37,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:37,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.82 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 12:43:37,622 INFO L168 Benchmark]: Boogie Preprocessor took 11.60 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 12:43:37,622 INFO L168 Benchmark]: RCFGBuilder took 156.60 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:37,622 INFO L168 Benchmark]: TraceAbstraction took 18392.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 301.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.3 MB). Peak memory consumption was 534.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:37,622 INFO L168 Benchmark]: Witness Printer took 36.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:37,624 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.82 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.60 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 156.60 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18392.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 301.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.3 MB). Peak memory consumption was 534.9 MB. Max. memory is 11.5 GB. * Witness Printer took 36.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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: 38]: Loop Invariant Derived loop invariant: 6 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Result: SAFE, OverallTime: 17.3s, OverallIterations: 14, TraceHistogramMax: 29, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 424 SDtfs, 1105 SDslu, 4135 SDs, 0 SdLazy, 5237 SolverSat, 1111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3785 GetRequests, 3250 SyntacticMatches, 124 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3516 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 112 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 377 PreInvPairs, 662 NumberOfFragments, 119 HoareAnnotationTreeSize, 377 FomulaSimplifications, 22292 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5374 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 3317 NumberOfCodeBlocks, 3040 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 4928 ConstructedInterpolants, 0 QuantifiedInterpolants, 2116973 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3028 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 24721/29523 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 73, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME[ms]: 2, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME[ms]: 6, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 4, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME[ms]: 7, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 1, FLUID_QUERY_TIME[ms]: 2, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 19, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 8, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 31, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 31, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 3, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 8, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...