./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_10x0-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_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_10x0-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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_df279d35-8c89-428c-9240-2c5cc0821be2/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 16786fbfd9e08d661e858a737a2ecf42d2b8dbac ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:27:09,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:27:09,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:27:09,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:27:09,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:27:09,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:27:09,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:27:09,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:27:09,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:27:09,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:27:09,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:27:09,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:27:09,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:27:09,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:27:09,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:27:09,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:27:09,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:27:09,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:27:09,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:27:09,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:27:09,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:27:09,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:27:09,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:27:09,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:27:09,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:27:09,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:27:09,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:27:09,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:27:09,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:27:09,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:27:09,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:27:09,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:27:09,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:27:09,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:27:09,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:27:09,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:27:09,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:27:09,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:27:09,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:27:09,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:27:09,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:27:09,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:27:09,752 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:27:09,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:27:09,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:27:09,757 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:27:09,757 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:27:09,758 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:27:09,758 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:27:09,758 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:27:09,758 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:27:09,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:27:09,767 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:27:09,767 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:27:09,768 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:27:09,768 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:27:09,768 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:27:09,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:27:09,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:27:09,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:27:09,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:27:09,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:27:09,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:27:09,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:27:09,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:27:09,771 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:27:09,771 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:27:09,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:27:09,772 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:27:09,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:27:09,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:27:09,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:27:09,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:27:09,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:27:09,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:27:09,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:27:09,778 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:27:09,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:27:09,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:27:09,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:27:09,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:27:09,779 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_df279d35-8c89-428c-9240-2c5cc0821be2/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_df279d35-8c89-428c-9240-2c5cc0821be2/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 -> 16786fbfd9e08d661e858a737a2ecf42d2b8dbac [2021-10-11 02:27:10,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:27:10,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:27:10,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:27:10,090 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:27:10,091 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:27:10,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2021-10-11 02:27:10,201 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/data/526a049b5/f35d70af31b947ffa8d31f00cdfa800f/FLAG71ac2d4f4 [2021-10-11 02:27:10,677 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:27:10,680 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2021-10-11 02:27:10,687 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/data/526a049b5/f35d70af31b947ffa8d31f00cdfa800f/FLAG71ac2d4f4 [2021-10-11 02:27:11,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/data/526a049b5/f35d70af31b947ffa8d31f00cdfa800f [2021-10-11 02:27:11,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:27:11,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:27:11,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:11,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:27:11,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:27:11,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62365ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11, skipping insertion in model container [2021-10-11 02:27:11,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:27:11,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:27:11,269 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_df279d35-8c89-428c-9240-2c5cc0821be2/sv-benchmarks/c/recursive-simple/sum_10x0-1.c[481,494] [2021-10-11 02:27:11,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:11,282 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:27:11,296 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_df279d35-8c89-428c-9240-2c5cc0821be2/sv-benchmarks/c/recursive-simple/sum_10x0-1.c[481,494] [2021-10-11 02:27:11,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:27:11,308 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:27:11,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11 WrapperNode [2021-10-11 02:27:11,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:27:11,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:11,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:27:11,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:27:11,317 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:27:11" (1/1) ... [2021-10-11 02:27:11,322 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:27:11" (1/1) ... [2021-10-11 02:27:11,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:27:11,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:27:11,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:27:11,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:27:11,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... [2021-10-11 02:27:11,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:27:11,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:27:11,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:27:11,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:27:11,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:27:11,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:27:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2021-10-11 02:27:11,418 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2021-10-11 02:27:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:27:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:27:11,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:27:11,668 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:27:11,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:11 BoogieIcfgContainer [2021-10-11 02:27:11,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:27:11,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:27:11,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:27:11,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:27:11,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:27:11" (1/3) ... [2021-10-11 02:27:11,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4891373e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:11, skipping insertion in model container [2021-10-11 02:27:11,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:27:11" (2/3) ... [2021-10-11 02:27:11,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4891373e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:27:11, skipping insertion in model container [2021-10-11 02:27:11,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:11" (3/3) ... [2021-10-11 02:27:11,692 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2021-10-11 02:27:11,707 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:27:11,717 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:27:11,729 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:27:11,773 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:27:11,785 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:27:11,785 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:27:11,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:27:11,786 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:27:11,786 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:27:11,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:27:11,786 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:27:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2021-10-11 02:27:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:27:11,820 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:11,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:11,821 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2021-10-11 02:27:11,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:11,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668683863] [2021-10-11 02:27:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:12,031 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:27:12,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668683863] [2021-10-11 02:27:12,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:27:12,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:27:12,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847434505] [2021-10-11 02:27:12,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:27:12,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:27:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:27:12,070 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 5 states. [2021-10-11 02:27:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:12,146 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-10-11 02:27:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:27:12,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:27:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:12,157 INFO L225 Difference]: With dead ends: 22 [2021-10-11 02:27:12,158 INFO L226 Difference]: Without dead ends: 14 [2021-10-11 02:27:12,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:27:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-10-11 02:27:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-11 02:27:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-11 02:27:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-10-11 02:27:12,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-10-11 02:27:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:12,207 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-10-11 02:27:12,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:27:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-10-11 02:27:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 02:27:12,209 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:12,209 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:12,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:27:12,210 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2021-10-11 02:27:12,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:12,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216597268] [2021-10-11 02:27:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:27:12,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216597268] [2021-10-11 02:27:12,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661717382] [2021-10-11 02:27:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:12,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:27:12,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:27:12,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:27:12,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1755716161] [2021-10-11 02:27:12,787 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:12,787 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:12,794 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:27:12,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:12,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-11 02:27:12,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237107473] [2021-10-11 02:27:12,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:27:12,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:27:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:27:12,811 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2021-10-11 02:27:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:12,906 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-10-11 02:27:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:27:12,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2021-10-11 02:27:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:12,909 INFO L225 Difference]: With dead ends: 21 [2021-10-11 02:27:12,909 INFO L226 Difference]: Without dead ends: 17 [2021-10-11 02:27:12,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-11 02:27:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 02:27:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:27:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-10-11 02:27:12,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-10-11 02:27:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:12,929 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-10-11 02:27:12,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:27:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-10-11 02:27:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 02:27:12,932 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:12,933 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:13,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-11 02:27:13,149 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2021-10-11 02:27:13,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:13,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111662646] [2021-10-11 02:27:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:27:13,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111662646] [2021-10-11 02:27:13,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078772667] [2021-10-11 02:27:13,283 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_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:13,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-10-11 02:27:13,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:13,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:27:13,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:27:13,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:27:13,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [337826845] [2021-10-11 02:27:13,912 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:13,912 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:13,913 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:27:13,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:13,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-11 02:27:13,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382176333] [2021-10-11 02:27:13,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:27:13,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:27:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:27:13,923 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2021-10-11 02:27:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:14,021 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-10-11 02:27:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:27:14,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2021-10-11 02:27:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:14,023 INFO L225 Difference]: With dead ends: 24 [2021-10-11 02:27:14,023 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 02:27:14,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:27:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 02:27:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 02:27:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 02:27:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-11 02:27:14,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2021-10-11 02:27:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:14,035 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-11 02:27:14,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:27:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-11 02:27:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:27:14,038 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:14,038 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:14,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:14,257 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2021-10-11 02:27:14,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:14,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647105001] [2021-10-11 02:27:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:27:14,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647105001] [2021-10-11 02:27:14,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77369365] [2021-10-11 02:27:14,381 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_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:14,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:14,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:14,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:27:14,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:27:14,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:27:15,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1375761812] [2021-10-11 02:27:15,142 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:15,143 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:15,143 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:27:15,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:15,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-11 02:27:15,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613192117] [2021-10-11 02:27:15,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:27:15,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:27:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:27:15,148 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2021-10-11 02:27:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:15,252 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2021-10-11 02:27:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:27:15,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2021-10-11 02:27:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:15,255 INFO L225 Difference]: With dead ends: 27 [2021-10-11 02:27:15,256 INFO L226 Difference]: Without dead ends: 23 [2021-10-11 02:27:15,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:27:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-10-11 02:27:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-10-11 02:27:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-11 02:27:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-10-11 02:27:15,267 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2021-10-11 02:27:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:15,268 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-10-11 02:27:15,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:27:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-10-11 02:27:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-11 02:27:15,271 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:15,271 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:15,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:15,485 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2021-10-11 02:27:15,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:15,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088713294] [2021-10-11 02:27:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-11 02:27:15,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088713294] [2021-10-11 02:27:15,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483624306] [2021-10-11 02:27:15,588 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:15,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-11 02:27:15,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-11 02:27:15,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:27:16,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [882023515] [2021-10-11 02:27:16,530 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:16,530 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:16,531 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:27:16,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:16,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2021-10-11 02:27:16,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684667525] [2021-10-11 02:27:16,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-10-11 02:27:16,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:16,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-11 02:27:16,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:27:16,535 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 15 states. [2021-10-11 02:27:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:16,656 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-10-11 02:27:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:27:16,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2021-10-11 02:27:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:16,658 INFO L225 Difference]: With dead ends: 30 [2021-10-11 02:27:16,658 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:27:16,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2021-10-11 02:27:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:27:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:27:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:27:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-10-11 02:27:16,666 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2021-10-11 02:27:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:16,666 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-10-11 02:27:16,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-10-11 02:27:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-10-11 02:27:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:27:16,668 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:16,668 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:16,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:16,893 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2021-10-11 02:27:16,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:16,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988032439] [2021-10-11 02:27:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-11 02:27:16,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988032439] [2021-10-11 02:27:16,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276413935] [2021-10-11 02:27:16,997 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_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:17,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-10-11 02:27:17,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:17,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:27:17,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-10-11 02:27:17,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-11 02:27:18,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682039019] [2021-10-11 02:27:18,438 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:18,438 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:18,438 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:27:18,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:18,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2021-10-11 02:27:18,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359367592] [2021-10-11 02:27:18,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-10-11 02:27:18,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-11 02:27:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:27:18,451 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 17 states. [2021-10-11 02:27:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:18,600 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2021-10-11 02:27:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 02:27:18,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2021-10-11 02:27:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:18,605 INFO L225 Difference]: With dead ends: 33 [2021-10-11 02:27:18,605 INFO L226 Difference]: Without dead ends: 29 [2021-10-11 02:27:18,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:27:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-10-11 02:27:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-10-11 02:27:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-10-11 02:27:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-10-11 02:27:18,612 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2021-10-11 02:27:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:18,613 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-10-11 02:27:18,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-10-11 02:27:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-10-11 02:27:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 02:27:18,615 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:18,615 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:18,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-11 02:27:18,815 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:18,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2021-10-11 02:27:18,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:18,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196595286] [2021-10-11 02:27:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-11 02:27:19,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196595286] [2021-10-11 02:27:19,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368324450] [2021-10-11 02:27:19,005 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_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:19,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:19,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:19,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-11 02:27:19,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-11 02:27:19,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-11 02:27:20,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1806935373] [2021-10-11 02:27:20,955 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:20,955 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:20,956 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:27:20,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:20,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2021-10-11 02:27:20,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692156348] [2021-10-11 02:27:20,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-10-11 02:27:20,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-11 02:27:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-11 02:27:20,960 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 19 states. [2021-10-11 02:27:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:21,143 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-10-11 02:27:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:27:21,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2021-10-11 02:27:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:21,145 INFO L225 Difference]: With dead ends: 36 [2021-10-11 02:27:21,145 INFO L226 Difference]: Without dead ends: 32 [2021-10-11 02:27:21,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-10-11 02:27:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-11 02:27:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-11 02:27:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:27:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-11 02:27:21,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2021-10-11 02:27:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:21,154 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-11 02:27:21,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-10-11 02:27:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-11 02:27:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 02:27:21,158 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:21,159 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:21,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:21,372 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2021-10-11 02:27:21,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:21,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188373424] [2021-10-11 02:27:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-11 02:27:21,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188373424] [2021-10-11 02:27:21,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330830454] [2021-10-11 02:27:21,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:21,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-11 02:27:21,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-11 02:27:21,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-11 02:27:24,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646622061] [2021-10-11 02:27:24,075 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:24,075 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:24,076 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:27:24,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:24,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2021-10-11 02:27:24,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321461764] [2021-10-11 02:27:24,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:27:24,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:27:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:27:24,079 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 21 states. [2021-10-11 02:27:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:24,254 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-10-11 02:27:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:27:24,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2021-10-11 02:27:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:24,259 INFO L225 Difference]: With dead ends: 39 [2021-10-11 02:27:24,260 INFO L226 Difference]: Without dead ends: 35 [2021-10-11 02:27:24,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:27:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-11 02:27:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-11 02:27:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-10-11 02:27:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-10-11 02:27:24,273 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2021-10-11 02:27:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:24,274 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-10-11 02:27:24,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:27:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-10-11 02:27:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:27:24,278 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:24,278 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:24,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:24,493 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2021-10-11 02:27:24,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:24,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377448097] [2021-10-11 02:27:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-11 02:27:24,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377448097] [2021-10-11 02:27:24,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215319355] [2021-10-11 02:27:24,663 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_df279d35-8c89-428c-9240-2c5cc0821be2/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:27:24,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-10-11 02:27:24,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:24,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-11 02:27:24,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-10-11 02:27:24,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-11 02:27:27,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356045525] [2021-10-11 02:27:27,667 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:27,668 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:27,668 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:27:27,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:27,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2021-10-11 02:27:27,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942739734] [2021-10-11 02:27:27,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:27:27,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:27:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:27:27,672 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 23 states. [2021-10-11 02:27:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:27,844 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2021-10-11 02:27:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:27:27,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2021-10-11 02:27:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:27,848 INFO L225 Difference]: With dead ends: 42 [2021-10-11 02:27:27,848 INFO L226 Difference]: Without dead ends: 38 [2021-10-11 02:27:27,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2021-10-11 02:27:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-11 02:27:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-11 02:27:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-11 02:27:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-11 02:27:27,870 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2021-10-11 02:27:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:27,871 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-11 02:27:27,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:27:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-11 02:27:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 02:27:27,877 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:27,877 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:28,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-11 02:27:28,097 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2021-10-11 02:27:28,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:28,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930111159] [2021-10-11 02:27:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-11 02:27:28,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930111159] [2021-10-11 02:27:28,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95135905] [2021-10-11 02:27:28,281 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_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:28,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:27:28,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:27:28,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-11 02:27:28,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-10-11 02:27:28,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-11 02:27:32,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919264251] [2021-10-11 02:27:32,148 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:32,148 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:32,149 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:27:32,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:32,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2021-10-11 02:27:32,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637973798] [2021-10-11 02:27:32,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-10-11 02:27:32,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-11 02:27:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2021-10-11 02:27:32,152 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2021-10-11 02:27:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:32,354 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2021-10-11 02:27:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-11 02:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2021-10-11 02:27:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:32,355 INFO L225 Difference]: With dead ends: 45 [2021-10-11 02:27:32,355 INFO L226 Difference]: Without dead ends: 41 [2021-10-11 02:27:32,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2021-10-11 02:27:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-10-11 02:27:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-10-11 02:27:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-10-11 02:27:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-10-11 02:27:32,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2021-10-11 02:27:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:32,367 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-10-11 02:27:32,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2021-10-11 02:27:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-10-11 02:27:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-11 02:27:32,369 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:27:32,369 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:27:32,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:32,577 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:27:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:27:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2021-10-11 02:27:32,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:27:32,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569522922] [2021-10-11 02:27:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:27:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 108 proven. 83 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2021-10-11 02:27:33,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569522922] [2021-10-11 02:27:33,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163154724] [2021-10-11 02:27:33,405 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:27:33,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 97 conjunts are in the unsatisfiable core [2021-10-11 02:27:33,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:27:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 19 proven. 155 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-10-11 02:27:34,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:27:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-10-11 02:27:39,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [117745937] [2021-10-11 02:27:39,092 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:27:39,092 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:27:39,093 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:27:39,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:27:39,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 62 [2021-10-11 02:27:39,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045807913] [2021-10-11 02:27:39,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-10-11 02:27:39,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:27:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-10-11 02:27:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3576, Unknown=0, NotChecked=0, Total=3782 [2021-10-11 02:27:39,097 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 62 states. [2021-10-11 02:27:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:27:41,632 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-10-11 02:27:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-11 02:27:41,633 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 69 [2021-10-11 02:27:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:27:41,634 INFO L225 Difference]: With dead ends: 44 [2021-10-11 02:27:41,634 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:27:41,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 102 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=696, Invalid=7314, Unknown=0, NotChecked=0, Total=8010 [2021-10-11 02:27:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:27:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:27:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:27:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:27:41,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2021-10-11 02:27:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:27:41,638 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:27:41,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2021-10-11 02:27:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:27:41,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:27:41,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:27:41,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:27:41,883 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L258 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start_main_~a~0 10) (= ULTIMATE.start_main_~b~0 0)) [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point L13(lines 13 20) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L262 CegarLoopResult]: For program point sumEXIT(lines 5 11) no Hoare annotation was computed. [2021-10-11 02:27:41,884 INFO L258 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (let ((.cse1 (+ |sum_#in~n| |sum_#in~m|)) (.cse0 (+ sum_~n sum_~m))) (and (<= .cse0 .cse1) (= sum_~m |sum_#in~m|) (<= (+ |sum_#in~m| 1) .cse0) (<= .cse1 .cse0))) [2021-10-11 02:27:41,885 INFO L262 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2021-10-11 02:27:41,885 INFO L262 CegarLoopResult]: For program point L6(lines 6 10) no Hoare annotation was computed. [2021-10-11 02:27:41,885 INFO L262 CegarLoopResult]: For program point sumFINAL(lines 5 11) no Hoare annotation was computed. [2021-10-11 02:27:41,885 INFO L265 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2021-10-11 02:27:41,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:27:41 BoogieIcfgContainer [2021-10-11 02:27:41,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:27:41,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:27:41,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:27:41,891 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:27:41,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:27:11" (3/4) ... [2021-10-11 02:27:41,895 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:27:41,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2021-10-11 02:27:41,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-10-11 02:27:41,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-11 02:27:41,905 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:27:41,905 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:27:41,935 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df279d35-8c89-428c-9240-2c5cc0821be2/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:27:41,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:27:41,937 INFO L168 Benchmark]: Toolchain (without parser) took 30879.78 ms. Allocated memory was 90.2 MB in the beginning and 490.7 MB in the end (delta: 400.6 MB). Free memory was 56.6 MB in the beginning and 337.7 MB in the end (delta: -281.1 MB). Peak memory consumption was 118.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:41,938 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 90.2 MB. Free memory is still 46.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:41,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.18 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 56.5 MB in the beginning and 86.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:41,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 111.1 MB. Free memory was 86.7 MB in the beginning and 85.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:41,939 INFO L168 Benchmark]: Boogie Preprocessor took 16.64 ms. Allocated memory is still 111.1 MB. Free memory was 85.5 MB in the beginning and 84.6 MB in the end (delta: 935.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:27:41,940 INFO L168 Benchmark]: RCFGBuilder took 318.65 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 72.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:41,941 INFO L168 Benchmark]: TraceAbstraction took 30216.97 ms. Allocated memory was 111.1 MB in the beginning and 490.7 MB in the end (delta: 379.6 MB). Free memory was 71.4 MB in the beginning and 339.8 MB in the end (delta: -268.4 MB). Peak memory consumption was 113.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:27:41,941 INFO L168 Benchmark]: Witness Printer took 45.33 ms. Allocated memory is still 490.7 MB. Free memory was 339.8 MB in the beginning and 337.7 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:27:41,944 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.30 ms. Allocated memory is still 90.2 MB. Free memory is still 46.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 247.18 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 56.5 MB in the beginning and 86.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 111.1 MB. Free memory was 86.7 MB in the beginning and 85.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 16.64 ms. Allocated memory is still 111.1 MB. Free memory was 85.5 MB in the beginning and 84.6 MB in the end (delta: 935.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 318.65 ms. Allocated memory is still 111.1 MB. Free memory was 84.6 MB in the beginning and 72.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30216.97 ms. Allocated memory was 111.1 MB in the beginning and 490.7 MB in the end (delta: 379.6 MB). Free memory was 71.4 MB in the beginning and 339.8 MB in the end (delta: -268.4 MB). Peak memory consumption was 113.1 MB. Max. memory is 16.1 GB. * Witness Printer took 45.33 ms. Allocated memory is still 490.7 MB. Free memory was 339.8 MB in the beginning and 337.7 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: 18]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 30.0s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 96 SDtfs, 617 SDslu, 772 SDs, 0 SdLazy, 1487 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1081 GetRequests, 787 SyntacticMatches, 14 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 33 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 849 NumberOfCodeBlocks, 849 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 242156 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1560 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 1583/3630 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...