./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba --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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:26:18,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:26:18,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:26:18,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:26:18,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:26:18,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:26:18,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:26:18,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:26:18,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:26:18,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:26:18,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:26:18,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:26:18,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:26:18,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:26:18,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:26:18,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:26:18,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:26:18,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:26:18,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:26:18,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:26:18,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:26:18,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:26:18,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:26:18,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:26:18,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:26:18,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:26:18,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:26:18,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:26:18,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:26:18,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:26:18,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:26:18,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:26:18,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:26:18,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:26:18,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:26:18,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:26:18,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:26:18,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:26:18,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:26:18,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:26:18,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:26:18,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:26:18,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:26:18,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:26:18,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:26:18,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:26:18,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:26:18,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:26:18,990 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:26:18,991 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:26:18,991 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:26:18,991 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:26:18,991 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:26:18,991 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:26:18,992 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:26:18,992 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:26:18,992 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:26:18,992 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:26:18,993 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:26:18,993 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:26:18,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:26:18,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:26:18,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:26:18,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:26:18,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:26:18,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:26:18,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:26:18,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:26:18,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:26:18,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:26:18,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:26:18,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:26:19,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:26:19,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:26:19,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:26:19,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:26:19,002 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:26:19,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:26:19,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:26:19,003 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:26:19,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:26:19,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:26:19,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:26:19,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/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_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2022-11-22 01:26:19,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:26:19,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:26:19,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:26:19,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:26:19,354 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:26:19,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-22 01:26:22,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:26:22,571 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:26:22,572 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/sv-benchmarks/c/recursive/Fibonacci05.c [2022-11-22 01:26:22,578 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/data/13ea5af31/c120a71a7e4f4964a5c3d9980d63c324/FLAG5e849aec5 [2022-11-22 01:26:22,593 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/data/13ea5af31/c120a71a7e4f4964a5c3d9980d63c324 [2022-11-22 01:26:22,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:26:22,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:26:22,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:26:22,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:26:22,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:26:22,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2da2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22, skipping insertion in model container [2022-11-22 01:26:22,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:26:22,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:26:22,747 WARN L237 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_37f0e674-e986-4230-9c87-64afd81f3bc8/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-22 01:26:22,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:26:22,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:26:22,774 WARN L237 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_37f0e674-e986-4230-9c87-64afd81f3bc8/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-11-22 01:26:22,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:26:22,787 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:26:22,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22 WrapperNode [2022-11-22 01:26:22,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:26:22,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:26:22,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:26:22,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:26:22,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,820 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-11-22 01:26:22,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:26:22,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:26:22,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:26:22,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:26:22,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,837 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:26:22,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:26:22,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:26:22,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:26:22,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (1/1) ... [2022-11-22 01:26:22,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:26:22,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:22,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:26:22,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:26:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-11-22 01:26:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-11-22 01:26:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:26:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:26:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:26:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:26:22,993 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:26:22,997 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:26:23,125 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:26:23,140 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:26:23,142 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:26:23,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:23 BoogieIcfgContainer [2022-11-22 01:26:23,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:26:23,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:26:23,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:26:23,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:26:23,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:26:22" (1/3) ... [2022-11-22 01:26:23,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2893cedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:23, skipping insertion in model container [2022-11-22 01:26:23,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:22" (2/3) ... [2022-11-22 01:26:23,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2893cedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:23, skipping insertion in model container [2022-11-22 01:26:23,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:23" (3/3) ... [2022-11-22 01:26:23,160 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2022-11-22 01:26:23,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:26:23,187 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:26:23,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:26:23,271 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6683da7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:26:23,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:26:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:26:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:26:23,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:23,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:23,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:23,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2022-11-22 01:26:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:23,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613930297] [2022-11-22 01:26:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:26:23,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:23,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613930297] [2022-11-22 01:26:23,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613930297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:26:23,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:26:23,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:26:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589914422] [2022-11-22 01:26:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:26:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:26:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:26:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:26:23,567 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:26:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:23,664 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-11-22 01:26:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:26:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-11-22 01:26:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:23,674 INFO L225 Difference]: With dead ends: 27 [2022-11-22 01:26:23,675 INFO L226 Difference]: Without dead ends: 17 [2022-11-22 01:26:23,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:26:23,682 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:23,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:26:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-22 01:26:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-22 01:26:23,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-22 01:26:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-22 01:26:23,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2022-11-22 01:26:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-22 01:26:23,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:26:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-22 01:26:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 01:26:23,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:23,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:23,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:26:23,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2022-11-22 01:26:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:23,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487514015] [2022-11-22 01:26:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:26:23,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:23,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487514015] [2022-11-22 01:26:23,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487514015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:26:23,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:26:23,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:26:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661739580] [2022-11-22 01:26:23,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:26:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:26:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:26:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:26:23,937 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:26:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:24,004 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-11-22 01:26:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:26:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-22 01:26:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:24,006 INFO L225 Difference]: With dead ends: 23 [2022-11-22 01:26:24,006 INFO L226 Difference]: Without dead ends: 19 [2022-11-22 01:26:24,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:26:24,008 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:24,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:26:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-22 01:26:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-22 01:26:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-22 01:26:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-22 01:26:24,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-11-22 01:26:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:24,016 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-22 01:26:24,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:26:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-22 01:26:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 01:26:24,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:24,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:24,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:26:24,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2022-11-22 01:26:24,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:24,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604313715] [2022-11-22 01:26:24,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:24,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:26:24,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604313715] [2022-11-22 01:26:24,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604313715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:24,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012703396] [2022-11-22 01:26:24,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:24,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:24,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:26:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:24,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:26:24,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 01:26:24,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 01:26:24,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012703396] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1170618570] [2022-11-22 01:26:24,737 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:24,737 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:24,742 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:24,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:24,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-11-22 01:26:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132565325] [2022-11-22 01:26:24,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:24,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:26:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:26:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:26:24,747 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-22 01:26:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:24,886 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-11-22 01:26:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:26:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2022-11-22 01:26:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:24,888 INFO L225 Difference]: With dead ends: 41 [2022-11-22 01:26:24,889 INFO L226 Difference]: Without dead ends: 24 [2022-11-22 01:26:24,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:26:24,891 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:24,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:26:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-22 01:26:24,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-22 01:26:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-22 01:26:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-22 01:26:24,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2022-11-22 01:26:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:24,901 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-22 01:26:24,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-22 01:26:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-22 01:26:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 01:26:24,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:24,904 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:24,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:26:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:25,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 271867855, now seen corresponding path program 1 times [2022-11-22 01:26:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644293070] [2022-11-22 01:26:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-22 01:26:25,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644293070] [2022-11-22 01:26:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644293070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155086321] [2022-11-22 01:26:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:25,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:25,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:26:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:25,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 01:26:25,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-22 01:26:25,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-22 01:26:26,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155086321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:26,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [486243223] [2022-11-22 01:26:26,089 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:26,090 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:26,090 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:26,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-11-22 01:26:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000448918] [2022-11-22 01:26:26,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:26,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 01:26:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 01:26:26,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-22 01:26:26,096 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 01:26:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:26,257 INFO L93 Difference]: Finished difference Result 43 states and 73 transitions. [2022-11-22 01:26:26,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 01:26:26,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 50 [2022-11-22 01:26:26,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:26,265 INFO L225 Difference]: With dead ends: 43 [2022-11-22 01:26:26,266 INFO L226 Difference]: Without dead ends: 37 [2022-11-22 01:26:26,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:26:26,269 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:26,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 47 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:26:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-22 01:26:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-22 01:26:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (30), 9 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-22 01:26:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. [2022-11-22 01:26:26,291 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 50 [2022-11-22 01:26:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:26,291 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. [2022-11-22 01:26:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-22 01:26:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. [2022-11-22 01:26:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-22 01:26:26,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:26,296 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 13, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:26,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:26:26,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-22 01:26:26,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1035226507, now seen corresponding path program 2 times [2022-11-22 01:26:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:26,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334418124] [2022-11-22 01:26:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 316 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-11-22 01:26:26,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334418124] [2022-11-22 01:26:26,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334418124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34328432] [2022-11-22 01:26:26,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:26:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:26,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:26,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 01:26:27,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-22 01:26:27,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:26:27,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 01:26:27,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 476 proven. 13 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2022-11-22 01:26:27,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 267 proven. 60 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2022-11-22 01:26:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34328432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:27,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280370049] [2022-11-22 01:26:27,778 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:27,778 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:27,778 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:27,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-11-22 01:26:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653334723] [2022-11-22 01:26:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:27,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-22 01:26:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:27,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-22 01:26:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-22 01:26:27,786 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-22 01:26:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:28,230 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2022-11-22 01:26:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 01:26:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) Word has length 130 [2022-11-22 01:26:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:28,236 INFO L225 Difference]: With dead ends: 86 [2022-11-22 01:26:28,236 INFO L226 Difference]: Without dead ends: 54 [2022-11-22 01:26:28,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 01:26:28,242 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 89 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:28,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 78 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:26:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-22 01:26:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-22 01:26:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-22 01:26:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-22 01:26:28,263 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 130 [2022-11-22 01:26:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:28,265 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-22 01:26:28,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 11 states have call successors, (15), 2 states have call predecessors, (15), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-22 01:26:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-22 01:26:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-22 01:26:28,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:28,276 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:28,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:26:28,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:28,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash -454540380, now seen corresponding path program 3 times [2022-11-22 01:26:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:28,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118916830] [2022-11-22 01:26:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-22 01:26:28,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118916830] [2022-11-22 01:26:28,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118916830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:28,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366094205] [2022-11-22 01:26:28,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 01:26:28,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:28,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:28,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:28,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:26:29,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 01:26:29,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:26:29,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-22 01:26:29,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-11-22 01:26:29,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2022-11-22 01:26:30,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366094205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:30,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572066186] [2022-11-22 01:26:30,690 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:30,691 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:30,691 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:30,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:30,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2022-11-22 01:26:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320865509] [2022-11-22 01:26:30,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:30,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 01:26:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:30,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 01:26:30,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-11-22 01:26:30,693 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) [2022-11-22 01:26:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:30,928 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2022-11-22 01:26:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:26:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) Word has length 173 [2022-11-22 01:26:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:30,931 INFO L225 Difference]: With dead ends: 70 [2022-11-22 01:26:30,931 INFO L226 Difference]: Without dead ends: 64 [2022-11-22 01:26:30,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 338 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2022-11-22 01:26:30,933 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:30,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 62 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:26:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-22 01:26:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-22 01:26:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 42 states have internal predecessors, (47), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (43), 15 states have call predecessors, (43), 11 states have call successors, (43) [2022-11-22 01:26:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 101 transitions. [2022-11-22 01:26:30,944 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 101 transitions. Word has length 173 [2022-11-22 01:26:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:30,945 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 101 transitions. [2022-11-22 01:26:30,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (20), 9 states have call predecessors, (20), 13 states have call successors, (20) [2022-11-22 01:26:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 101 transitions. [2022-11-22 01:26:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2022-11-22 01:26:30,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:30,958 INFO L195 NwaCegarLoop]: trace histogram [85, 85, 69, 42, 42, 42, 42, 42, 42, 42, 27, 16, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:30,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-22 01:26:31,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:31,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash 268512456, now seen corresponding path program 4 times [2022-11-22 01:26:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088909538] [2022-11-22 01:26:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 1155 proven. 3628 refuted. 0 times theorem prover too weak. 15287 trivial. 0 not checked. [2022-11-22 01:26:32,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088909538] [2022-11-22 01:26:32,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088909538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822503493] [2022-11-22 01:26:32,782 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 01:26:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:32,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:32,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 01:26:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:33,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-22 01:26:33,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 9532 proven. 2375 refuted. 0 times theorem prover too weak. 8163 trivial. 0 not checked. [2022-11-22 01:26:33,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20070 backedges. 1322 proven. 4180 refuted. 0 times theorem prover too weak. 14568 trivial. 0 not checked. [2022-11-22 01:26:38,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822503493] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19443020] [2022-11-22 01:26:38,403 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:38,403 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:38,404 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:38,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:38,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2022-11-22 01:26:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049212816] [2022-11-22 01:26:38,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 01:26:38,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 01:26:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-11-22 01:26:38,414 INFO L87 Difference]: Start difference. First operand 64 states and 101 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2022-11-22 01:26:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:39,461 INFO L93 Difference]: Finished difference Result 165 states and 343 transitions. [2022-11-22 01:26:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 01:26:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) Word has length 582 [2022-11-22 01:26:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:39,464 INFO L225 Difference]: With dead ends: 165 [2022-11-22 01:26:39,464 INFO L226 Difference]: Without dead ends: 105 [2022-11-22 01:26:39,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1144 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 01:26:39,467 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 315 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:39,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 149 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:26:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-22 01:26:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2022-11-22 01:26:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.044776119402985) internal successors, (70), 64 states have internal predecessors, (70), 17 states have call successors, (17), 14 states have call predecessors, (17), 9 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2022-11-22 01:26:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2022-11-22 01:26:39,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 582 [2022-11-22 01:26:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:39,481 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2022-11-22 01:26:39,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2022-11-22 01:26:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2022-11-22 01:26:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2022-11-22 01:26:39,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:39,500 INFO L195 NwaCegarLoop]: trace histogram [97, 97, 78, 48, 48, 48, 48, 48, 48, 48, 30, 19, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:39,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 01:26:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:39,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1312747780, now seen corresponding path program 5 times [2022-11-22 01:26:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94287985] [2022-11-22 01:26:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:26:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 2015 proven. 4150 refuted. 0 times theorem prover too weak. 19974 trivial. 0 not checked. [2022-11-22 01:26:41,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:26:41,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94287985] [2022-11-22 01:26:41,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94287985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:26:41,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187143295] [2022-11-22 01:26:41,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:26:41,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:41,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:26:41,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:26:41,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 01:26:41,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2022-11-22 01:26:41,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:26:41,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 01:26:41,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:26:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3458 proven. 339 refuted. 0 times theorem prover too weak. 22342 trivial. 0 not checked. [2022-11-22 01:26:42,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:26:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26139 backedges. 3458 proven. 360 refuted. 0 times theorem prover too weak. 22321 trivial. 0 not checked. [2022-11-22 01:26:45,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187143295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:26:45,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132375878] [2022-11-22 01:26:45,126 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-22 01:26:45,126 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:26:45,126 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2022-11-22 01:26:45,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:26:45,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 17] total 30 [2022-11-22 01:26:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215347438] [2022-11-22 01:26:45,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:26:45,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 01:26:45,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:26:45,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 01:26:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2022-11-22 01:26:45,134 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) [2022-11-22 01:26:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:26:46,326 INFO L93 Difference]: Finished difference Result 221 states and 355 transitions. [2022-11-22 01:26:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-22 01:26:46,326 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) Word has length 663 [2022-11-22 01:26:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:26:46,329 INFO L225 Difference]: With dead ends: 221 [2022-11-22 01:26:46,329 INFO L226 Difference]: Without dead ends: 131 [2022-11-22 01:26:46,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1385 GetRequests, 1317 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=841, Invalid=2941, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 01:26:46,332 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 339 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:26:46,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 156 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:26:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-22 01:26:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2022-11-22 01:26:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.05) internal successors, (84), 77 states have internal predecessors, (84), 22 states have call successors, (22), 18 states have call predecessors, (22), 9 states have return successors, (46), 16 states have call predecessors, (46), 22 states have call successors, (46) [2022-11-22 01:26:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2022-11-22 01:26:46,347 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 663 [2022-11-22 01:26:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:26:46,348 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2022-11-22 01:26:46,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 21 states have call successors, (30), 1 states have call predecessors, (30), 16 states have return successors, (45), 22 states have call predecessors, (45), 21 states have call successors, (45) [2022-11-22 01:26:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2022-11-22 01:26:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2022-11-22 01:26:46,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:26:46,352 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2022-11-22 01:26:46,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 01:26:46,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:26:46,562 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:26:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:26:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 6 times [2022-11-22 01:26:46,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:26:46,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129741706] [2022-11-22 01:26:46,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:26:46,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:26:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:26:46,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:26:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:26:46,885 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:26:46,885 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:26:46,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 01:26:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:26:46,891 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-11-22 01:26:46,898 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:26:47,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:26:47 BoogieIcfgContainer [2022-11-22 01:26:47,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:26:47,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:26:47,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:26:47,040 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:26:47,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:23" (3/4) ... [2022-11-22 01:26:47,043 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:26:47,138 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:26:47,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:26:47,139 INFO L158 Benchmark]: Toolchain (without parser) took 24542.23ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 117.3MB in the beginning and 243.2MB in the end (delta: -125.8MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,139 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 146.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:26:47,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.61ms. Allocated memory is still 146.8MB. Free memory was 117.1MB in the beginning and 107.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 146.8MB. Free memory was 107.3MB in the beginning and 105.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,141 INFO L158 Benchmark]: Boogie Preprocessor took 18.68ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 104.7MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:26:47,141 INFO L158 Benchmark]: RCFGBuilder took 309.87ms. Allocated memory is still 146.8MB. Free memory was 104.7MB in the beginning and 94.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,142 INFO L158 Benchmark]: TraceAbstraction took 23886.79ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 94.1MB in the beginning and 253.6MB in the end (delta: -159.5MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,142 INFO L158 Benchmark]: Witness Printer took 98.31ms. Allocated memory is still 373.3MB. Free memory was 253.6MB in the beginning and 243.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 01:26:47,145 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.27ms. Allocated memory is still 146.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.61ms. Allocated memory is still 146.8MB. Free memory was 117.1MB in the beginning and 107.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 146.8MB. Free memory was 107.3MB in the beginning and 105.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.68ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 104.7MB in the end (delta: 950.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.87ms. Allocated memory is still 146.8MB. Free memory was 104.7MB in the beginning and 94.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23886.79ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 94.1MB in the beginning and 253.6MB in the end (delta: -159.5MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Witness Printer took 98.31ms. Allocated memory is still 373.3MB. Free memory was 253.6MB in the beginning and 243.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 9, TraceHistogramMax: 97, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 871 mSDsluCounter, 588 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 1170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1481 IncrementalHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1170 mSolverCounterUnsat, 131 mSDtfsCounter, 1481 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3431 GetRequests, 3191 SyntacticMatches, 33 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 3718 NumberOfCodeBlocks, 3424 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 4859 ConstructedInterpolants, 0 QuantifiedInterpolants, 6827 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3099 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 129434/146661 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! [2022-11-22 01:26:47,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f0e674-e986-4230-9c87-64afd81f3bc8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE