./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:44:10,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:44:10,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:44:10,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:44:10,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:44:10,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:44:10,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:44:10,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:44:10,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:44:10,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:44:10,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:44:10,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:44:10,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:44:10,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:44:10,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:44:10,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:44:10,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:44:10,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:44:10,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:44:10,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:44:10,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:44:10,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:44:10,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:44:10,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:44:10,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:44:10,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:44:10,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:44:10,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:44:10,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:44:10,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:44:10,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:44:10,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:44:10,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:44:10,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:44:10,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:44:10,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:44:10,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:44:10,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:44:10,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:44:10,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:44:10,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:44:10,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-03 05:44:10,957 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:44:10,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:44:10,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:44:10,969 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:44:10,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:44:10,970 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:44:10,970 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:44:10,970 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:44:10,971 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:44:10,971 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:44:10,972 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:44:10,972 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:44:10,973 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:44:10,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:44:10,973 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:44:10,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 05:44:10,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 05:44:10,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:44:10,975 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:44:10,975 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 05:44:10,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:44:10,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:44:10,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:44:10,976 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 05:44:10,976 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 05:44:10,976 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-03 05:44:10,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:44:10,979 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:44:10,979 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:44:10,979 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:44:10,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:44:10,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:44:10,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:44:10,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:44:10,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:44:10,981 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:44:10,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:44:10,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:44:10,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:44:10,982 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_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/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_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2021-11-03 05:44:11,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:44:11,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:44:11,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:44:11,296 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:44:11,297 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:44:11,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2021-11-03 05:44:11,363 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/data/5b4b7a50a/be1b125835774e3bb88efd1a39a81dd1/FLAG4da184589 [2021-11-03 05:44:11,837 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:44:11,838 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2021-11-03 05:44:11,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/data/5b4b7a50a/be1b125835774e3bb88efd1a39a81dd1/FLAG4da184589 [2021-11-03 05:44:12,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/data/5b4b7a50a/be1b125835774e3bb88efd1a39a81dd1 [2021-11-03 05:44:12,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:44:12,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:44:12,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:44:12,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:44:12,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:44:12,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711d0706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12, skipping insertion in model container [2021-11-03 05:44:12,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:44:12,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:44:12,321 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-11-03 05:44:12,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:44:12,353 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:44:12,366 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2021-11-03 05:44:12,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:44:12,388 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:44:12,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12 WrapperNode [2021-11-03 05:44:12,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:44:12,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:44:12,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:44:12,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:44:12,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:44:12,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:44:12,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:44:12,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:44:12,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:44:12,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:44:12,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:44:12,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:44:12,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (1/1) ... [2021-11-03 05:44:12,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:44:12,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:12,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:44:12,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:44:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:44:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-11-03 05:44:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-11-03 05:44:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:44:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 05:44:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:44:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:44:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:44:12,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:44:13,057 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:44:13,058 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-11-03 05:44:13,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:44:13 BoogieIcfgContainer [2021-11-03 05:44:13,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:44:13,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:44:13,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:44:13,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:44:13,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:44:12" (1/3) ... [2021-11-03 05:44:13,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be4b74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:44:13, skipping insertion in model container [2021-11-03 05:44:13,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:44:12" (2/3) ... [2021-11-03 05:44:13,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be4b74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:44:13, skipping insertion in model container [2021-11-03 05:44:13,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:44:13" (3/3) ... [2021-11-03 05:44:13,079 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2021-11-03 05:44:13,084 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:44:13,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2021-11-03 05:44:13,151 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:44:13,157 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:44:13,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2021-11-03 05:44:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:44:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:44:13,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:13,197 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:44:13,197 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 150466673, now seen corresponding path program 1 times [2021-11-03 05:44:13,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:13,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196680445] [2021-11-03 05:44:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:13,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:13,435 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:13,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196680445] [2021-11-03 05:44:13,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196680445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:13,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:13,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:44:13,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806069641] [2021-11-03 05:44:13,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:44:13,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:44:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:44:13,458 INFO L87 Difference]: Start difference. First operand has 47 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:13,590 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2021-11-03 05:44:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:44:13,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-03 05:44:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:13,601 INFO L225 Difference]: With dead ends: 75 [2021-11-03 05:44:13,602 INFO L226 Difference]: Without dead ends: 74 [2021-11-03 05:44:13,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:44:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-03 05:44:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2021-11-03 05:44:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 54 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2021-11-03 05:44:13,668 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 6 [2021-11-03 05:44:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:13,669 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2021-11-03 05:44:13,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2021-11-03 05:44:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:44:13,670 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:13,670 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:13,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:44:13,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash 369505433, now seen corresponding path program 1 times [2021-11-03 05:44:13,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:13,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253398921] [2021-11-03 05:44:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:13,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:13,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:13,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253398921] [2021-11-03 05:44:13,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253398921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:13,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:13,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:44:13,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147844064] [2021-11-03 05:44:13,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:44:13,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:44:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:44:13,784 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:13,902 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2021-11-03 05:44:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:44:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 05:44:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:13,905 INFO L225 Difference]: With dead ends: 53 [2021-11-03 05:44:13,908 INFO L226 Difference]: Without dead ends: 53 [2021-11-03 05:44:13,909 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11-03 05:44:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-03 05:44:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-03 05:44:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.5) internal successors, (54), 47 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2021-11-03 05:44:13,922 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 7 [2021-11-03 05:44:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:13,923 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2021-11-03 05:44:13,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2021-11-03 05:44:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:44:13,925 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:13,925 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:13,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:44:13,927 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 369505434, now seen corresponding path program 1 times [2021-11-03 05:44:13,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:13,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247205190] [2021-11-03 05:44:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:13,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:14,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:14,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247205190] [2021-11-03 05:44:14,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247205190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:14,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:14,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:44:14,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305701155] [2021-11-03 05:44:14,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:44:14,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:44:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:44:14,152 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:14,345 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-11-03 05:44:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:44:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 05:44:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:14,349 INFO L225 Difference]: With dead ends: 59 [2021-11-03 05:44:14,350 INFO L226 Difference]: Without dead ends: 59 [2021-11-03 05:44:14,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:44:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-03 05:44:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2021-11-03 05:44:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2021-11-03 05:44:14,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 7 [2021-11-03 05:44:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:14,368 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2021-11-03 05:44:14,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2021-11-03 05:44:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 05:44:14,369 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:14,370 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:14,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:44:14,372 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1429953388, now seen corresponding path program 1 times [2021-11-03 05:44:14,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:14,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851174335] [2021-11-03 05:44:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:14,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:14,546 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:14,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851174335] [2021-11-03 05:44:14,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851174335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:14,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:14,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:44:14,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379322936] [2021-11-03 05:44:14,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:44:14,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:44:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:44:14,549 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:14,587 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2021-11-03 05:44:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:44:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2021-11-03 05:44:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:14,589 INFO L225 Difference]: With dead ends: 51 [2021-11-03 05:44:14,589 INFO L226 Difference]: Without dead ends: 51 [2021-11-03 05:44:14,590 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:44:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-03 05:44:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-11-03 05:44:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-11-03 05:44:14,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 8 [2021-11-03 05:44:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:14,603 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-11-03 05:44:14,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 3.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-11-03 05:44:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 05:44:14,603 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:14,604 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:14,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:44:14,604 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:14,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1430233423, now seen corresponding path program 1 times [2021-11-03 05:44:14,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:14,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616234199] [2021-11-03 05:44:14,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:14,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:14,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:14,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616234199] [2021-11-03 05:44:14,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616234199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:14,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:14,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:44:14,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628484515] [2021-11-03 05:44:14,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:44:14,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:44:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:44:14,751 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:14,899 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-11-03 05:44:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:44:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-03 05:44:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:14,903 INFO L225 Difference]: With dead ends: 57 [2021-11-03 05:44:14,903 INFO L226 Difference]: Without dead ends: 57 [2021-11-03 05:44:14,904 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:44:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-03 05:44:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-11-03 05:44:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-11-03 05:44:14,924 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 8 [2021-11-03 05:44:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:14,924 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-11-03 05:44:14,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-11-03 05:44:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 05:44:14,926 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:14,926 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:14,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:44:14,927 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1378879468, now seen corresponding path program 1 times [2021-11-03 05:44:14,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:14,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902757413] [2021-11-03 05:44:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:14,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:15,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:15,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902757413] [2021-11-03 05:44:15,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902757413] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:15,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:15,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:44:15,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317132970] [2021-11-03 05:44:15,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:44:15,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:44:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:44:15,045 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:15,122 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2021-11-03 05:44:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:44:15,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-03 05:44:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:15,124 INFO L225 Difference]: With dead ends: 67 [2021-11-03 05:44:15,124 INFO L226 Difference]: Without dead ends: 67 [2021-11-03 05:44:15,124 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:44:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-03 05:44:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-11-03 05:44:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.35) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 05:44:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-03 05:44:15,129 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-11-03 05:44:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:15,130 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-03 05:44:15,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-03 05:44:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:44:15,131 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:15,131 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:15,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:44:15,132 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2041800706, now seen corresponding path program 1 times [2021-11-03 05:44:15,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:15,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562440183] [2021-11-03 05:44:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:15,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:15,205 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:15,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562440183] [2021-11-03 05:44:15,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562440183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:15,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:15,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:44:15,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772442072] [2021-11-03 05:44:15,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:44:15,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:15,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:44:15,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:44:15,208 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:15,261 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-11-03 05:44:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:44:15,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-03 05:44:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:15,262 INFO L225 Difference]: With dead ends: 54 [2021-11-03 05:44:15,262 INFO L226 Difference]: Without dead ends: 54 [2021-11-03 05:44:15,263 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:44:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-03 05:44:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-11-03 05:44:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 05:44:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-11-03 05:44:15,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 11 [2021-11-03 05:44:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:15,267 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-11-03 05:44:15,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-11-03 05:44:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:44:15,268 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:15,268 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:15,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:44:15,269 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1128683485, now seen corresponding path program 1 times [2021-11-03 05:44:15,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:15,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070821371] [2021-11-03 05:44:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:15,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:15,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:15,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070821371] [2021-11-03 05:44:15,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070821371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:15,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:15,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:44:15,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443284308] [2021-11-03 05:44:15,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:44:15,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:44:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:44:15,300 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:15,308 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-11-03 05:44:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:44:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-11-03 05:44:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:15,319 INFO L225 Difference]: With dead ends: 53 [2021-11-03 05:44:15,320 INFO L226 Difference]: Without dead ends: 53 [2021-11-03 05:44:15,320 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:44:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-03 05:44:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-11-03 05:44:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 05:44:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2021-11-03 05:44:15,324 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 12 [2021-11-03 05:44:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:15,324 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2021-11-03 05:44:15,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:15,325 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2021-11-03 05:44:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:44:15,326 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:15,326 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:15,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:44:15,326 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash -350967501, now seen corresponding path program 1 times [2021-11-03 05:44:15,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:15,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867881463] [2021-11-03 05:44:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:15,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:15,475 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:15,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867881463] [2021-11-03 05:44:15,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867881463] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:15,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903797554] [2021-11-03 05:44:15,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:15,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:15,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:15,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:44:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:15,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-03 05:44:15,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:15,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2021-11-03 05:44:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:16,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:16,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2021-11-03 05:44:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:44:16,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903797554] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:16,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [472317105] [2021-11-03 05:44:16,371 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-03 05:44:16,371 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:16,376 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:16,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:16,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 14 [2021-11-03 05:44:16,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495873687] [2021-11-03 05:44:16,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 05:44:16,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 05:44:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:44:16,381 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:16,722 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2021-11-03 05:44:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:44:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 05:44:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:16,723 INFO L225 Difference]: With dead ends: 57 [2021-11-03 05:44:16,723 INFO L226 Difference]: Without dead ends: 57 [2021-11-03 05:44:16,724 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:44:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-03 05:44:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-11-03 05:44:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 44 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 05:44:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2021-11-03 05:44:16,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2021-11-03 05:44:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:16,728 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2021-11-03 05:44:16,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-11-03 05:44:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:44:16,729 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:16,729 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:16,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:16,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:16,930 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2004915224, now seen corresponding path program 1 times [2021-11-03 05:44:16,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:16,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805991992] [2021-11-03 05:44:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:16,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:17,130 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:17,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805991992] [2021-11-03 05:44:17,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805991992] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:17,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089394245] [2021-11-03 05:44:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:17,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:17,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:17,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:44:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:17,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-03 05:44:17,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:17,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:44:17,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2021-11-03 05:44:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:17,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:17,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2021-11-03 05:44:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:18,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089394245] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:18,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537712810] [2021-11-03 05:44:18,960 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-03 05:44:18,960 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:18,961 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:18,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:18,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2021-11-03 05:44:18,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669548138] [2021-11-03 05:44:18,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-03 05:44:18,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-03 05:44:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-11-03 05:44:18,964 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:19,651 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-03 05:44:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:44:19,651 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-03 05:44:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:19,652 INFO L225 Difference]: With dead ends: 56 [2021-11-03 05:44:19,652 INFO L226 Difference]: Without dead ends: 56 [2021-11-03 05:44:19,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 05:44:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-03 05:44:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2021-11-03 05:44:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-03 05:44:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2021-11-03 05:44:19,657 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2021-11-03 05:44:19,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:19,657 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2021-11-03 05:44:19,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2021-11-03 05:44:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:44:19,658 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:19,658 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:19,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:19,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:19,871 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1961899110, now seen corresponding path program 1 times [2021-11-03 05:44:19,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:19,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639833075] [2021-11-03 05:44:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:19,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:19,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:19,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639833075] [2021-11-03 05:44:19,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639833075] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:44:19,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:44:19,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:44:19,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094646078] [2021-11-03 05:44:19,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:44:19,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:44:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:44:19,911 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:19,935 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-11-03 05:44:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:44:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-03 05:44:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:19,937 INFO L225 Difference]: With dead ends: 49 [2021-11-03 05:44:19,937 INFO L226 Difference]: Without dead ends: 39 [2021-11-03 05:44:19,937 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:44:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-03 05:44:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-11-03 05:44:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2021-11-03 05:44:19,942 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2021-11-03 05:44:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:19,942 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-03 05:44:19,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:44:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2021-11-03 05:44:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:44:19,945 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:19,945 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:19,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:44:19,945 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2023113720, now seen corresponding path program 1 times [2021-11-03 05:44:19,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:19,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475484638] [2021-11-03 05:44:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:19,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:20,082 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:20,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475484638] [2021-11-03 05:44:20,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475484638] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:20,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273318708] [2021-11-03 05:44:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:20,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:20,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:20,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:20,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 05:44:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:20,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-03 05:44:20,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:20,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:20,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2021-11-03 05:44:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:20,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273318708] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:20,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1360361642] [2021-11-03 05:44:20,765 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-03 05:44:20,765 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:20,765 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:20,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:20,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2021-11-03 05:44:20,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543882407] [2021-11-03 05:44:20,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 05:44:20,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 05:44:20,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:44:20,768 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:21,018 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-11-03 05:44:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:44:21,019 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2021-11-03 05:44:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:21,020 INFO L225 Difference]: With dead ends: 44 [2021-11-03 05:44:21,020 INFO L226 Difference]: Without dead ends: 44 [2021-11-03 05:44:21,020 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:44:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-03 05:44:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2021-11-03 05:44:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-11-03 05:44:21,023 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2021-11-03 05:44:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:21,023 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-11-03 05:44:21,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-11-03 05:44:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:44:21,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:21,024 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-03 05:44:21,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:21,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-03 05:44:21,225 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:21,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2022829811, now seen corresponding path program 1 times [2021-11-03 05:44:21,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:21,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147934754] [2021-11-03 05:44:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:21,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:21,399 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:21,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147934754] [2021-11-03 05:44:21,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147934754] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:21,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744812643] [2021-11-03 05:44:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:21,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:21,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:21,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 05:44:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:21,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-03 05:44:21,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:21,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:22,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2021-11-03 05:44:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:22,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744812643] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:22,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107841882] [2021-11-03 05:44:22,337 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-03 05:44:22,337 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:22,337 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:22,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:22,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2021-11-03 05:44:22,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436982455] [2021-11-03 05:44:22,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-03 05:44:22,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-03 05:44:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:44:22,339 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:23,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:23,300 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-11-03 05:44:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 05:44:23,301 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 05:44:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:23,302 INFO L225 Difference]: With dead ends: 63 [2021-11-03 05:44:23,302 INFO L226 Difference]: Without dead ends: 63 [2021-11-03 05:44:23,303 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2021-11-03 05:44:23,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-03 05:44:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2021-11-03 05:44:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-03 05:44:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-11-03 05:44:23,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 15 [2021-11-03 05:44:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:23,306 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-11-03 05:44:23,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-11-03 05:44:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:44:23,307 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:23,307 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:23,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:23,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-03 05:44:23,508 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1707983288, now seen corresponding path program 1 times [2021-11-03 05:44:23,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:23,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282573144] [2021-11-03 05:44:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:23,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:23,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:23,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282573144] [2021-11-03 05:44:23,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282573144] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:23,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631791502] [2021-11-03 05:44:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:23,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:23,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:23,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:23,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 05:44:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:23,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-03 05:44:23,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:24,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2021-11-03 05:44:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:24,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:24,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2021-11-03 05:44:24,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2021-11-03 05:44:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:24,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631791502] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:24,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [450922525] [2021-11-03 05:44:24,977 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-03 05:44:24,978 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:24,978 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:24,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:24,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-11-03 05:44:24,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608002708] [2021-11-03 05:44:24,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-03 05:44:24,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-03 05:44:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:44:24,980 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:26,179 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-11-03 05:44:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 05:44:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 16 [2021-11-03 05:44:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:26,181 INFO L225 Difference]: With dead ends: 85 [2021-11-03 05:44:26,181 INFO L226 Difference]: Without dead ends: 85 [2021-11-03 05:44:26,182 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2021-11-03 05:44:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-11-03 05:44:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2021-11-03 05:44:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-03 05:44:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2021-11-03 05:44:26,187 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 16 [2021-11-03 05:44:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:26,187 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2021-11-03 05:44:26,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2021-11-03 05:44:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:44:26,188 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:26,188 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:26,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:26,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-03 05:44:26,403 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -694413414, now seen corresponding path program 1 times [2021-11-03 05:44:26,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:26,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739053968] [2021-11-03 05:44:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:26,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:26,479 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:26,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739053968] [2021-11-03 05:44:26,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739053968] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:26,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744808698] [2021-11-03 05:44:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:26,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:26,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:26,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 05:44:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:26,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-03 05:44:26,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:26,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:44:28,748 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2021-11-03 05:44:28,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2021-11-03 05:44:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-03 05:44:28,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:39,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744808698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:39,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1347045476] [2021-11-03 05:44:39,096 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:44:39,096 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:39,096 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:39,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:39,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-11-03 05:44:39,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518103304] [2021-11-03 05:44:39,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 05:44:39,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 05:44:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=5, NotChecked=24, Total=210 [2021-11-03 05:44:39,098 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:44:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:39,241 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2021-11-03 05:44:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:44:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2021-11-03 05:44:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:39,243 INFO L225 Difference]: With dead ends: 63 [2021-11-03 05:44:39,243 INFO L226 Difference]: Without dead ends: 63 [2021-11-03 05:44:39,243 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=80, Invalid=225, Unknown=5, NotChecked=32, Total=342 [2021-11-03 05:44:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-03 05:44:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-03 05:44:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-03 05:44:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-11-03 05:44:39,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2021-11-03 05:44:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:39,248 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-11-03 05:44:39,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:44:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-11-03 05:44:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 05:44:39,249 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:39,249 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:39,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:39,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-03 05:44:39,459 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:39,459 INFO L85 PathProgramCache]: Analyzing trace with hash 519062902, now seen corresponding path program 2 times [2021-11-03 05:44:39,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:39,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613326666] [2021-11-03 05:44:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:39,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:44:39,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:39,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613326666] [2021-11-03 05:44:39,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613326666] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:39,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538995265] [2021-11-03 05:44:39,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-03 05:44:39,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:39,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:39,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 05:44:39,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-03 05:44:39,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-03 05:44:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-03 05:44:39,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:39,953 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-03 05:44:39,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 50 [2021-11-03 05:44:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 05:44:40,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 05:44:40,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538995265] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:40,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226405223] [2021-11-03 05:44:40,711 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-03 05:44:40,711 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:40,711 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:40,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:40,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 15 [2021-11-03 05:44:40,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017438674] [2021-11-03 05:44:40,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 05:44:40,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 05:44:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-03 05:44:40,713 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:41,121 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-11-03 05:44:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:44:41,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-11-03 05:44:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:41,123 INFO L225 Difference]: With dead ends: 64 [2021-11-03 05:44:41,123 INFO L226 Difference]: Without dead ends: 64 [2021-11-03 05:44:41,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-11-03 05:44:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-03 05:44:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-11-03 05:44:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-03 05:44:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-11-03 05:44:41,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2021-11-03 05:44:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:41,128 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-11-03 05:44:41,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 7 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:44:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-11-03 05:44:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 05:44:41,129 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:41,129 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:41,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:41,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-03 05:44:41,343 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:41,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 317135144, now seen corresponding path program 1 times [2021-11-03 05:44:41,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:41,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672863504] [2021-11-03 05:44:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:41,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:44:41,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:41,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672863504] [2021-11-03 05:44:41,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672863504] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:41,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693628189] [2021-11-03 05:44:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:41,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:41,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:41,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:41,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-03 05:44:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:41,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-03 05:44:41,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:42,028 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-03 05:44:42,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2021-11-03 05:44:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:44:42,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:44:43,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693628189] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:43,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645775158] [2021-11-03 05:44:43,067 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2021-11-03 05:44:43,067 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:43,068 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:43,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:43,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 26 [2021-11-03 05:44:43,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160391637] [2021-11-03 05:44:43,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-03 05:44:43,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-03 05:44:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-03 05:44:43,073 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 05:44:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:44,044 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-11-03 05:44:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-03 05:44:44,045 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-11-03 05:44:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:44,046 INFO L225 Difference]: With dead ends: 76 [2021-11-03 05:44:44,046 INFO L226 Difference]: Without dead ends: 57 [2021-11-03 05:44:44,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2021-11-03 05:44:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-03 05:44:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2021-11-03 05:44:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-03 05:44:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2021-11-03 05:44:44,051 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 23 [2021-11-03 05:44:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:44,051 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-11-03 05:44:44,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 05:44:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2021-11-03 05:44:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 05:44:44,052 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:44:44,052 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:44,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:44,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-03 05:44:44,253 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2021-11-03 05:44:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:44:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -44004644, now seen corresponding path program 1 times [2021-11-03 05:44:44,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:44:44,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022432503] [2021-11-03 05:44:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:44,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:44:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:44:44,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:44:44,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022432503] [2021-11-03 05:44:44,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022432503] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:44:44,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490069589] [2021-11-03 05:44:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:44:44,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:44:44,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:44:44,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:44:44,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-03 05:44:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:44:44,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-03 05:44:44,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:44:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 05:44:45,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:44:45,337 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:44:45,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-11-03 05:44:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 05:44:45,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490069589] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:44:45,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [414016094] [2021-11-03 05:44:45,526 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:44:45,526 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:44:45,526 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:44:45,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:44:45,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 24 [2021-11-03 05:44:45,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574525399] [2021-11-03 05:44:45,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-03 05:44:45,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:44:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-03 05:44:45,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2021-11-03 05:44:45,530 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 05:44:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:44:46,377 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2021-11-03 05:44:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 05:44:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 30 [2021-11-03 05:44:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:44:46,386 INFO L225 Difference]: With dead ends: 48 [2021-11-03 05:44:46,386 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 05:44:46,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2021-11-03 05:44:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 05:44:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 05:44:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:44:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 05:44:46,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-11-03 05:44:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:44:46,388 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 05:44:46,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-03 05:44:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 05:44:46,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 05:44:46,391 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 05:44:46,392 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 05:44:46,392 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 05:44:46,392 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 05:44:46,392 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:44:46,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:44:46,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:44:46,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:44:46,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:44:46,393 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATION [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATION [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATION [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATION [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATION [2021-11-03 05:44:46,394 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATION [2021-11-03 05:44:46,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATION [2021-11-03 05:44:46,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr8REQUIRES_VIOLATION [2021-11-03 05:44:46,395 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr9ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:44:46,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-03 05:44:46,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-03 05:44:46,613 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:44:46,614 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:44:46,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:44:46 BoogieIcfgContainer [2021-11-03 05:44:46,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:44:46,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:44:46,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:44:46,618 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:44:46,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:44:13" (3/4) ... [2021-11-03 05:44:46,621 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 05:44:46,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2021-11-03 05:44:46,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-03 05:44:46,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-11-03 05:44:46,632 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-03 05:44:46,633 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:44:46,671 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:44:46,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:44:46,672 INFO L168 Benchmark]: Toolchain (without parser) took 34493.05 ms. Allocated memory was 100.7 MB in the beginning and 176.2 MB in the end (delta: 75.5 MB). Free memory was 76.8 MB in the beginning and 91.7 MB in the end (delta: -14.9 MB). Peak memory consumption was 61.5 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,672 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 100.7 MB. Free memory is still 78.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:44:46,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.72 ms. Allocated memory is still 100.7 MB. Free memory was 76.7 MB in the beginning and 66.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 100.7 MB. Free memory was 66.5 MB in the beginning and 64.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,673 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 ms. Allocated memory is still 100.7 MB. Free memory was 64.7 MB in the beginning and 63.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:44:46,674 INFO L168 Benchmark]: RCFGBuilder took 603.86 ms. Allocated memory is still 100.7 MB. Free memory was 63.4 MB in the beginning and 42.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,674 INFO L168 Benchmark]: TraceAbstraction took 33554.54 ms. Allocated memory was 100.7 MB in the beginning and 176.2 MB in the end (delta: 75.5 MB). Free memory was 42.4 MB in the beginning and 94.7 MB in the end (delta: -52.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,675 INFO L168 Benchmark]: Witness Printer took 53.84 ms. Allocated memory is still 176.2 MB. Free memory was 94.7 MB in the beginning and 91.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:44:46,677 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.20 ms. Allocated memory is still 100.7 MB. Free memory is still 78.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 209.72 ms. Allocated memory is still 100.7 MB. Free memory was 76.7 MB in the beginning and 66.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 100.7 MB. Free memory was 66.5 MB in the beginning and 64.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.05 ms. Allocated memory is still 100.7 MB. Free memory was 64.7 MB in the beginning and 63.4 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 603.86 ms. Allocated memory is still 100.7 MB. Free memory was 63.4 MB in the beginning and 42.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33554.54 ms. Allocated memory was 100.7 MB in the beginning and 176.2 MB in the end (delta: 75.5 MB). Free memory was 42.4 MB in the beginning and 94.7 MB in the end (delta: -52.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. * Witness Printer took 53.84 ms. Allocated memory is still 176.2 MB. Free memory was 94.7 MB in the beginning and 91.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 48]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 49]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 33.4s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1655 SDslu, 1300 SDs, 0 SdLazy, 2596 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 242 SyntacticMatches, 11 SemanticMatches, 311 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=14, InterpolantAutomatonStates: 177, 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, 18 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 544 ConstructedInterpolants, 56 QuantifiedInterpolants, 8111 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 53/153 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 - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-03 05:44:46,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55d5d978-c908-4ab7-bf46-3f6357f7b948/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE