./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG --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 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:47:23,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:47:23,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:47:23,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:47:23,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:47:23,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:47:23,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:47:23,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:47:23,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:47:23,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:47:23,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:47:23,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:47:23,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:47:23,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:47:23,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:47:23,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:47:23,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:47:23,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:47:23,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:47:23,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:47:23,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:47:23,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:47:23,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:47:23,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:47:23,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:47:23,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:47:23,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:47:23,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:47:23,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:47:23,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:47:23,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:47:23,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:47:23,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:47:23,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:47:23,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:47:23,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:47:23,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:47:23,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:47:23,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:47:23,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:47:23,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:47:23,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:47:23,568 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:47:23,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:47:23,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:47:23,570 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:47:23,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:47:23,570 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:47:23,570 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:47:23,570 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:47:23,571 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:47:23,571 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:47:23,571 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:47:23,571 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:47:23,571 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:47:23,572 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:47:23,572 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:47:23,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:47:23,573 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:47:23,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:47:23,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:47:23,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:47:23,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:47:23,575 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:47:23,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:47:23,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:47:23,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:47:23,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:47:23,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:47:23,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:47:23,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:47:23,576 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:47:23,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:47:23,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:47:23,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:47:23,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:47:23,577 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/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_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG 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 -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2021-10-29 05:47:23,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:47:23,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:47:23,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:47:23,942 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:47:23,943 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:47:23,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-10-29 05:47:24,007 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/data/a3a07eecf/32250a28531a4d44b7c49ccb7a315347/FLAGae74c3daa [2021-10-29 05:47:24,492 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:47:24,493 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-10-29 05:47:24,504 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/data/a3a07eecf/32250a28531a4d44b7c49ccb7a315347/FLAGae74c3daa [2021-10-29 05:47:24,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/data/a3a07eecf/32250a28531a4d44b7c49ccb7a315347 [2021-10-29 05:47:24,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:47:24,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:47:24,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:47:24,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:47:24,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:47:24,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:47:24" (1/1) ... [2021-10-29 05:47:24,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18684555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:24, skipping insertion in model container [2021-10-29 05:47:24,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:47:24" (1/1) ... [2021-10-29 05:47:24,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:47:24,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:47:25,095 WARN L228 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_7935d825-e428-4fee-82ba-e2e415d5ecb8/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-10-29 05:47:25,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:47:25,125 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:47:25,145 WARN L228 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_7935d825-e428-4fee-82ba-e2e415d5ecb8/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-10-29 05:47:25,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:47:25,159 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:47:25,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25 WrapperNode [2021-10-29 05:47:25,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:47:25,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:47:25,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:47:25,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:47:25,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:47:25,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:47:25,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:47:25,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:47:25,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:47:25,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:47:25,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:47:25,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:47:25,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (1/1) ... [2021-10-29 05:47:25,238 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:47:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:25,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:47:25,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:47:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:47:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:47:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:47:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:47:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-29 05:47:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-29 05:47:25,630 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:47:25,631 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-29 05:47:25,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:47:25 BoogieIcfgContainer [2021-10-29 05:47:25,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:47:25,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:47:25,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:47:25,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:47:25,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:47:24" (1/3) ... [2021-10-29 05:47:25,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ff22c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:47:25, skipping insertion in model container [2021-10-29 05:47:25,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:47:25" (2/3) ... [2021-10-29 05:47:25,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ff22c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:47:25, skipping insertion in model container [2021-10-29 05:47:25,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:47:25" (3/3) ... [2021-10-29 05:47:25,647 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2021-10-29 05:47:25,653 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:47:25,653 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 05:47:25,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:47:25,728 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:47:25,728 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 05:47:25,747 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) [2021-10-29 05:47:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:47:25,754 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:25,754 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:25,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:25,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1688587911, now seen corresponding path program 1 times [2021-10-29 05:47:25,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:25,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652549284] [2021-10-29 05:47:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:25,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:47:26,052 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:26,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652549284] [2021-10-29 05:47:26,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652549284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:47:26,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:47:26,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:47:26,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296309932] [2021-10-29 05:47:26,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:47:26,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:26,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:47:26,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:47:26,112 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), 4 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) [2021-10-29 05:47:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:26,172 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-10-29 05:47:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:47:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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 [2021-10-29 05:47:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:26,182 INFO L225 Difference]: With dead ends: 27 [2021-10-29 05:47:26,183 INFO L226 Difference]: Without dead ends: 17 [2021-10-29 05:47:26,186 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:47:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-29 05:47:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-29 05:47:26,227 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) [2021-10-29 05:47:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-29 05:47:26,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-29 05:47:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:26,232 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-29 05:47:26,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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) [2021-10-29 05:47:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-29 05:47:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:47:26,234 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:26,235 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:26,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:47:26,235 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1521360425, now seen corresponding path program 1 times [2021-10-29 05:47:26,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:26,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069176280] [2021-10-29 05:47:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:26,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:47:26,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:26,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069176280] [2021-10-29 05:47:26,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069176280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:47:26,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:47:26,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:47:26,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776553080] [2021-10-29 05:47:26,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:47:26,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:47:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:47:26,321 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), 4 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) [2021-10-29 05:47:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:26,355 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-29 05:47:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:47:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2021-10-29 05:47:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:26,360 INFO L225 Difference]: With dead ends: 23 [2021-10-29 05:47:26,360 INFO L226 Difference]: Without dead ends: 19 [2021-10-29 05:47:26,361 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:47:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-29 05:47:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-29 05:47:26,372 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) [2021-10-29 05:47:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-29 05:47:26,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-29 05:47:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:26,374 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-29 05:47:26,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-10-29 05:47:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-29 05:47:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:47:26,376 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:26,376 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:26,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:47:26,378 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1124411740, now seen corresponding path program 1 times [2021-10-29 05:47:26,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:26,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197971545] [2021-10-29 05:47:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:26,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:47:26,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:26,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197971545] [2021-10-29 05:47:26,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197971545] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:26,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219335788] [2021-10-29 05:47:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:26,519 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:26,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:26,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:26,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 05:47:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:26,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:47:26,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:47:26,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 05:47:27,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219335788] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:27,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1734836756] [2021-10-29 05:47:27,176 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:27,176 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:27,186 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:27,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:27,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-10-29 05:47:27,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66925814] [2021-10-29 05:47:27,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 05:47:27,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 05:47:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:47:27,191 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-29 05:47:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:27,307 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-29 05:47:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:47:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2021-10-29 05:47:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:27,311 INFO L225 Difference]: With dead ends: 34 [2021-10-29 05:47:27,311 INFO L226 Difference]: Without dead ends: 19 [2021-10-29 05:47:27,314 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-29 05:47:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-29 05:47:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-29 05:47:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-29 05:47:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-29 05:47:27,325 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-10-29 05:47:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:27,326 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-29 05:47:27,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-29 05:47:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-10-29 05:47:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:47:27,328 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:27,328 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:27,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:27,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-29 05:47:27,539 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 992661418, now seen corresponding path program 1 times [2021-10-29 05:47:27,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:27,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186821467] [2021-10-29 05:47:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:27,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:47:27,641 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:27,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186821467] [2021-10-29 05:47:27,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186821467] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:27,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562462919] [2021-10-29 05:47:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:27,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:27,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:27,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 05:47:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:47:27,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:47:27,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 05:47:28,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562462919] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:28,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [405965259] [2021-10-29 05:47:28,017 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:28,017 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:28,018 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:28,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:28,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-29 05:47:28,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388930505] [2021-10-29 05:47:28,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 05:47:28,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 05:47:28,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:47:28,022 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-29 05:47:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:28,079 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-10-29 05:47:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:47:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2021-10-29 05:47:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:28,081 INFO L225 Difference]: With dead ends: 28 [2021-10-29 05:47:28,082 INFO L226 Difference]: Without dead ends: 24 [2021-10-29 05:47:28,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:47:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-29 05:47:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-29 05:47:28,088 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) [2021-10-29 05:47:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-29 05:47:28,090 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-10-29 05:47:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:28,090 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-29 05:47:28,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-29 05:47:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-29 05:47:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:47:28,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:28,093 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:28,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:28,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:28,297 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1950959585, now seen corresponding path program 2 times [2021-10-29 05:47:28,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:28,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624891001] [2021-10-29 05:47:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:28,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 05:47:28,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:28,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624891001] [2021-10-29 05:47:28,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624891001] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:28,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571935641] [2021-10-29 05:47:28,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:47:28,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:28,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:28,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 05:47:28,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-29 05:47:28,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:47:28,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:47:28,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 05:47:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:47:29,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571935641] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:29,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316788612] [2021-10-29 05:47:29,159 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:29,160 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:29,160 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:29,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:29,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-10-29 05:47:29,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053082233] [2021-10-29 05:47:29,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-29 05:47:29,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:29,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-29 05:47:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:47:29,164 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-29 05:47:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:29,378 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-10-29 05:47:29,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:47:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 36 [2021-10-29 05:47:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:29,380 INFO L225 Difference]: With dead ends: 55 [2021-10-29 05:47:29,381 INFO L226 Difference]: Without dead ends: 33 [2021-10-29 05:47:29,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-29 05:47:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-29 05:47:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-10-29 05:47:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-10-29 05:47:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-10-29 05:47:29,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-10-29 05:47:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:29,391 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-10-29 05:47:29,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-29 05:47:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-10-29 05:47:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 05:47:29,393 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:29,393 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:29,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:29,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:29,605 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1865467761, now seen corresponding path program 3 times [2021-10-29 05:47:29,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:29,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149610177] [2021-10-29 05:47:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:29,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:47:29,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:29,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149610177] [2021-10-29 05:47:29,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149610177] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:29,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014253907] [2021-10-29 05:47:29,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:47:29,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:29,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:29,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:29,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 05:47:29,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:47:29,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:47:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:47:29,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:47:29,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 05:47:30,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014253907] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:30,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1189727834] [2021-10-29 05:47:30,366 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:30,366 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:30,366 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:30,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:30,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-29 05:47:30,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881871692] [2021-10-29 05:47:30,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 05:47:30,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:30,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 05:47:30,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:47:30,370 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2021-10-29 05:47:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:30,468 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-10-29 05:47:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:47:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2021-10-29 05:47:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:30,470 INFO L225 Difference]: With dead ends: 36 [2021-10-29 05:47:30,471 INFO L226 Difference]: Without dead ends: 32 [2021-10-29 05:47:30,471 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:47:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-29 05:47:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-29 05:47:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2021-10-29 05:47:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-10-29 05:47:30,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-10-29 05:47:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:30,481 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-10-29 05:47:30,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2021-10-29 05:47:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-10-29 05:47:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-29 05:47:30,485 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:30,485 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:30,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:30,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:30,697 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1351422375, now seen corresponding path program 4 times [2021-10-29 05:47:30,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:30,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273023349] [2021-10-29 05:47:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:30,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-10-29 05:47:30,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:30,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273023349] [2021-10-29 05:47:30,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273023349] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:30,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857209814] [2021-10-29 05:47:30,830 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:47:30,830 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:30,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:30,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:30,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-29 05:47:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:30,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-29 05:47:30,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-10-29 05:47:31,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-29 05:47:31,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857209814] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:31,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1691293941] [2021-10-29 05:47:31,806 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:31,806 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:31,806 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:31,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:31,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-29 05:47:31,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481854316] [2021-10-29 05:47:31,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 05:47:31,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 05:47:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:47:31,810 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2021-10-29 05:47:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:31,930 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-10-29 05:47:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:47:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 64 [2021-10-29 05:47:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:31,933 INFO L225 Difference]: With dead ends: 41 [2021-10-29 05:47:31,933 INFO L226 Difference]: Without dead ends: 37 [2021-10-29 05:47:31,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:47:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-29 05:47:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-29 05:47:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2021-10-29 05:47:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-10-29 05:47:31,943 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2021-10-29 05:47:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:31,943 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-10-29 05:47:31,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2021-10-29 05:47:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-10-29 05:47:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-10-29 05:47:31,949 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:31,950 INFO L513 BasicCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:31,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:32,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-29 05:47:32,173 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1437906103, now seen corresponding path program 5 times [2021-10-29 05:47:32,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:32,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908405645] [2021-10-29 05:47:32,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:32,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2021-10-29 05:47:32,466 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:32,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908405645] [2021-10-29 05:47:32,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908405645] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:32,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355944134] [2021-10-29 05:47:32,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:47:32,467 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:32,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:32,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-29 05:47:32,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-29 05:47:32,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:47:32,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:47:32,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2021-10-29 05:47:33,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2021-10-29 05:47:34,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355944134] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:34,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1091306722] [2021-10-29 05:47:34,348 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:34,349 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:34,350 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:34,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:34,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2021-10-29 05:47:34,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775733796] [2021-10-29 05:47:34,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-29 05:47:34,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-29 05:47:34,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-29 05:47:34,356 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-29 05:47:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:34,758 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2021-10-29 05:47:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-29 05:47:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 202 [2021-10-29 05:47:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:34,762 INFO L225 Difference]: With dead ends: 94 [2021-10-29 05:47:34,762 INFO L226 Difference]: Without dead ends: 58 [2021-10-29 05:47:34,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2021-10-29 05:47:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-10-29 05:47:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-10-29 05:47:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2021-10-29 05:47:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2021-10-29 05:47:34,776 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 202 [2021-10-29 05:47:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:34,776 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2021-10-29 05:47:34,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-29 05:47:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2021-10-29 05:47:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 05:47:34,780 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:34,780 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:34,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-29 05:47:34,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:34,993 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1858393177, now seen corresponding path program 6 times [2021-10-29 05:47:34,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:34,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595259567] [2021-10-29 05:47:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:34,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:47:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-29 05:47:35,154 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:47:35,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595259567] [2021-10-29 05:47:35,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595259567] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:47:35,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888490414] [2021-10-29 05:47:35,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:47:35,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:47:35,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:47:35,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:47:35,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-29 05:47:35,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:47:35,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:47:35,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 05:47:35,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:47:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-29 05:47:35,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:47:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-10-29 05:47:37,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888490414] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:47:37,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144979734] [2021-10-29 05:47:37,623 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:47:37,623 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:47:37,624 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-29 05:47:37,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:47:37,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2021-10-29 05:47:37,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209396457] [2021-10-29 05:47:37,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-29 05:47:37,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:47:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-29 05:47:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-10-29 05:47:37,628 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2021-10-29 05:47:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:47:37,846 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2021-10-29 05:47:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 05:47:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 173 [2021-10-29 05:47:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:47:37,849 INFO L225 Difference]: With dead ends: 67 [2021-10-29 05:47:37,850 INFO L226 Difference]: Without dead ends: 63 [2021-10-29 05:47:37,851 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2021-10-29 05:47:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-29 05:47:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-29 05:47:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2021-10-29 05:47:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2021-10-29 05:47:37,863 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2021-10-29 05:47:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:47:37,864 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2021-10-29 05:47:37,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2021-10-29 05:47:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2021-10-29 05:47:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-10-29 05:47:37,870 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:47:37,871 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2021-10-29 05:47:37,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-10-29 05:47:38,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-29 05:47:38,085 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:47:38,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:47:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1234663993, now seen corresponding path program 7 times [2021-10-29 05:47:38,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:47:38,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537728519] [2021-10-29 05:47:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:47:38,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:47:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:47:38,225 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:47:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:47:38,391 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:47:38,391 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:47:38,392 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:47:38,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:47:38,399 INFO L731 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2021-10-29 05:47:38,403 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:47:38,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:47:38 BoogieIcfgContainer [2021-10-29 05:47:38,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:47:38,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:47:38,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:47:38,570 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:47:38,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:47:25" (3/4) ... [2021-10-29 05:47:38,573 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:47:38,724 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:47:38,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:47:38,726 INFO L168 Benchmark]: Toolchain (without parser) took 13855.06 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 68.9 MB in the beginning and 94.1 MB in the end (delta: -25.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,726 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 111.1 MB. Free memory is still 84.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:47:38,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.27 ms. Allocated memory is still 111.1 MB. Free memory was 68.7 MB in the beginning and 85.6 MB in the end (delta: -16.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.13 ms. Allocated memory is still 111.1 MB. Free memory was 85.3 MB in the beginning and 84.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,728 INFO L168 Benchmark]: Boogie Preprocessor took 33.70 ms. Allocated memory is still 111.1 MB. Free memory was 84.1 MB in the beginning and 83.2 MB in the end (delta: 919.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:47:38,729 INFO L168 Benchmark]: RCFGBuilder took 406.72 ms. Allocated memory is still 111.1 MB. Free memory was 83.2 MB in the beginning and 73.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,729 INFO L168 Benchmark]: TraceAbstraction took 12934.05 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 72.7 MB in the beginning and 105.7 MB in the end (delta: -33.0 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,730 INFO L168 Benchmark]: Witness Printer took 154.50 ms. Allocated memory is still 180.4 MB. Free memory was 105.7 MB in the beginning and 94.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:47:38,732 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.27 ms. Allocated memory is still 111.1 MB. Free memory is still 84.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 288.27 ms. Allocated memory is still 111.1 MB. Free memory was 68.7 MB in the beginning and 85.6 MB in the end (delta: -16.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.13 ms. Allocated memory is still 111.1 MB. Free memory was 85.3 MB in the beginning and 84.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.70 ms. Allocated memory is still 111.1 MB. Free memory was 84.1 MB in the beginning and 83.2 MB in the end (delta: 919.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 406.72 ms. Allocated memory is still 111.1 MB. Free memory was 83.2 MB in the beginning and 73.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12934.05 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 72.7 MB in the beginning and 105.7 MB in the end (delta: -33.0 MB). Peak memory consumption was 38.8 MB. Max. memory is 16.1 GB. * Witness Printer took 154.50 ms. Allocated memory is still 180.4 MB. Free memory was 105.7 MB in the beginning and 94.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 10, TraceHistogramMax: 41, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 130 SDtfs, 377 SDslu, 403 SDs, 0 SdLazy, 608 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 1095 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=9, InterpolantAutomatonStates: 82, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1415 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1667 ConstructedInterpolants, 0 QuantifiedInterpolants, 2873 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 10084/12759 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! [2021-10-29 05:47:38,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7935d825-e428-4fee-82ba-e2e415d5ecb8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...