./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_5-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 063966206f80cef10873a8e49ae0985aad7f65cb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:24:52,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:24:52,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:24:52,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:24:52,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:24:52,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:24:52,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:24:52,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:24:52,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:24:52,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:24:52,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:24:52,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:24:52,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:24:52,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:24:52,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:24:52,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:24:52,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:24:52,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:24:52,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:24:52,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:24:52,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:24:52,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:24:52,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:24:52,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:24:52,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:24:52,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:24:52,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:24:52,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:24:52,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:24:52,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:24:52,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:24:52,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:24:52,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:24:52,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:24:52,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:24:52,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:24:52,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:24:52,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:24:52,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:24:52,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:24:52,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:24:52,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:24:52,414 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:24:52,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:24:52,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:24:52,417 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:24:52,417 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:24:52,417 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:24:52,418 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:24:52,418 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:24:52,424 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:24:52,425 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:24:52,426 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:24:52,426 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:24:52,426 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:24:52,427 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:24:52,427 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:24:52,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:24:52,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:24:52,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:24:52,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:24:52,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:24:52,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:24:52,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:24:52,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:24:52,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:24:52,430 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:24:52,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:24:52,430 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:24:52,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:24:52,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:24:52,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:24:52,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:24:52,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:24:52,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:24:52,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:24:52,434 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:24:52,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:24:52,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:24:52,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:24:52,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:24:52,435 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI 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(reach_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 -> 063966206f80cef10873a8e49ae0985aad7f65cb [2021-10-11 02:24:52,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:24:52,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:24:52,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:24:52,799 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:24:52,800 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:24:52,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/fibo_5-2.c [2021-10-11 02:24:52,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/data/1b10ea870/35b30185ae294266a80cdb599c894de0/FLAG05f0eb81f [2021-10-11 02:24:53,357 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:24:53,358 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/sv-benchmarks/c/recursive-simple/fibo_5-2.c [2021-10-11 02:24:53,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/data/1b10ea870/35b30185ae294266a80cdb599c894de0/FLAG05f0eb81f [2021-10-11 02:24:53,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/data/1b10ea870/35b30185ae294266a80cdb599c894de0 [2021-10-11 02:24:53,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:24:53,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:24:53,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:53,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:24:53,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:24:53,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:53,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a45ac33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53, skipping insertion in model container [2021-10-11 02:24:53,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:53,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:24:53,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:24:53,940 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2021-10-11 02:24:53,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:53,953 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:24:53,969 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/sv-benchmarks/c/recursive-simple/fibo_5-2.c[740,753] [2021-10-11 02:24:53,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:53,985 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:24:53,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53 WrapperNode [2021-10-11 02:24:53,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:53,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:53,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:24:53,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:24:53,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:54,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:24:54,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:24:54,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:24:54,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... [2021-10-11 02:24:54,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:24:54,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:24:54,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:24:54,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:24:54,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:24:54,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:24:54,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:24:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:24:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-11 02:24:54,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-11 02:24:54,428 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:24:54,428 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:24:54,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:54 BoogieIcfgContainer [2021-10-11 02:24:54,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:24:54,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:24:54,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:24:54,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:24:54,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:24:53" (1/3) ... [2021-10-11 02:24:54,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43641fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:54, skipping insertion in model container [2021-10-11 02:24:54,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:53" (2/3) ... [2021-10-11 02:24:54,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43641fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:54, skipping insertion in model container [2021-10-11 02:24:54,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:54" (3/3) ... [2021-10-11 02:24:54,453 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2021-10-11 02:24:54,466 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:24:54,483 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:24:54,495 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:24:54,548 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:24:54,548 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:24:54,548 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:24:54,549 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:24:54,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:24:54,549 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:24:54,549 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:24:54,549 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:24:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2021-10-11 02:24:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:24:54,569 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:54,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:54,570 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2021-10-11 02:24:54,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:54,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932524390] [2021-10-11 02:24:54,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:54,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932524390] [2021-10-11 02:24:54,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:54,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:24:54,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945684048] [2021-10-11 02:24:54,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:24:54,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:24:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:24:54,861 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2021-10-11 02:24:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:54,906 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-10-11 02:24:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:24:54,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:24:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:54,917 INFO L225 Difference]: With dead ends: 27 [2021-10-11 02:24:54,917 INFO L226 Difference]: Without dead ends: 17 [2021-10-11 02:24:54,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:24:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-11 02:24:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 02:24:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:24:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:24:54,959 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-11 02:24:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:54,960 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:24:54,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:24:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:24:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:24:54,962 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:54,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:54,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:24:54,963 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2021-10-11 02:24:54,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:54,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128132536] [2021-10-11 02:24:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:55,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128132536] [2021-10-11 02:24:55,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:55,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:24:55,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369151238] [2021-10-11 02:24:55,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:24:55,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:55,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:24:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:24:55,034 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2021-10-11 02:24:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:55,062 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-11 02:24:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:24:55,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:24:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:55,066 INFO L225 Difference]: With dead ends: 23 [2021-10-11 02:24:55,067 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:24:55,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:24:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:24:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-11 02:24:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:24:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:24:55,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-11 02:24:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:55,081 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:24:55,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:24:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:24:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:24:55,083 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:55,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:55,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:24:55,084 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2021-10-11 02:24:55,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:55,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505146892] [2021-10-11 02:24:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:24:55,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505146892] [2021-10-11 02:24:55,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503447149] [2021-10-11 02:24:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:55,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:24:55,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:24:55,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:24:55,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640745041] [2021-10-11 02:24:55,856 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:24:55,856 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:55,863 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:24:55,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:55,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-10-11 02:24:55,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127394514] [2021-10-11 02:24:55,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:24:55,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:24:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:24:55,870 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2021-10-11 02:24:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:56,005 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-11 02:24:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:24:56,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2021-10-11 02:24:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:56,008 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:24:56,009 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:24:56,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:24:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:24:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-11 02:24:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-11 02:24:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-11 02:24:56,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-10-11 02:24:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:56,022 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-11 02:24:56,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:24:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-10-11 02:24:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:24:56,025 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:56,025 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:56,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:24:56,239 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2021-10-11 02:24:56,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:56,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470171016] [2021-10-11 02:24:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:24:56,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470171016] [2021-10-11 02:24:56,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598482640] [2021-10-11 02:24:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:56,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:24:56,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:24:56,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:24:56,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311020843] [2021-10-11 02:24:56,694 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:24:56,694 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:56,695 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:24:56,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:56,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-11 02:24:56,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412003989] [2021-10-11 02:24:56,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:24:56,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:24:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:24:56,701 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2021-10-11 02:24:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:56,787 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-10-11 02:24:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:24:56,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2021-10-11 02:24:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:56,793 INFO L225 Difference]: With dead ends: 28 [2021-10-11 02:24:56,794 INFO L226 Difference]: Without dead ends: 24 [2021-10-11 02:24:56,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:24:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-11 02:24:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-11 02:24:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-10-11 02:24:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-11 02:24:56,808 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-10-11 02:24:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:56,809 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-11 02:24:56,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:24:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-11 02:24:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:24:56,813 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:56,813 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:57,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:57,034 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2021-10-11 02:24:57,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:57,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868043220] [2021-10-11 02:24:57,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:24:57,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868043220] [2021-10-11 02:24:57,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783732810] [2021-10-11 02:24:57,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:57,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:24:57,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:24:57,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:24:57,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-11 02:24:57,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:24:57,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [681783251] [2021-10-11 02:24:57,550 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:24:57,551 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:57,555 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:24:57,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:57,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-10-11 02:24:57,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933216973] [2021-10-11 02:24:57,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:24:57,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:24:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:24:57,561 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 14 states. [2021-10-11 02:24:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:57,846 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-10-11 02:24:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:24:57,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2021-10-11 02:24:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:57,851 INFO L225 Difference]: With dead ends: 55 [2021-10-11 02:24:57,851 INFO L226 Difference]: Without dead ends: 33 [2021-10-11 02:24:57,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:24:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-11 02:24:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-10-11 02:24:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-10-11 02:24:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-10-11 02:24:57,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-10-11 02:24:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:57,874 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-10-11 02:24:57,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:24:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-10-11 02:24:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:24:57,881 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:57,882 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:58,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:58,105 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2099733774, now seen corresponding path program 3 times [2021-10-11 02:24:58,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:58,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153058645] [2021-10-11 02:24:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:24:58,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153058645] [2021-10-11 02:24:58,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753488467] [2021-10-11 02:24:58,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:58,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:24:58,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:24:58,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:24:58,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:24:58,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-11 02:24:58,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640442927] [2021-10-11 02:24:58,626 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:24:58,626 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:58,627 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:24:58,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:58,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-11 02:24:58,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240314133] [2021-10-11 02:24:58,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:24:58,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:58,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:24:58,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:24:58,630 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2021-10-11 02:24:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:58,742 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-10-11 02:24:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:24:58,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2021-10-11 02:24:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:58,744 INFO L225 Difference]: With dead ends: 36 [2021-10-11 02:24:58,745 INFO L226 Difference]: Without dead ends: 32 [2021-10-11 02:24:58,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:24:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-11 02:24:58,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-11 02:24:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:24:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-10-11 02:24:58,752 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-10-11 02:24:58,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:58,753 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-10-11 02:24:58,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:24:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-10-11 02:24:58,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-11 02:24:58,756 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:58,756 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:58,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:58,969 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1019643787, now seen corresponding path program 4 times [2021-10-11 02:24:58,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:58,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730578208] [2021-10-11 02:24:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:24:59,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730578208] [2021-10-11 02:24:59,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385516682] [2021-10-11 02:24:59,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:24:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:59,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:24:59,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:24:59,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-10-11 02:24:59,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [135901223] [2021-10-11 02:24:59,925 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:24:59,927 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:59,927 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:24:59,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:59,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 12 [2021-10-11 02:24:59,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767804552] [2021-10-11 02:24:59,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:24:59,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:24:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:24:59,933 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 12 states. [2021-10-11 02:25:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:00,085 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-10-11 02:25:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:25:00,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2021-10-11 02:25:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:00,091 INFO L225 Difference]: With dead ends: 41 [2021-10-11 02:25:00,091 INFO L226 Difference]: Without dead ends: 37 [2021-10-11 02:25:00,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:25:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-11 02:25:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-11 02:25:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-10-11 02:25:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-10-11 02:25:00,099 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 78 [2021-10-11 02:25:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:00,100 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-10-11 02:25:00,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:25:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-10-11 02:25:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-11 02:25:00,102 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:00,102 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:00,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:25:00,317 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 5 times [2021-10-11 02:25:00,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:00,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699051499] [2021-10-11 02:25:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:00,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:00,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:00,421 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:25:00,421 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:25:00,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:25:00,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:25:00 BoogieIcfgContainer [2021-10-11 02:25:00,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:25:00,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:25:00,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:25:00,493 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:25:00,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:54" (3/4) ... [2021-10-11 02:25:00,496 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:25:00,573 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7731d0e-bfb4-4183-84e5-472ab871f8c1/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:25:00,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:25:00,575 INFO L168 Benchmark]: Toolchain (without parser) took 6835.10 ms. Allocated memory was 79.7 MB in the beginning and 163.6 MB in the end (delta: 83.9 MB). Free memory was 40.9 MB in the beginning and 56.9 MB in the end (delta: -16.0 MB). Peak memory consumption was 69.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,575 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 79.7 MB. Free memory is still 57.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:25:00,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.12 ms. Allocated memory was 79.7 MB in the beginning and 113.2 MB in the end (delta: 33.6 MB). Free memory was 40.7 MB in the beginning and 89.4 MB in the end (delta: -48.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.74 ms. Allocated memory is still 113.2 MB. Free memory was 89.4 MB in the beginning and 87.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,577 INFO L168 Benchmark]: Boogie Preprocessor took 20.59 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 87.4 MB in the end (delta: 589.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:25:00,577 INFO L168 Benchmark]: RCFGBuilder took 402.73 ms. Allocated memory is still 113.2 MB. Free memory was 87.0 MB in the beginning and 73.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,578 INFO L168 Benchmark]: TraceAbstraction took 6046.16 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 73.3 MB in the beginning and 63.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,578 INFO L168 Benchmark]: Witness Printer took 80.21 ms. Allocated memory is still 163.6 MB. Free memory was 63.2 MB in the beginning and 56.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:00,581 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 79.7 MB. Free memory is still 57.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 242.12 ms. Allocated memory was 79.7 MB in the beginning and 113.2 MB in the end (delta: 33.6 MB). Free memory was 40.7 MB in the beginning and 89.4 MB in the end (delta: -48.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.74 ms. Allocated memory is still 113.2 MB. Free memory was 89.4 MB in the beginning and 87.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.59 ms. Allocated memory is still 113.2 MB. Free memory was 87.9 MB in the beginning and 87.4 MB in the end (delta: 589.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 402.73 ms. Allocated memory is still 113.2 MB. Free memory was 87.0 MB in the beginning and 73.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6046.16 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 73.3 MB in the beginning and 63.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.1 GB. * Witness Printer took 80.21 ms. Allocated memory is still 163.6 MB. Free memory was 63.2 MB in the beginning and 56.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 5; [L27] CALL, EXPR fibo(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 5 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 15, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 100 SDtfs, 232 SDslu, 264 SDs, 0 SdLazy, 344 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 376 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 516 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 590 ConstructedInterpolants, 0 QuantifiedInterpolants, 58860 SizeOfPredicates, 18 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 718/1254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...