./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7a7e948458662610557b74203cf7c9c5c696340 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:32:51,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:32:51,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:32:51,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:32:51,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:32:51,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:32:51,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:32:51,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:32:51,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:32:51,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:32:51,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:32:51,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:32:51,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:32:51,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:32:51,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:32:51,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:32:51,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:32:51,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:32:51,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:32:51,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:32:51,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:32:51,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:32:51,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:32:51,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:32:51,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:32:51,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:32:51,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:32:51,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:32:51,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:32:51,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:32:51,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:32:51,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:32:51,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:32:51,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:32:51,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:32:51,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:32:51,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:32:51,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:32:51,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:32:51,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:32:51,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:32:51,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:32:51,713 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:32:51,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:32:51,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:32:51,717 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:32:51,718 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:32:51,718 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:32:51,718 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:32:51,718 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:32:51,724 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:32:51,725 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:32:51,726 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:32:51,726 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:32:51,726 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:32:51,727 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:32:51,727 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:32:51,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:32:51,728 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:32:51,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:32:51,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:32:51,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:32:51,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:32:51,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:32:51,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:32:51,729 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:32:51,729 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:32:51,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:32:51,730 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:32:51,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:32:51,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:32:51,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:32:51,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:32:51,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:32:51,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:32:51,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:32:51,732 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:32:51,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:32:51,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:32:51,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:32:51,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:32:51,732 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_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7a7e948458662610557b74203cf7c9c5c696340 [2021-10-11 02:32:51,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:32:52,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:32:52,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:32:52,012 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:32:52,012 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:32:52,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive/Fibonacci01-1.c [2021-10-11 02:32:52,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/data/aadecec65/e59f959f3e4847b78dc85fdfcc774651/FLAG60ec9a589 [2021-10-11 02:32:52,564 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:32:52,564 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/sv-benchmarks/c/recursive/Fibonacci01-1.c [2021-10-11 02:32:52,571 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/data/aadecec65/e59f959f3e4847b78dc85fdfcc774651/FLAG60ec9a589 [2021-10-11 02:32:52,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/data/aadecec65/e59f959f3e4847b78dc85fdfcc774651 [2021-10-11 02:32:52,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:32:52,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:32:52,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:32:52,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:32:52,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:32:52,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:52" (1/1) ... [2021-10-11 02:32:52,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2a5e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:52, skipping insertion in model container [2021-10-11 02:32:52,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:52" (1/1) ... [2021-10-11 02:32:52,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:32:52,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:32:53,143 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2021-10-11 02:32:53,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:32:53,156 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:32:53,171 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2021-10-11 02:32:53,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:32:53,185 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:32:53,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53 WrapperNode [2021-10-11 02:32:53,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:32:53,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:32:53,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:32:53,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:32:53,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:32:53,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:32:53,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:32:53,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:32:53,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... [2021-10-11 02:32:53,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:32:53,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:32:53,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:32:53,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:32:53,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:32:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-10-11 02:32:53,324 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-10-11 02:32:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:32:53,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:32:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:32:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:32:53,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:32:53,714 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:32:53,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:53 BoogieIcfgContainer [2021-10-11 02:32:53,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:32:53,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:32:53,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:32:53,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:32:53,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:32:52" (1/3) ... [2021-10-11 02:32:53,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@944aaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:53, skipping insertion in model container [2021-10-11 02:32:53,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:53" (2/3) ... [2021-10-11 02:32:53,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@944aaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:53, skipping insertion in model container [2021-10-11 02:32:53,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:53" (3/3) ... [2021-10-11 02:32:53,736 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2021-10-11 02:32:53,751 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:32:53,754 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:32:53,766 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:32:53,790 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:32:53,790 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:32:53,790 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:32:53,790 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:32:53,790 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:32:53,791 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:32:53,791 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:32:53,791 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:32:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2021-10-11 02:32:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:32:53,813 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:53,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:53,815 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2021-10-11 02:32:53,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:53,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348218813] [2021-10-11 02:32:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:54,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348218813] [2021-10-11 02:32:54,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:54,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:32:54,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829528838] [2021-10-11 02:32:54,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:32:54,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:32:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:32:54,096 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2021-10-11 02:32:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:54,209 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-10-11 02:32:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:32:54,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-10-11 02:32:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:54,219 INFO L225 Difference]: With dead ends: 28 [2021-10-11 02:32:54,220 INFO L226 Difference]: Without dead ends: 18 [2021-10-11 02:32:54,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-11 02:32:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-11 02:32:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-11 02:32:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-11 02:32:54,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-10-11 02:32:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:54,270 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-11 02:32:54,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:32:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-11 02:32:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:32:54,273 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:54,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:54,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:32:54,274 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2021-10-11 02:32:54,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:54,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315506561] [2021-10-11 02:32:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:32:54,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315506561] [2021-10-11 02:32:54,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:32:54,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:32:54,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491952334] [2021-10-11 02:32:54,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:32:54,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:54,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:32:54,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:32:54,395 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 6 states. [2021-10-11 02:32:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:54,549 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-10-11 02:32:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:32:54,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-10-11 02:32:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:54,554 INFO L225 Difference]: With dead ends: 24 [2021-10-11 02:32:54,554 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 02:32:54,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:32:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 02:32:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-10-11 02:32:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-10-11 02:32:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-11 02:32:54,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-10-11 02:32:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:54,568 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-11 02:32:54,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:32:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-11 02:32:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:32:54,570 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:54,571 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:54,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:32:54,571 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2021-10-11 02:32:54,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:54,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529152292] [2021-10-11 02:32:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:32:54,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529152292] [2021-10-11 02:32:54,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299463846] [2021-10-11 02:32:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:54,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-11 02:32:54,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:32:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:32:55,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:32:55,509 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:32:55,541 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:32:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:32:55,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848827925] [2021-10-11 02:32:55,617 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:32:55,617 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:32:55,623 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:32:55,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:32:55,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2021-10-11 02:32:55,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940829133] [2021-10-11 02:32:55,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-10-11 02:32:55,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-11 02:32:55,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:32:55,629 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 20 states. [2021-10-11 02:32:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:55,858 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-10-11 02:32:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:32:55,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2021-10-11 02:32:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:55,860 INFO L225 Difference]: With dead ends: 35 [2021-10-11 02:32:55,860 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 02:32:55,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:32:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 02:32:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 02:32:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 02:32:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-10-11 02:32:55,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-10-11 02:32:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:55,868 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-11 02:32:55,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-10-11 02:32:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-10-11 02:32:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:32:55,870 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:55,870 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:56,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:32:56,086 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 592483530, now seen corresponding path program 1 times [2021-10-11 02:32:56,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:56,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971710538] [2021-10-11 02:32:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:32:56,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971710538] [2021-10-11 02:32:56,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794282715] [2021-10-11 02:32:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:56,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-11 02:32:56,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:32:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 02:32:56,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:32:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:32:56,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [67919725] [2021-10-11 02:32:56,913 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:32:56,913 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:32:56,914 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:32:56,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:32:56,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2021-10-11 02:32:56,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978575748] [2021-10-11 02:32:56,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:32:56,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:32:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:32:56,918 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 21 states. [2021-10-11 02:32:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:57,208 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-10-11 02:32:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:32:57,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2021-10-11 02:32:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:57,215 INFO L225 Difference]: With dead ends: 31 [2021-10-11 02:32:57,216 INFO L226 Difference]: Without dead ends: 27 [2021-10-11 02:32:57,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:32:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-10-11 02:32:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-10-11 02:32:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-11 02:32:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-10-11 02:32:57,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2021-10-11 02:32:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:57,235 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-10-11 02:32:57,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:32:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-10-11 02:32:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:32:57,239 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:57,239 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:57,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:57,457 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1310194259, now seen corresponding path program 2 times [2021-10-11 02:32:57,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:57,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150607117] [2021-10-11 02:32:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:32:57,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150607117] [2021-10-11 02:32:57,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582480561] [2021-10-11 02:32:57,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:57,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:32:57,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:32:57,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-11 02:32:57,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:32:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-11 02:32:57,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:32:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-11 02:32:58,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1978160835] [2021-10-11 02:32:58,753 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:32:58,753 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:32:58,754 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:32:58,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:32:58,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 27 [2021-10-11 02:32:58,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141958764] [2021-10-11 02:32:58,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-10-11 02:32:58,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:32:58,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-11 02:32:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:32:58,760 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 27 states. [2021-10-11 02:32:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:32:59,487 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2021-10-11 02:32:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-11 02:32:59,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2021-10-11 02:32:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:32:59,491 INFO L225 Difference]: With dead ends: 53 [2021-10-11 02:32:59,492 INFO L226 Difference]: Without dead ends: 31 [2021-10-11 02:32:59,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2021-10-11 02:32:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-10-11 02:32:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-10-11 02:32:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-10-11 02:32:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-10-11 02:32:59,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 37 [2021-10-11 02:32:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:32:59,501 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-10-11 02:32:59,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-10-11 02:32:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-10-11 02:32:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-11 02:32:59,503 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:32:59,503 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:32:59,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:59,718 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:32:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:32:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 651238953, now seen corresponding path program 3 times [2021-10-11 02:32:59,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:32:59,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974445062] [2021-10-11 02:32:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:32:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:32:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:32:59,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974445062] [2021-10-11 02:32:59,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221832594] [2021-10-11 02:32:59,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:32:59,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:32:59,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:32:59,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 02:32:59,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-11 02:33:00,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-11 02:33:01,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069450607] [2021-10-11 02:33:01,119 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:33:01,120 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:01,120 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:33:01,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:01,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 29 [2021-10-11 02:33:01,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627328768] [2021-10-11 02:33:01,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-10-11 02:33:01,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-10-11 02:33:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:33:01,124 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 29 states. [2021-10-11 02:33:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:01,853 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2021-10-11 02:33:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-11 02:33:01,854 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2021-10-11 02:33:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:01,857 INFO L225 Difference]: With dead ends: 53 [2021-10-11 02:33:01,857 INFO L226 Difference]: Without dead ends: 47 [2021-10-11 02:33:01,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1650, Unknown=0, NotChecked=0, Total=1980 [2021-10-11 02:33:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-10-11 02:33:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2021-10-11 02:33:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:33:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2021-10-11 02:33:01,872 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 38 [2021-10-11 02:33:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:01,873 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2021-10-11 02:33:01,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-10-11 02:33:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2021-10-11 02:33:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-11 02:33:01,879 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:01,879 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:02,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:02,080 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1360547340, now seen corresponding path program 4 times [2021-10-11 02:33:02,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:02,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368532060] [2021-10-11 02:33:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 55 proven. 93 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-10-11 02:33:02,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368532060] [2021-10-11 02:33:02,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433412191] [2021-10-11 02:33:02,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:02,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:33:02,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 72 proven. 104 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-10-11 02:33:02,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 72 proven. 107 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2021-10-11 02:33:03,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532960831] [2021-10-11 02:33:03,067 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:33:03,068 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:03,068 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:33:03,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:03,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 16 [2021-10-11 02:33:03,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7511492] [2021-10-11 02:33:03,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-10-11 02:33:03,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-11 02:33:03,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-11 02:33:03,073 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 16 states. [2021-10-11 02:33:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:03,336 INFO L93 Difference]: Finished difference Result 78 states and 142 transitions. [2021-10-11 02:33:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:33:03,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2021-10-11 02:33:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:03,338 INFO L225 Difference]: With dead ends: 78 [2021-10-11 02:33:03,340 INFO L226 Difference]: Without dead ends: 46 [2021-10-11 02:33:03,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:33:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-10-11 02:33:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2021-10-11 02:33:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-10-11 02:33:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2021-10-11 02:33:03,353 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 79 [2021-10-11 02:33:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:03,353 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-10-11 02:33:03,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-10-11 02:33:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2021-10-11 02:33:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-11 02:33:03,357 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:03,357 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:03,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:33:03,582 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1581298675, now seen corresponding path program 5 times [2021-10-11 02:33:03,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:03,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261200736] [2021-10-11 02:33:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-10-11 02:33:03,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261200736] [2021-10-11 02:33:03,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903415393] [2021-10-11 02:33:03,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:03,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-11 02:33:03,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:03,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:33:03,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2021-10-11 02:33:04,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-10-11 02:33:04,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2126267167] [2021-10-11 02:33:04,655 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:33:04,656 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:04,656 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:33:04,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:04,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 18 [2021-10-11 02:33:04,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247383213] [2021-10-11 02:33:04,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-10-11 02:33:04,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-11 02:33:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:33:04,660 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand 18 states. [2021-10-11 02:33:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:05,171 INFO L93 Difference]: Finished difference Result 97 states and 152 transitions. [2021-10-11 02:33:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 02:33:05,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2021-10-11 02:33:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:05,177 INFO L225 Difference]: With dead ends: 97 [2021-10-11 02:33:05,177 INFO L226 Difference]: Without dead ends: 60 [2021-10-11 02:33:05,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:33:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-11 02:33:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2021-10-11 02:33:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-10-11 02:33:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2021-10-11 02:33:05,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 93 [2021-10-11 02:33:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:05,213 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2021-10-11 02:33:05,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-10-11 02:33:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2021-10-11 02:33:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-10-11 02:33:05,223 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:05,223 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:05,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:05,438 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:05,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:05,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1101187310, now seen corresponding path program 6 times [2021-10-11 02:33:05,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:05,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264254965] [2021-10-11 02:33:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 181 proven. 305 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2021-10-11 02:33:05,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264254965] [2021-10-11 02:33:05,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066906124] [2021-10-11 02:33:05,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:05,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:33:05,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:33:05,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-11 02:33:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2021-10-11 02:33:05,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2021-10-11 02:33:07,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [13372809] [2021-10-11 02:33:07,570 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:33:07,571 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:07,571 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:33:07,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:07,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2021-10-11 02:33:07,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665131152] [2021-10-11 02:33:07,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-10-11 02:33:07,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:07,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-11 02:33:07,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:33:07,573 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 24 states. [2021-10-11 02:33:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:08,119 INFO L93 Difference]: Finished difference Result 121 states and 179 transitions. [2021-10-11 02:33:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-11 02:33:08,120 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2021-10-11 02:33:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:08,121 INFO L225 Difference]: With dead ends: 121 [2021-10-11 02:33:08,122 INFO L226 Difference]: Without dead ends: 75 [2021-10-11 02:33:08,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2021-10-11 02:33:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-10-11 02:33:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2021-10-11 02:33:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:33:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2021-10-11 02:33:08,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 133 [2021-10-11 02:33:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:08,134 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2021-10-11 02:33:08,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-10-11 02:33:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2021-10-11 02:33:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-11 02:33:08,137 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:33:08,137 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:33:08,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:08,350 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:33:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:33:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1526876107, now seen corresponding path program 7 times [2021-10-11 02:33:08,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:33:08,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106420233] [2021-10-11 02:33:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:33:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 77 proven. 845 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2021-10-11 02:33:08,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106420233] [2021-10-11 02:33:08,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247599684] [2021-10-11 02:33:08,834 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:33:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:33:08,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 65 conjunts are in the unsatisfiable core [2021-10-11 02:33:08,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:33:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 258 proven. 604 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2021-10-11 02:33:09,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:33:10,843 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:33:10,964 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:33:11,092 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-10-11 02:33:11,227 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-10-11 02:33:11,914 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2021-10-11 02:33:12,165 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2021-10-11 02:33:12,511 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-10-11 02:33:12,785 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-10-11 02:33:14,800 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:33:14,932 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-10-11 02:33:15,073 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-10-11 02:33:15,198 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-10-11 02:33:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 207 proven. 695 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2021-10-11 02:33:17,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [294002329] [2021-10-11 02:33:17,346 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-10-11 02:33:17,346 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:33:17,347 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:33:17,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:33:17,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 35] total 65 [2021-10-11 02:33:17,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726312971] [2021-10-11 02:33:17,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-10-11 02:33:17,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:33:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-10-11 02:33:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3737, Unknown=0, NotChecked=0, Total=4160 [2021-10-11 02:33:17,352 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 65 states. [2021-10-11 02:33:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:33:19,072 INFO L93 Difference]: Finished difference Result 106 states and 173 transitions. [2021-10-11 02:33:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-11 02:33:19,073 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 174 [2021-10-11 02:33:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:33:19,074 INFO L225 Difference]: With dead ends: 106 [2021-10-11 02:33:19,074 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:33:19,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1106, Invalid=8206, Unknown=0, NotChecked=0, Total=9312 [2021-10-11 02:33:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:33:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:33:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:33:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:33:19,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2021-10-11 02:33:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:33:19,079 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:33:19,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2021-10-11 02:33:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:33:19,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:33:19,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:33:19,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:33:19,767 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-10-11 02:33:19,810 INFO L262 CegarLoopResult]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2021-10-11 02:33:19,810 INFO L265 CegarLoopResult]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2021-10-11 02:33:19,810 INFO L258 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (< 1 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2021-10-11 02:33:19,812 INFO L262 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2021-10-11 02:33:19,812 INFO L258 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse2 (= |fibonacci_#t~ret7| 1)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse0 (<= 4 fibonacci_~n)) (.cse1 (<= fibonacci_~n |fibonacci_#in~n|))) (or (and .cse0 (<= |fibonacci_#in~n| 4) .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 2))) (and (<= 3 fibonacci_~n) (<= |fibonacci_#in~n| 3) .cse2 .cse1) (and (<= |fibonacci_#in~n| 2) .cse2 (< 1 fibonacci_~n) .cse1) (and .cse3 .cse0 (<= 3 |fibonacci_#t~ret7|) (<= |fibonacci_#in~n| 5) .cse1) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret7| 1)) .cse3 .cse0 .cse1))) [2021-10-11 02:33:19,812 INFO L262 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2021-10-11 02:33:19,812 INFO L262 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point L33(lines 33 37) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L265 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:33:19,813 INFO L262 CegarLoopResult]: For program point L29(lines 29 31) no Hoare annotation was computed. [2021-10-11 02:33:19,814 INFO L265 CegarLoopResult]: At program point L27(lines 27 38) the Hoare annotation is: true [2021-10-11 02:33:19,814 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2021-10-11 02:33:19,814 INFO L262 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2021-10-11 02:33:19,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:33:19 BoogieIcfgContainer [2021-10-11 02:33:19,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:33:19,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:33:19,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:33:19,823 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:33:19,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:53" (3/4) ... [2021-10-11 02:33:19,827 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:33:19,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2021-10-11 02:33:19,837 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:33:19,837 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:33:19,837 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:33:19,837 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:33:19,869 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc3c6e61-11df-4f6c-9794-7c41547ddb50/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:33:19,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:33:19,871 INFO L168 Benchmark]: Toolchain (without parser) took 26920.29 ms. Allocated memory was 123.7 MB in the beginning and 314.6 MB in the end (delta: 190.8 MB). Free memory was 90.6 MB in the beginning and 255.4 MB in the end (delta: -164.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,871 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 83.9 MB. Free memory was 40.8 MB in the beginning and 40.7 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:33:19,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.24 ms. Allocated memory is still 123.7 MB. Free memory was 90.6 MB in the beginning and 99.8 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.22 ms. Allocated memory is still 123.7 MB. Free memory was 99.4 MB in the beginning and 98.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,872 INFO L168 Benchmark]: Boogie Preprocessor took 19.26 ms. Allocated memory is still 123.7 MB. Free memory was 98.3 MB in the beginning and 97.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:33:19,873 INFO L168 Benchmark]: RCFGBuilder took 487.72 ms. Allocated memory is still 123.7 MB. Free memory was 97.2 MB in the beginning and 83.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,873 INFO L168 Benchmark]: TraceAbstraction took 26093.45 ms. Allocated memory was 123.7 MB in the beginning and 314.6 MB in the end (delta: 190.8 MB). Free memory was 83.0 MB in the beginning and 257.5 MB in the end (delta: -174.4 MB). Peak memory consumption was 173.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,874 INFO L168 Benchmark]: Witness Printer took 47.17 ms. Allocated memory is still 314.6 MB. Free memory was 257.5 MB in the beginning and 255.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:33:19,876 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 83.9 MB. Free memory was 40.8 MB in the beginning and 40.7 MB in the end (delta: 40.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 224.24 ms. Allocated memory is still 123.7 MB. Free memory was 90.6 MB in the beginning and 99.8 MB in the end (delta: -9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.22 ms. Allocated memory is still 123.7 MB. Free memory was 99.4 MB in the beginning and 98.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.26 ms. Allocated memory is still 123.7 MB. Free memory was 98.3 MB in the beginning and 97.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 487.72 ms. Allocated memory is still 123.7 MB. Free memory was 97.2 MB in the beginning and 83.4 MB in the end (delta: 13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26093.45 ms. Allocated memory was 123.7 MB in the beginning and 314.6 MB in the end (delta: 190.8 MB). Free memory was 83.0 MB in the beginning and 257.5 MB in the end (delta: -174.4 MB). Peak memory consumption was 173.2 MB. Max. memory is 16.1 GB. * Witness Printer took 47.17 ms. Allocated memory is still 314.6 MB. Free memory was 257.5 MB in the beginning and 255.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.5s, OverallIterations: 10, TraceHistogramMax: 25, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 154 SDtfs, 533 SDslu, 883 SDs, 0 SdLazy, 3006 SolverSat, 812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 1128 SyntacticMatches, 8 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4545 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, 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, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 113 PreInvPairs, 187 NumberOfFragments, 86 HoareAnnotationTreeSize, 113 FomulaSimplifications, 708 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 884 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1223 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1798 ConstructedInterpolants, 0 QuantifiedInterpolants, 506805 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1397 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 6427/10296 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 correct! Received shutdown request...