./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/tree_max.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:33:23,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:33:23,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:33:23,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:33:23,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:33:23,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:33:23,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:33:23,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:33:23,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:33:23,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:33:23,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:33:23,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:33:23,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:33:23,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:33:23,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:33:23,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:33:23,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:33:23,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:33:23,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:33:23,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:33:23,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:33:23,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:33:23,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:33:23,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:33:23,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:33:23,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:33:23,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:33:23,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:33:23,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:33:23,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:33:23,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:33:23,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:33:23,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:33:23,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:33:23,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:33:23,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:33:23,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:33:23,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:33:23,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:33:23,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:33:23,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:33:23,272 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:33:23,297 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:33:23,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:33:23,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:33:23,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:33:23,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:33:23,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:33:23,300 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:33:23,300 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:33:23,300 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:33:23,301 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:33:23,301 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:33:23,301 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:33:23,302 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:33:23,302 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:33:23,302 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:33:23,303 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:33:23,303 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:33:23,303 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:33:23,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:33:23,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:33:23,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:33:23,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:33:23,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:33:23,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:33:23,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:33:23,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:33:23,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:33:23,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:33:23,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:33:23,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:33:23,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:33:23,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:33:23,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:33:23,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:33:23,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:33:23,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:33:23,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:33:23,310 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:33:23,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:33:23,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:33:23,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:33:23,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/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_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2022-11-26 00:33:23,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:33:23,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:33:23,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:33:23,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:33:23,725 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:33:23,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/verifythis/tree_max.c [2022-11-26 00:33:26,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:33:27,130 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:33:27,131 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/sv-benchmarks/c/verifythis/tree_max.c [2022-11-26 00:33:27,143 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/data/22db8952b/3101140ee12542d3ace6b608d427709e/FLAG9b7477fc3 [2022-11-26 00:33:27,166 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/data/22db8952b/3101140ee12542d3ace6b608d427709e [2022-11-26 00:33:27,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:33:27,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:33:27,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:33:27,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:33:27,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:33:27,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14db9363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27, skipping insertion in model container [2022-11-26 00:33:27,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:33:27,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:33:27,490 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-11-26 00:33:27,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:33:27,546 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:33:27,566 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-11-26 00:33:27,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:33:27,616 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:33:27,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27 WrapperNode [2022-11-26 00:33:27,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:33:27,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:33:27,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:33:27,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:33:27,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,693 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2022-11-26 00:33:27,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:33:27,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:33:27,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:33:27,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:33:27,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,748 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:33:27,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:33:27,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:33:27,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:33:27,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (1/1) ... [2022-11-26 00:33:27,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:33:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:27,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:33:27,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:33:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:33:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:33:27,863 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-11-26 00:33:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-11-26 00:33:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-26 00:33:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-26 00:33:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:33:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-11-26 00:33:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-11-26 00:33:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:33:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:33:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:33:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:33:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:33:27,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:33:27,995 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:33:27,998 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:33:28,255 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:33:28,328 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:33:28,328 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:33:28,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:33:28 BoogieIcfgContainer [2022-11-26 00:33:28,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:33:28,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:33:28,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:33:28,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:33:28,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:33:27" (1/3) ... [2022-11-26 00:33:28,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9ac30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:33:28, skipping insertion in model container [2022-11-26 00:33:28,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:33:27" (2/3) ... [2022-11-26 00:33:28,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9ac30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:33:28, skipping insertion in model container [2022-11-26 00:33:28,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:33:28" (3/3) ... [2022-11-26 00:33:28,360 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2022-11-26 00:33:28,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:33:28,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:33:28,483 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:33:28,494 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34f89582, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:33:28,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:33:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-26 00:33:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:33:28,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:28,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:28,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 473264591, now seen corresponding path program 1 times [2022-11-26 00:33:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:28,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006098780] [2022-11-26 00:33:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:29,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:29,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006098780] [2022-11-26 00:33:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006098780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:29,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:29,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:33:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482341057] [2022-11-26 00:33:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:29,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:33:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:33:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:33:29,312 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:33:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:29,529 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-11-26 00:33:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-26 00:33:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:29,555 INFO L225 Difference]: With dead ends: 65 [2022-11-26 00:33:29,556 INFO L226 Difference]: Without dead ends: 32 [2022-11-26 00:33:29,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:33:29,571 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:29,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 219 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-26 00:33:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-26 00:33:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-26 00:33:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-26 00:33:29,636 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-11-26 00:33:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:29,637 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-26 00:33:29,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:33:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-26 00:33:29,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:33:29,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:29,640 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:29,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:33:29,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1325382702, now seen corresponding path program 1 times [2022-11-26 00:33:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:29,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271866975] [2022-11-26 00:33:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:33:29,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:29,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271866975] [2022-11-26 00:33:29,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271866975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:29,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:29,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-26 00:33:29,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987404363] [2022-11-26 00:33:29,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:29,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:33:29,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:29,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:33:29,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:33:29,935 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-26 00:33:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:30,112 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-26 00:33:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:33:30,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-11-26 00:33:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:30,115 INFO L225 Difference]: With dead ends: 45 [2022-11-26 00:33:30,115 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 00:33:30,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:33:30,117 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:30,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 00:33:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-26 00:33:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 24 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-26 00:33:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-26 00:33:30,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-11-26 00:33:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:30,129 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-26 00:33:30,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-26 00:33:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-26 00:33:30,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-26 00:33:30,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:30,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:30,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:33:30,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 484307838, now seen corresponding path program 1 times [2022-11-26 00:33:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:30,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001459253] [2022-11-26 00:33:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:33:31,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:31,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001459253] [2022-11-26 00:33:31,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001459253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:31,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064126170] [2022-11-26 00:33:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:31,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:31,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:31,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:33:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:31,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-26 00:33:31,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:31,903 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:33:32,754 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:33:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:33:32,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:33:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064126170] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:33,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1967861027] [2022-11-26 00:33:34,027 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:33:34,028 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:33:34,033 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:33:34,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 11] total 31 [2022-11-26 00:33:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854193908] [2022-11-26 00:33:34,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-26 00:33:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-26 00:33:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2022-11-26 00:33:34,048 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-26 00:33:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:35,199 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-11-26 00:33:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:33:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 39 [2022-11-26 00:33:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:35,202 INFO L225 Difference]: With dead ends: 49 [2022-11-26 00:33:35,202 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 00:33:35,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 00:33:35,205 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:35,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 208 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:33:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 00:33:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-26 00:33:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-26 00:33:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-11-26 00:33:35,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 39 [2022-11-26 00:33:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:35,227 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-11-26 00:33:35,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 11 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-11-26 00:33:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-11-26 00:33:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-26 00:33:35,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:35,230 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:35,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:33:35,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:35,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:35,437 INFO L85 PathProgramCache]: Analyzing trace with hash -518813507, now seen corresponding path program 1 times [2022-11-26 00:33:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:35,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237555708] [2022-11-26 00:33:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:33:36,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:36,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237555708] [2022-11-26 00:33:36,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237555708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:36,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121984741] [2022-11-26 00:33:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:36,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:36,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:36,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:33:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:36,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-26 00:33:36,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:36,683 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:33:36,690 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:33:36,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:33:36,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:33:37,230 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:33:37,236 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:33:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:33:37,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:33:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121984741] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450676251] [2022-11-26 00:33:38,061 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:33:38,061 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:33:38,062 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:33:38,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:38,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 33 [2022-11-26 00:33:38,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720873851] [2022-11-26 00:33:38,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:38,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 00:33:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 00:33:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:33:38,067 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-26 00:33:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:40,887 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-11-26 00:33:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-26 00:33:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) Word has length 45 [2022-11-26 00:33:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:40,891 INFO L225 Difference]: With dead ends: 116 [2022-11-26 00:33:40,891 INFO L226 Difference]: Without dead ends: 102 [2022-11-26 00:33:40,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=363, Invalid=3543, Unknown=0, NotChecked=0, Total=3906 [2022-11-26 00:33:40,894 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 181 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:40,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 285 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-26 00:33:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-26 00:33:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-11-26 00:33:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 56 states have internal predecessors, (58), 19 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (45), 18 states have call predecessors, (45), 15 states have call successors, (45) [2022-11-26 00:33:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2022-11-26 00:33:40,919 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 45 [2022-11-26 00:33:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:40,919 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2022-11-26 00:33:40,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-26 00:33:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2022-11-26 00:33:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-26 00:33:40,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:40,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:40,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:41,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:41,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -402449861, now seen corresponding path program 1 times [2022-11-26 00:33:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:41,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453611530] [2022-11-26 00:33:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:33:41,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453611530] [2022-11-26 00:33:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453611530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038921987] [2022-11-26 00:33:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:41,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:41,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:33:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:41,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-26 00:33:41,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:41,983 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:33:41,988 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:33:42,225 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:33:42,229 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:33:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:33:42,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 00:33:42,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038921987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:42,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1995176071] [2022-11-26 00:33:42,653 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:33:42,653 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:33:42,654 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:33:42,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:42,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 20 [2022-11-26 00:33:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647098694] [2022-11-26 00:33:42,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:42,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:33:42,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:42,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:33:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:33:42,657 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-26 00:33:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:43,400 INFO L93 Difference]: Finished difference Result 170 states and 252 transitions. [2022-11-26 00:33:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:33:43,401 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-11-26 00:33:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:43,410 INFO L225 Difference]: With dead ends: 170 [2022-11-26 00:33:43,414 INFO L226 Difference]: Without dead ends: 131 [2022-11-26 00:33:43,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-11-26 00:33:43,416 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:43,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 477 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:33:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-26 00:33:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2022-11-26 00:33:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 58 states have internal predecessors, (61), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (39), 18 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-26 00:33:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2022-11-26 00:33:43,495 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 45 [2022-11-26 00:33:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2022-11-26 00:33:43,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-26 00:33:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2022-11-26 00:33:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-26 00:33:43,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:43,501 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:43,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:43,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:43,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:33:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -310864104, now seen corresponding path program 2 times [2022-11-26 00:33:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:43,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569956576] [2022-11-26 00:33:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-26 00:33:44,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:44,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569956576] [2022-11-26 00:33:44,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569956576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:44,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206098057] [2022-11-26 00:33:44,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:44,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:44,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:44,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:44,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:33:44,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:33:44,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:44,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-26 00:33:44,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:44,879 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:33:44,882 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:33:45,121 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2022-11-26 00:33:45,126 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2022-11-26 00:33:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-26 00:33:45,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:53,513 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:33:59,623 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:33:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-26 00:33:59,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206098057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:59,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1503854273] [2022-11-26 00:33:59,823 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:33:59,823 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:33:59,823 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:33:59,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:59,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 26 [2022-11-26 00:33:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241277406] [2022-11-26 00:33:59,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:59,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:33:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:59,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:33:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=585, Unknown=1, NotChecked=0, Total=650 [2022-11-26 00:33:59,828 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-26 00:34:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:00,497 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2022-11-26 00:34:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:34:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) Word has length 55 [2022-11-26 00:34:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:00,500 INFO L225 Difference]: With dead ends: 131 [2022-11-26 00:34:00,501 INFO L226 Difference]: Without dead ends: 112 [2022-11-26 00:34:00,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-11-26 00:34:00,503 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:00,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 348 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:34:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-26 00:34:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-11-26 00:34:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 62 states have internal predecessors, (65), 18 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (46), 20 states have call predecessors, (46), 13 states have call successors, (46) [2022-11-26 00:34:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2022-11-26 00:34:00,529 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 55 [2022-11-26 00:34:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:00,530 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2022-11-26 00:34:00,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 12 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-26 00:34:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2022-11-26 00:34:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 00:34:00,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:00,533 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:00,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:00,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 00:34:00,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:34:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1830536044, now seen corresponding path program 3 times [2022-11-26 00:34:00,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:00,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908873374] [2022-11-26 00:34:00,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-26 00:34:03,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:03,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908873374] [2022-11-26 00:34:03,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908873374] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:03,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104841312] [2022-11-26 00:34:03,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:34:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:03,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:03,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:34:03,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:34:03,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:34:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-26 00:34:03,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:03,401 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:34:03,405 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:34:04,528 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2022-11-26 00:34:04,532 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-26 00:34:04,709 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-26 00:34:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-26 00:34:04,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:06,560 INFO L350 Elim1Store]: Elim1 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 15 [2022-11-26 00:34:07,336 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-26 00:34:07,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 39 [2022-11-26 00:34:08,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104841312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646615308] [2022-11-26 00:34:08,148 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:34:08,148 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:34:08,149 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:34:08,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:34:08,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2022-11-26 00:34:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103336578] [2022-11-26 00:34:08,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:08,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-26 00:34:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-26 00:34:08,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2592, Unknown=0, NotChecked=0, Total=2756 [2022-11-26 00:34:08,154 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-26 00:34:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:09,791 INFO L93 Difference]: Finished difference Result 104 states and 145 transitions. [2022-11-26 00:34:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-26 00:34:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 67 [2022-11-26 00:34:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:09,794 INFO L225 Difference]: With dead ends: 104 [2022-11-26 00:34:09,794 INFO L226 Difference]: Without dead ends: 102 [2022-11-26 00:34:09,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=323, Invalid=4369, Unknown=0, NotChecked=0, Total=4692 [2022-11-26 00:34:09,797 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:09,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 741 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:34:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-26 00:34:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-11-26 00:34:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 63 states have internal predecessors, (65), 19 states have call successors, (19), 8 states have call predecessors, (19), 13 states have return successors, (46), 20 states have call predecessors, (46), 13 states have call successors, (46) [2022-11-26 00:34:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2022-11-26 00:34:09,833 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 67 [2022-11-26 00:34:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:09,837 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2022-11-26 00:34:09,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 15 states have call successors, (18), 5 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-26 00:34:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-11-26 00:34:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 00:34:09,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:09,840 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:09,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:10,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:10,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:34:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash 890264430, now seen corresponding path program 2 times [2022-11-26 00:34:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979714721] [2022-11-26 00:34:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-26 00:34:11,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:11,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979714721] [2022-11-26 00:34:11,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979714721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:11,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128003038] [2022-11-26 00:34:11,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:34:11,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:11,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:11,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:11,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:34:12,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:34:12,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:34:12,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-26 00:34:12,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:12,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:34:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-26 00:34:14,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-26 00:34:15,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128003038] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:15,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1427598903] [2022-11-26 00:34:15,503 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:34:15,504 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:34:15,505 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:34:15,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:15,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 43 [2022-11-26 00:34:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25456018] [2022-11-26 00:34:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:15,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-26 00:34:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-26 00:34:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1678, Unknown=1, NotChecked=0, Total=1806 [2022-11-26 00:34:15,512 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-26 00:34:20,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:22,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:26,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:30,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:32,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:34,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:38,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:40,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:42,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:44,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:47,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:34:49,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:10,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:23,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:25,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:27,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:31,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:35:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:32,618 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2022-11-26 00:35:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-26 00:35:32,619 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) Word has length 67 [2022-11-26 00:35:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:32,621 INFO L225 Difference]: With dead ends: 150 [2022-11-26 00:35:32,621 INFO L226 Difference]: Without dead ends: 129 [2022-11-26 00:35:32,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=762, Invalid=6532, Unknown=16, NotChecked=0, Total=7310 [2022-11-26 00:35:32,624 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 100 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 178 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:32,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 475 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2859 Invalid, 18 Unknown, 0 Unchecked, 37.9s Time] [2022-11-26 00:35:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-26 00:35:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2022-11-26 00:35:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.1) internal successors, (66), 64 states have internal predecessors, (66), 20 states have call successors, (20), 8 states have call predecessors, (20), 13 states have return successors, (48), 21 states have call predecessors, (48), 14 states have call successors, (48) [2022-11-26 00:35:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2022-11-26 00:35:32,649 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 67 [2022-11-26 00:35:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:32,650 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2022-11-26 00:35:32,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 2.142857142857143) internal successors, (75), 33 states have internal predecessors, (75), 19 states have call successors, (28), 6 states have call predecessors, (28), 15 states have return successors, (28), 21 states have call predecessors, (28), 18 states have call successors, (28) [2022-11-26 00:35:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2022-11-26 00:35:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 00:35:32,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:32,652 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:32,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:32,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 00:35:32,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:35:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1689983060, now seen corresponding path program 3 times [2022-11-26 00:35:32,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:32,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368853354] [2022-11-26 00:35:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:32,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-26 00:35:35,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:35,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368853354] [2022-11-26 00:35:35,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368853354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:35,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595249222] [2022-11-26 00:35:35,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:35:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:35,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:35,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:35:35,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:35:35,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:35:35,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-26 00:35:35,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:37,277 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2022-11-26 00:35:37,282 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-26 00:35:37,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:37,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-11-26 00:35:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-26 00:35:37,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:39,308 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 64 [2022-11-26 00:35:39,316 INFO L350 Elim1Store]: Elim1 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 40 [2022-11-26 00:35:39,331 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-26 00:35:39,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 1 [2022-11-26 00:35:43,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595249222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:43,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1473088054] [2022-11-26 00:35:43,438 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:35:43,438 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:35:43,438 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:35:43,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:35:43,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2022-11-26 00:35:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801834581] [2022-11-26 00:35:43,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:35:43,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-26 00:35:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-26 00:35:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4601, Unknown=0, NotChecked=0, Total=4830 [2022-11-26 00:35:43,443 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 37 states have internal predecessors, (59), 17 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2022-11-26 00:35:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:48,149 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2022-11-26 00:35:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-26 00:35:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 40 states have (on average 1.475) internal successors, (59), 37 states have internal predecessors, (59), 17 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) Word has length 67 [2022-11-26 00:35:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:48,152 INFO L225 Difference]: With dead ends: 123 [2022-11-26 00:35:48,152 INFO L226 Difference]: Without dead ends: 121 [2022-11-26 00:35:48,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=674, Invalid=10668, Unknown=0, NotChecked=0, Total=11342 [2022-11-26 00:35:48,157 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 136 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:48,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 320 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-26 00:35:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-26 00:35:48,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2022-11-26 00:35:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 69 states have internal predecessors, (72), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (48), 21 states have call predecessors, (48), 14 states have call successors, (48) [2022-11-26 00:35:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2022-11-26 00:35:48,181 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 67 [2022-11-26 00:35:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:48,182 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2022-11-26 00:35:48,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 40 states have (on average 1.475) internal successors, (59), 37 states have internal predecessors, (59), 17 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2022-11-26 00:35:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2022-11-26 00:35:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:35:48,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:48,184 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:48,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:48,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:48,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:35:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1484444117, now seen corresponding path program 1 times [2022-11-26 00:35:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522828081] [2022-11-26 00:35:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 00:35:50,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:50,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522828081] [2022-11-26 00:35:50,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522828081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891155084] [2022-11-26 00:35:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:50,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:50,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:50,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:50,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:35:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:50,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-26 00:35:50,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:50,463 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:35:50,468 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:35:51,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:35:51,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:51,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:51,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 33 [2022-11-26 00:35:51,647 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-11-26 00:35:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-26 00:35:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-26 00:35:51,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:04,490 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:36:04,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891155084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [467108917] [2022-11-26 00:36:04,544 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:36:04,545 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:04,545 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:36:04,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:36:04,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2022-11-26 00:36:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40240207] [2022-11-26 00:36:04,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:04,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-26 00:36:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-26 00:36:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1837, Unknown=1, NotChecked=0, Total=1980 [2022-11-26 00:36:04,550 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 36 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 15 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-26 00:36:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:07,916 INFO L93 Difference]: Finished difference Result 183 states and 268 transitions. [2022-11-26 00:36:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-26 00:36:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 15 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 73 [2022-11-26 00:36:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:07,928 INFO L225 Difference]: With dead ends: 183 [2022-11-26 00:36:07,929 INFO L226 Difference]: Without dead ends: 171 [2022-11-26 00:36:07,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=413, Invalid=4556, Unknown=1, NotChecked=0, Total=4970 [2022-11-26 00:36:07,934 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:07,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 869 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-26 00:36:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-26 00:36:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2022-11-26 00:36:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.121212121212121) internal successors, (111), 104 states have internal predecessors, (111), 28 states have call successors, (28), 16 states have call predecessors, (28), 19 states have return successors, (75), 26 states have call predecessors, (75), 17 states have call successors, (75) [2022-11-26 00:36:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-11-26 00:36:07,996 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 73 [2022-11-26 00:36:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:07,997 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-11-26 00:36:07,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.25) internal successors, (63), 29 states have internal predecessors, (63), 15 states have call successors, (17), 7 states have call predecessors, (17), 11 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-26 00:36:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-11-26 00:36:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-26 00:36:08,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:08,000 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:36:08,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:08,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:08,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:36:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -690128061, now seen corresponding path program 4 times [2022-11-26 00:36:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:08,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260418850] [2022-11-26 00:36:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-26 00:36:10,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260418850] [2022-11-26 00:36:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260418850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125462848] [2022-11-26 00:36:10,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:36:10,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:10,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:10,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:10,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:36:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:10,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-26 00:36:10,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:10,968 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:36:10,977 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:36:10,985 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:36:12,425 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2022-11-26 00:36:12,431 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-26 00:36:12,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:36:12,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-11-26 00:36:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-26 00:36:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125462848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1728977450] [2022-11-26 00:36:20,104 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:36:20,105 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:20,105 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:36:20,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:36:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2022-11-26 00:36:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702203453] [2022-11-26 00:36:20,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:20,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-26 00:36:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-26 00:36:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3718, Unknown=0, NotChecked=0, Total=3906 [2022-11-26 00:36:20,110 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 49 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (21), 5 states have call predecessors, (21), 9 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-26 00:36:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:23,095 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-11-26 00:36:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-26 00:36:23,096 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (21), 5 states have call predecessors, (21), 9 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) Word has length 89 [2022-11-26 00:36:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:23,098 INFO L225 Difference]: With dead ends: 174 [2022-11-26 00:36:23,098 INFO L226 Difference]: Without dead ends: 172 [2022-11-26 00:36:23,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=487, Invalid=6995, Unknown=0, NotChecked=0, Total=7482 [2022-11-26 00:36:23,101 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 98 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:23,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 798 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:36:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-26 00:36:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2022-11-26 00:36:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 101 states have internal predecessors, (107), 27 states have call successors, (27), 15 states have call predecessors, (27), 19 states have return successors, (75), 26 states have call predecessors, (75), 17 states have call successors, (75) [2022-11-26 00:36:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2022-11-26 00:36:23,134 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 89 [2022-11-26 00:36:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:23,134 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2022-11-26 00:36:23,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 34 states have internal predecessors, (62), 16 states have call successors, (21), 5 states have call predecessors, (21), 9 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2022-11-26 00:36:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2022-11-26 00:36:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:36:23,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:23,137 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:36:23,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:23,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 00:36:23,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:36:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1368080471, now seen corresponding path program 5 times [2022-11-26 00:36:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:23,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653810572] [2022-11-26 00:36:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-26 00:36:25,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:25,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653810572] [2022-11-26 00:36:25,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653810572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:25,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944862379] [2022-11-26 00:36:25,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:36:25,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:25,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:25,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:25,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:36:25,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:36:25,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:36:25,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-26 00:36:25,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:25,359 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:36:25,365 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:36:25,454 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:36:25,473 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:36:25,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-26 00:36:25,488 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-26 00:36:25,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:36:27,298 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-26 00:36:27,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 103 [2022-11-26 00:36:27,351 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-26 00:36:27,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 80 [2022-11-26 00:36:28,004 INFO L321 Elim1Store]: treesize reduction 17, result has 41.4 percent of original size [2022-11-26 00:36:28,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2022-11-26 00:36:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-26 00:36:28,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:36:29,636 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 74 [2022-11-26 00:36:29,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:36:29,650 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 76 [2022-11-26 00:36:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-26 00:36:34,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944862379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:36:34,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1938300499] [2022-11-26 00:36:34,399 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:36:34,399 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:36:34,399 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:36:34,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:34,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 59 [2022-11-26 00:36:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319101730] [2022-11-26 00:36:34,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:34,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-26 00:36:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-26 00:36:34,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3235, Unknown=1, NotChecked=0, Total=3422 [2022-11-26 00:36:34,405 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 59 states, 52 states have (on average 1.75) internal successors, (91), 41 states have internal predecessors, (91), 17 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 11 states have call successors, (23) [2022-11-26 00:36:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:47,326 INFO L93 Difference]: Finished difference Result 316 states and 460 transitions. [2022-11-26 00:36:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-26 00:36:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 52 states have (on average 1.75) internal successors, (91), 41 states have internal predecessors, (91), 17 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 11 states have call successors, (23) Word has length 73 [2022-11-26 00:36:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:47,331 INFO L225 Difference]: With dead ends: 316 [2022-11-26 00:36:47,331 INFO L226 Difference]: Without dead ends: 291 [2022-11-26 00:36:47,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=735, Invalid=10606, Unknown=1, NotChecked=0, Total=11342 [2022-11-26 00:36:47,336 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:47,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 564 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-26 00:36:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-26 00:36:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 240. [2022-11-26 00:36:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 170 states have internal predecessors, (185), 42 states have call successors, (42), 25 states have call predecessors, (42), 29 states have return successors, (121), 44 states have call predecessors, (121), 23 states have call successors, (121) [2022-11-26 00:36:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 348 transitions. [2022-11-26 00:36:47,412 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 348 transitions. Word has length 73 [2022-11-26 00:36:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:47,413 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 348 transitions. [2022-11-26 00:36:47,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 52 states have (on average 1.75) internal successors, (91), 41 states have internal predecessors, (91), 17 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (23), 19 states have call predecessors, (23), 11 states have call successors, (23) [2022-11-26 00:36:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 348 transitions. [2022-11-26 00:36:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:36:47,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:36:47,416 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:36:47,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:36:47,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:36:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:36:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1476709101, now seen corresponding path program 4 times [2022-11-26 00:36:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:36:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132723904] [2022-11-26 00:36:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:36:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:36:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 31 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-26 00:36:50,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:36:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132723904] [2022-11-26 00:36:50,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132723904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:36:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473586588] [2022-11-26 00:36:50,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:36:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:36:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:36:50,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:36:50,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:36:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:36:50,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-26 00:36:50,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:36:50,386 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:36:50,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:36:50,424 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:36:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:36:52,281 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-26 00:36:52,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2022-11-26 00:36:52,301 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-11-26 00:36:52,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-26 00:36:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:36:52,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:05,683 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473586588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2117116210] [2022-11-26 00:37:05,749 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:37:05,749 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:05,750 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:37:05,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:37:05,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 38 [2022-11-26 00:37:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965785690] [2022-11-26 00:37:05,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:37:05,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-26 00:37:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-26 00:37:05,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1998, Unknown=1, NotChecked=0, Total=2162 [2022-11-26 00:37:05,753 INFO L87 Difference]: Start difference. First operand 240 states and 348 transitions. Second operand has 38 states, 32 states have (on average 2.0) internal successors, (64), 29 states have internal predecessors, (64), 14 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-26 00:37:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:12,361 INFO L93 Difference]: Finished difference Result 371 states and 588 transitions. [2022-11-26 00:37:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-26 00:37:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.0) internal successors, (64), 29 states have internal predecessors, (64), 14 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 73 [2022-11-26 00:37:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:12,369 INFO L225 Difference]: With dead ends: 371 [2022-11-26 00:37:12,369 INFO L226 Difference]: Without dead ends: 359 [2022-11-26 00:37:12,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=611, Invalid=6030, Unknown=1, NotChecked=0, Total=6642 [2022-11-26 00:37:12,372 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 135 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:12,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 234 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-26 00:37:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-26 00:37:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 289. [2022-11-26 00:37:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 199 states have (on average 1.100502512562814) internal successors, (219), 204 states have internal predecessors, (219), 51 states have call successors, (51), 29 states have call predecessors, (51), 38 states have return successors, (177), 55 states have call predecessors, (177), 30 states have call successors, (177) [2022-11-26 00:37:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 447 transitions. [2022-11-26 00:37:12,484 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 447 transitions. Word has length 73 [2022-11-26 00:37:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:12,487 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 447 transitions. [2022-11-26 00:37:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.0) internal successors, (64), 29 states have internal predecessors, (64), 14 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-26 00:37:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 447 transitions. [2022-11-26 00:37:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-26 00:37:12,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:12,492 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:12,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:37:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:12,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1360345455, now seen corresponding path program 2 times [2022-11-26 00:37:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:12,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190625004] [2022-11-26 00:37:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-26 00:37:15,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:15,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190625004] [2022-11-26 00:37:15,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190625004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:15,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359619124] [2022-11-26 00:37:15,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:37:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:15,137 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:15,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:37:15,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:37:15,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:37:15,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-26 00:37:15,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:15,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:37:15,536 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:37:15,542 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:37:15,636 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:37:15,637 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:37:15,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:37:15,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-26 00:37:15,919 INFO L321 Elim1Store]: treesize reduction 57, result has 18.6 percent of original size [2022-11-26 00:37:15,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 51 [2022-11-26 00:37:15,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-26 00:37:17,535 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-26 00:37:17,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-11-26 00:37:17,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-11-26 00:37:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 00:37:17,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:19,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359619124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:19,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [894451475] [2022-11-26 00:37:19,220 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:37:19,221 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:19,221 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:37:19,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:37:19,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 39 [2022-11-26 00:37:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042751544] [2022-11-26 00:37:19,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:37:19,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 00:37:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 00:37:19,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2126, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 00:37:19,226 INFO L87 Difference]: Start difference. First operand 289 states and 447 transitions. Second operand has 39 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 27 states have internal predecessors, (66), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-26 00:37:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:24,809 INFO L93 Difference]: Finished difference Result 385 states and 588 transitions. [2022-11-26 00:37:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-26 00:37:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 27 states have internal predecessors, (66), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) Word has length 73 [2022-11-26 00:37:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:24,816 INFO L225 Difference]: With dead ends: 385 [2022-11-26 00:37:24,817 INFO L226 Difference]: Without dead ends: 360 [2022-11-26 00:37:24,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=395, Invalid=5305, Unknown=0, NotChecked=0, Total=5700 [2022-11-26 00:37:24,820 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 160 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:24,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 317 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 00:37:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-26 00:37:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2022-11-26 00:37:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 232 states have (on average 1.103448275862069) internal successors, (256), 240 states have internal predecessors, (256), 62 states have call successors, (62), 34 states have call predecessors, (62), 47 states have return successors, (223), 67 states have call predecessors, (223), 39 states have call successors, (223) [2022-11-26 00:37:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 541 transitions. [2022-11-26 00:37:24,951 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 541 transitions. Word has length 73 [2022-11-26 00:37:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 541 transitions. [2022-11-26 00:37:24,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 27 states have internal predecessors, (66), 14 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-26 00:37:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 541 transitions. [2022-11-26 00:37:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-26 00:37:24,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:24,957 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:24,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-26 00:37:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:25,164 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1289371116, now seen corresponding path program 6 times [2022-11-26 00:37:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:25,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067483787] [2022-11-26 00:37:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:25,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 20 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-26 00:37:27,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067483787] [2022-11-26 00:37:27,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067483787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563536177] [2022-11-26 00:37:27,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:37:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:27,346 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:27,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:37:27,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:37:27,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:37:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-26 00:37:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:27,930 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:37:29,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:37:29,082 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-11-26 00:37:29,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 41 [2022-11-26 00:37:29,103 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-11-26 00:37:29,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-11-26 00:37:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 42 proven. 26 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-26 00:37:29,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:37:42,314 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:52,572 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563536177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807003622] [2022-11-26 00:37:52,575 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:37:52,575 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:37:52,576 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:37:52,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:37:52,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 32 [2022-11-26 00:37:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958365906] [2022-11-26 00:37:52,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:37:52,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:37:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:37:52,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:37:52,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1592, Unknown=1, NotChecked=0, Total=1722 [2022-11-26 00:37:52,583 INFO L87 Difference]: Start difference. First operand 342 states and 541 transitions. Second operand has 32 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-26 00:37:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:37:55,086 INFO L93 Difference]: Finished difference Result 568 states and 921 transitions. [2022-11-26 00:37:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:37:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) Word has length 83 [2022-11-26 00:37:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:37:55,092 INFO L225 Difference]: With dead ends: 568 [2022-11-26 00:37:55,092 INFO L226 Difference]: Without dead ends: 526 [2022-11-26 00:37:55,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=281, Invalid=3258, Unknown=1, NotChecked=0, Total=3540 [2022-11-26 00:37:55,095 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:37:55,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 659 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 00:37:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-26 00:37:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 378. [2022-11-26 00:37:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 256 states have (on average 1.09375) internal successors, (280), 264 states have internal predecessors, (280), 62 states have call successors, (62), 34 states have call predecessors, (62), 59 states have return successors, (289), 79 states have call predecessors, (289), 39 states have call successors, (289) [2022-11-26 00:37:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 631 transitions. [2022-11-26 00:37:55,216 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 631 transitions. Word has length 83 [2022-11-26 00:37:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:37:55,216 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 631 transitions. [2022-11-26 00:37:55,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (15), 6 states have call predecessors, (15), 10 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-26 00:37:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 631 transitions. [2022-11-26 00:37:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-26 00:37:55,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:37:55,221 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:55,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-26 00:37:55,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 00:37:55,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:37:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:37:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1006456422, now seen corresponding path program 3 times [2022-11-26 00:37:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:37:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835495694] [2022-11-26 00:37:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:37:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:37:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:37:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 87 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-26 00:37:56,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:37:56,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835495694] [2022-11-26 00:37:56,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835495694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:37:56,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200781548] [2022-11-26 00:37:56,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:37:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:37:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:37:57,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:37:57,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 00:37:57,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:37:57,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:37:57,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-26 00:37:57,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:37:57,384 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:38:01,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:01,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:01,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 37 [2022-11-26 00:38:01,470 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 00:38:01,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2022-11-26 00:38:01,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:01,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-11-26 00:38:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 32 proven. 70 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-26 00:38:01,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:38:06,942 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-26 00:38:06,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 1 [2022-11-26 00:39:12,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200781548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:12,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643302126] [2022-11-26 00:39:12,422 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:39:12,422 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:39:12,423 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:12,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:39:12,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 40] total 60 [2022-11-26 00:39:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417149347] [2022-11-26 00:39:12,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-26 00:39:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-26 00:39:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=5726, Unknown=30, NotChecked=0, Total=6006 [2022-11-26 00:39:12,428 INFO L87 Difference]: Start difference. First operand 378 states and 631 transitions. Second operand has 60 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 20 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 16 states have call successors, (25) [2022-11-26 00:39:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:26,480 INFO L93 Difference]: Finished difference Result 504 states and 826 transitions. [2022-11-26 00:39:26,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-26 00:39:26,480 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 20 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 16 states have call successors, (25) Word has length 95 [2022-11-26 00:39:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:26,486 INFO L225 Difference]: With dead ends: 504 [2022-11-26 00:39:26,486 INFO L226 Difference]: Without dead ends: 452 [2022-11-26 00:39:26,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3453 ImplicationChecksByTransitivity, 75.4s TimeCoverageRelationStatistics Valid=847, Invalid=14375, Unknown=30, NotChecked=0, Total=15252 [2022-11-26 00:39:26,489 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 146 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 4061 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:26,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 509 Invalid, 4215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 4061 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-26 00:39:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-26 00:39:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 398. [2022-11-26 00:39:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 270 states have (on average 1.0925925925925926) internal successors, (295), 279 states have internal predecessors, (295), 67 states have call successors, (67), 36 states have call predecessors, (67), 60 states have return successors, (309), 82 states have call predecessors, (309), 41 states have call successors, (309) [2022-11-26 00:39:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 671 transitions. [2022-11-26 00:39:26,608 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 671 transitions. Word has length 95 [2022-11-26 00:39:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:26,608 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 671 transitions. [2022-11-26 00:39:26,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 20 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 16 states have call successors, (25) [2022-11-26 00:39:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 671 transitions. [2022-11-26 00:39:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-26 00:39:26,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:26,613 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:26,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:26,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 00:39:26,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1813269144, now seen corresponding path program 7 times [2022-11-26 00:39:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632012190] [2022-11-26 00:39:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:26,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-26 00:39:30,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:30,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632012190] [2022-11-26 00:39:30,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632012190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:30,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619960657] [2022-11-26 00:39:30,681 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:39:30,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:30,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:30,683 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:30,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 00:39:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:30,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 167 conjunts are in the unsatisfiable core [2022-11-26 00:39:30,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:30,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:39:31,187 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:39:31,190 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:39:31,278 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:39:31,278 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:39:31,359 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:39:31,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:39:38,111 INFO L321 Elim1Store]: treesize reduction 44, result has 70.5 percent of original size [2022-11-26 00:39:38,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 205 [2022-11-26 00:39:38,293 INFO L321 Elim1Store]: treesize reduction 36, result has 70.2 percent of original size [2022-11-26 00:39:38,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 225 [2022-11-26 00:39:44,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:44,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 63 [2022-11-26 00:39:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 32 proven. 92 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-26 00:39:44,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:48,211 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2022-11-26 00:39:48,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 216 treesize of output 1 [2022-11-26 00:39:49,800 INFO L321 Elim1Store]: treesize reduction 31, result has 87.4 percent of original size [2022-11-26 00:39:49,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 250 [2022-11-26 00:39:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619960657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:52,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296438981] [2022-11-26 00:39:52,525 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:39:52,525 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:39:52,525 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:39:52,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:39:52,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 41] total 75 [2022-11-26 00:39:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014167995] [2022-11-26 00:39:52,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-26 00:39:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-26 00:39:52,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=7690, Unknown=0, NotChecked=0, Total=8010 [2022-11-26 00:39:52,530 INFO L87 Difference]: Start difference. First operand 398 states and 671 transitions. Second operand has 75 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 51 states have internal predecessors, (90), 23 states have call successors, (28), 9 states have call predecessors, (28), 16 states have return successors, (25), 22 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-26 00:40:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:12,664 INFO L93 Difference]: Finished difference Result 679 states and 1147 transitions. [2022-11-26 00:40:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-26 00:40:12,665 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 51 states have internal predecessors, (90), 23 states have call successors, (28), 9 states have call predecessors, (28), 16 states have return successors, (25), 22 states have call predecessors, (25), 17 states have call successors, (25) Word has length 95 [2022-11-26 00:40:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:12,672 INFO L225 Difference]: With dead ends: 679 [2022-11-26 00:40:12,673 INFO L226 Difference]: Without dead ends: 677 [2022-11-26 00:40:12,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7638 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=1207, Invalid=24233, Unknown=0, NotChecked=0, Total=25440 [2022-11-26 00:40:12,677 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 131 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 7343 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 7463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 7343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:12,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 751 Invalid, 7463 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 7343 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-11-26 00:40:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-26 00:40:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 436. [2022-11-26 00:40:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 292 states have (on average 1.095890410958904) internal successors, (320), 305 states have internal predecessors, (320), 72 states have call successors, (72), 38 states have call predecessors, (72), 71 states have return successors, (350), 92 states have call predecessors, (350), 47 states have call successors, (350) [2022-11-26 00:40:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 742 transitions. [2022-11-26 00:40:12,842 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 742 transitions. Word has length 95 [2022-11-26 00:40:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:12,842 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 742 transitions. [2022-11-26 00:40:12,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 51 states have internal predecessors, (90), 23 states have call successors, (28), 9 states have call predecessors, (28), 16 states have return successors, (25), 22 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-26 00:40:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 742 transitions. [2022-11-26 00:40:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-26 00:40:12,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:12,848 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:12,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:13,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:40:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2079217582, now seen corresponding path program 4 times [2022-11-26 00:40:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:40:13,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306527031] [2022-11-26 00:40:13,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:40:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 49 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-26 00:40:15,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:40:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306527031] [2022-11-26 00:40:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306527031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139204900] [2022-11-26 00:40:15,142 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:40:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:15,144 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:15,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 00:40:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:15,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-26 00:40:15,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:15,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:40:15,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:40:15,556 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:40:15,556 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:40:15,573 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:40:15,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-26 00:40:15,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:40:15,652 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:40:15,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2022-11-26 00:40:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 46 proven. 50 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-26 00:40:17,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:24,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139204900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:24,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1777718737] [2022-11-26 00:40:24,172 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:40:24,172 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:40:24,173 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:40:24,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:40:24,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 36 [2022-11-26 00:40:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397023242] [2022-11-26 00:40:24,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-26 00:40:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:40:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-26 00:40:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1520, Unknown=1, NotChecked=0, Total=1640 [2022-11-26 00:40:24,175 INFO L87 Difference]: Start difference. First operand 436 states and 742 transitions. Second operand has 36 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 17 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-26 00:40:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:32,145 INFO L93 Difference]: Finished difference Result 1183 states and 2402 transitions. [2022-11-26 00:40:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-26 00:40:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 17 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) Word has length 83 [2022-11-26 00:40:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:32,161 INFO L225 Difference]: With dead ends: 1183 [2022-11-26 00:40:32,161 INFO L226 Difference]: Without dead ends: 1150 [2022-11-26 00:40:32,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=789, Invalid=6866, Unknown=1, NotChecked=0, Total=7656 [2022-11-26 00:40:32,164 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 129 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 3144 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:32,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 488 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3144 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-26 00:40:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-11-26 00:40:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 597. [2022-11-26 00:40:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 393 states have (on average 1.089058524173028) internal successors, (428), 413 states have internal predecessors, (428), 91 states have call successors, (91), 45 states have call predecessors, (91), 112 states have return successors, (608), 138 states have call predecessors, (608), 66 states have call successors, (608) [2022-11-26 00:40:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1127 transitions. [2022-11-26 00:40:32,383 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1127 transitions. Word has length 83 [2022-11-26 00:40:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:32,384 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1127 transitions. [2022-11-26 00:40:32,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 30 states have internal predecessors, (66), 17 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-26 00:40:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1127 transitions. [2022-11-26 00:40:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-26 00:40:32,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:32,390 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:32,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:32,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 00:40:32,597 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:40:32,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 747885375, now seen corresponding path program 5 times [2022-11-26 00:40:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:40:32,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295417651] [2022-11-26 00:40:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:40:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:40:34,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:40:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295417651] [2022-11-26 00:40:34,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295417651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937207598] [2022-11-26 00:40:34,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:40:34,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:34,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:34,636 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:34,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 00:40:34,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:40:34,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:34,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-26 00:40:34,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:34,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:40:34,960 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:40:34,968 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:40:35,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:40:35,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:40:35,059 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:40:35,059 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:40:35,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-26 00:40:35,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-26 00:40:35,157 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:40:35,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2022-11-26 00:40:35,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-26 00:40:36,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:40:36,900 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-26 00:40:36,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-11-26 00:40:36,913 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-26 00:40:36,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-26 00:40:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:40:36,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937207598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1809908996] [2022-11-26 00:40:38,812 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:40:38,812 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:40:38,812 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:40:38,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:40:38,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 32 [2022-11-26 00:40:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060885983] [2022-11-26 00:40:38,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:38,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:40:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:40:38,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:40:38,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:40:38,816 INFO L87 Difference]: Start difference. First operand 597 states and 1127 transitions. Second operand has 32 states, 27 states have (on average 2.037037037037037) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 00:40:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:42,948 INFO L93 Difference]: Finished difference Result 971 states and 1752 transitions. [2022-11-26 00:40:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-26 00:40:42,949 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.037037037037037) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) Word has length 85 [2022-11-26 00:40:42,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:42,960 INFO L225 Difference]: With dead ends: 971 [2022-11-26 00:40:42,960 INFO L226 Difference]: Without dead ends: 906 [2022-11-26 00:40:42,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=316, Invalid=3716, Unknown=0, NotChecked=0, Total=4032 [2022-11-26 00:40:42,963 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:42,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 271 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 00:40:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-26 00:40:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 603. [2022-11-26 00:40:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 397 states have (on average 1.0906801007556675) internal successors, (433), 417 states have internal predecessors, (433), 91 states have call successors, (91), 46 states have call predecessors, (91), 114 states have return successors, (615), 139 states have call predecessors, (615), 66 states have call successors, (615) [2022-11-26 00:40:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1139 transitions. [2022-11-26 00:40:43,236 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1139 transitions. Word has length 85 [2022-11-26 00:40:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:43,236 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 1139 transitions. [2022-11-26 00:40:43,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.037037037037037) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (12), 10 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 00:40:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1139 transitions. [2022-11-26 00:40:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-26 00:40:43,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:43,245 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:43,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:43,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:40:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash -78827888, now seen corresponding path program 5 times [2022-11-26 00:40:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:40:43,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786479942] [2022-11-26 00:40:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:40:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 85 proven. 106 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-26 00:40:48,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:40:48,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786479942] [2022-11-26 00:40:48,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786479942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:48,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634568206] [2022-11-26 00:40:48,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:40:48,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:48,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:48,492 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:48,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-26 00:40:49,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-26 00:40:49,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:49,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 178 conjunts are in the unsatisfiable core [2022-11-26 00:40:49,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:49,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:40:49,897 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:40:49,901 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:40:50,005 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:40:50,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:40:50,044 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:40:50,044 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:40:50,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:40:50,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:40:56,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:40:56,688 INFO L321 Elim1Store]: treesize reduction 43, result has 15.7 percent of original size [2022-11-26 00:40:56,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 175 treesize of output 88 [2022-11-26 00:40:56,718 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-11-26 00:40:56,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 26 [2022-11-26 00:40:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 96 proven. 121 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-26 00:40:56,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:41:17,358 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:41:17,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634568206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:41:17,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76020209] [2022-11-26 00:41:17,417 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:41:17,417 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:41:17,417 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:41:17,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:41:17,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 45] total 71 [2022-11-26 00:41:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499938345] [2022-11-26 00:41:17,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:41:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-26 00:41:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:41:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-26 00:41:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=6472, Unknown=3, NotChecked=0, Total=6806 [2022-11-26 00:41:17,422 INFO L87 Difference]: Start difference. First operand 603 states and 1139 transitions. Second operand has 71 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 54 states have internal predecessors, (113), 25 states have call successors, (30), 15 states have call predecessors, (30), 20 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-26 00:42:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:42:29,359 INFO L93 Difference]: Finished difference Result 1056 states and 2333 transitions. [2022-11-26 00:42:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-11-26 00:42:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 54 states have internal predecessors, (113), 25 states have call successors, (30), 15 states have call predecessors, (30), 20 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) Word has length 111 [2022-11-26 00:42:29,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:42:29,376 INFO L225 Difference]: With dead ends: 1056 [2022-11-26 00:42:29,377 INFO L226 Difference]: Without dead ends: 1043 [2022-11-26 00:42:29,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10777 ImplicationChecksByTransitivity, 83.0s TimeCoverageRelationStatistics Valid=2824, Invalid=34229, Unknown=3, NotChecked=0, Total=37056 [2022-11-26 00:42:29,382 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 270 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 7738 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 8596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 7738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:42:29,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 539 Invalid, 8596 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [858 Valid, 7738 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2022-11-26 00:42:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-11-26 00:42:29,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 759. [2022-11-26 00:42:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 497 states have (on average 1.090543259557344) internal successors, (542), 522 states have internal predecessors, (542), 116 states have call successors, (116), 57 states have call predecessors, (116), 145 states have return successors, (842), 179 states have call predecessors, (842), 86 states have call successors, (842) [2022-11-26 00:42:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1500 transitions. [2022-11-26 00:42:29,738 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1500 transitions. Word has length 111 [2022-11-26 00:42:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:42:29,739 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1500 transitions. [2022-11-26 00:42:29,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 54 states have internal predecessors, (113), 25 states have call successors, (30), 15 states have call predecessors, (30), 20 states have return successors, (26), 21 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-26 00:42:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1500 transitions. [2022-11-26 00:42:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-26 00:42:29,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:42:29,746 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:42:29,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-26 00:42:29,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:29,956 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:42:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:42:29,957 INFO L85 PathProgramCache]: Analyzing trace with hash 223257687, now seen corresponding path program 6 times [2022-11-26 00:42:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:42:29,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167464468] [2022-11-26 00:42:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:42:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:42:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:42:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 13 proven. 97 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-26 00:42:33,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:42:33,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167464468] [2022-11-26 00:42:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167464468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:42:33,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695935788] [2022-11-26 00:42:33,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:42:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:42:33,714 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:42:33,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-26 00:42:34,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:42:34,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:42:34,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-26 00:42:34,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:42:34,234 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-26 00:42:34,237 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:42:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:42:37,474 INFO L321 Elim1Store]: treesize reduction 18, result has 53.8 percent of original size [2022-11-26 00:42:37,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 86 [2022-11-26 00:42:37,527 INFO L321 Elim1Store]: treesize reduction 19, result has 48.6 percent of original size [2022-11-26 00:42:37,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 49 [2022-11-26 00:42:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 67 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-26 00:42:37,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:42:49,540 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:43:01,405 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:43:01,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695935788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:43:01,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1149579050] [2022-11-26 00:43:01,408 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:43:01,408 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:43:01,408 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:43:01,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:43:01,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 55 [2022-11-26 00:43:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777418288] [2022-11-26 00:43:01,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:43:01,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 00:43:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 00:43:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4314, Unknown=0, NotChecked=0, Total=4556 [2022-11-26 00:43:01,411 INFO L87 Difference]: Start difference. First operand 759 states and 1500 transitions. Second operand has 55 states, 45 states have (on average 2.2) internal successors, (99), 42 states have internal predecessors, (99), 21 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) [2022-11-26 00:43:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:43:26,248 INFO L93 Difference]: Finished difference Result 1493 states and 3118 transitions. [2022-11-26 00:43:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-26 00:43:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 45 states have (on average 2.2) internal successors, (99), 42 states have internal predecessors, (99), 21 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) Word has length 101 [2022-11-26 00:43:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:43:26,271 INFO L225 Difference]: With dead ends: 1493 [2022-11-26 00:43:26,272 INFO L226 Difference]: Without dead ends: 1354 [2022-11-26 00:43:26,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5197 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=1565, Invalid=21997, Unknown=0, NotChecked=0, Total=23562 [2022-11-26 00:43:26,276 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 173 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 7221 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 7506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 7221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:43:26,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 572 Invalid, 7506 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [285 Valid, 7221 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-11-26 00:43:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-11-26 00:43:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 931. [2022-11-26 00:43:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 624 states have (on average 1.0865384615384615) internal successors, (678), 644 states have internal predecessors, (678), 141 states have call successors, (141), 77 states have call predecessors, (141), 165 states have return successors, (1028), 209 states have call predecessors, (1028), 97 states have call successors, (1028) [2022-11-26 00:43:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1847 transitions. [2022-11-26 00:43:26,726 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1847 transitions. Word has length 101 [2022-11-26 00:43:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:43:26,726 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1847 transitions. [2022-11-26 00:43:26,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 45 states have (on average 2.2) internal successors, (99), 42 states have internal predecessors, (99), 21 states have call successors, (29), 12 states have call predecessors, (29), 15 states have return successors, (25), 19 states have call predecessors, (25), 15 states have call successors, (25) [2022-11-26 00:43:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1847 transitions. [2022-11-26 00:43:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-26 00:43:26,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:43:26,736 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:43:26,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:43:26,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-26 00:43:26,943 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:43:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:43:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1912745586, now seen corresponding path program 8 times [2022-11-26 00:43:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:43:26,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632959289] [2022-11-26 00:43:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:43:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:43:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:43:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 61 proven. 103 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-26 00:43:30,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:43:30,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632959289] [2022-11-26 00:43:30,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632959289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:43:30,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061516542] [2022-11-26 00:43:30,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:43:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:43:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:43:30,340 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:43:30,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 00:43:31,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-26 00:43:31,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:43:31,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-26 00:43:31,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:43:31,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:43:31,260 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:43:31,322 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:43:31,322 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:43:31,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:43:31,379 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:43:34,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:43:34,426 INFO L321 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2022-11-26 00:43:34,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 100 [2022-11-26 00:43:34,438 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:43:34,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 44 [2022-11-26 00:43:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 63 proven. 91 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-11-26 00:43:34,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:43:48,730 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:43:59,301 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:43:59,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061516542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:43:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311447104] [2022-11-26 00:43:59,304 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-26 00:43:59,304 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:43:59,305 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:43:59,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:43:59,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 48 [2022-11-26 00:43:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956993114] [2022-11-26 00:43:59,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:43:59,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-26 00:43:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:43:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-26 00:43:59,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3486, Unknown=1, NotChecked=0, Total=3660 [2022-11-26 00:43:59,309 INFO L87 Difference]: Start difference. First operand 931 states and 1847 transitions. Second operand has 48 states, 40 states have (on average 2.15) internal successors, (86), 38 states have internal predecessors, (86), 17 states have call successors, (24), 8 states have call predecessors, (24), 17 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-26 00:44:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:13,670 INFO L93 Difference]: Finished difference Result 2199 states and 4452 transitions. [2022-11-26 00:44:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-26 00:44:13,671 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 2.15) internal successors, (86), 38 states have internal predecessors, (86), 17 states have call successors, (24), 8 states have call predecessors, (24), 17 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) Word has length 111 [2022-11-26 00:44:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:13,694 INFO L225 Difference]: With dead ends: 2199 [2022-11-26 00:44:13,694 INFO L226 Difference]: Without dead ends: 2061 [2022-11-26 00:44:13,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2938 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=785, Invalid=13020, Unknown=1, NotChecked=0, Total=13806 [2022-11-26 00:44:13,698 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 138 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 5043 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 5176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 5043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:13,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 747 Invalid, 5176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 5043 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-26 00:44:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2022-11-26 00:44:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1313. [2022-11-26 00:44:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 895 states have (on average 1.0804469273743016) internal successors, (967), 912 states have internal predecessors, (967), 177 states have call successors, (177), 103 states have call predecessors, (177), 240 states have return successors, (1538), 297 states have call predecessors, (1538), 112 states have call successors, (1538) [2022-11-26 00:44:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 2682 transitions. [2022-11-26 00:44:14,365 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 2682 transitions. Word has length 111 [2022-11-26 00:44:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:14,365 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 2682 transitions. [2022-11-26 00:44:14,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 2.15) internal successors, (86), 38 states have internal predecessors, (86), 17 states have call successors, (24), 8 states have call predecessors, (24), 17 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) [2022-11-26 00:44:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 2682 transitions. [2022-11-26 00:44:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-26 00:44:14,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:14,378 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:14,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:14,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 00:44:14,586 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:44:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1419135094, now seen corresponding path program 7 times [2022-11-26 00:44:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:14,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018334453] [2022-11-26 00:44:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:14,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 41 proven. 125 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-26 00:44:22,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018334453] [2022-11-26 00:44:22,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018334453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678899266] [2022-11-26 00:44:22,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:44:22,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:22,126 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:22,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-26 00:44:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:22,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-26 00:44:22,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:22,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:44:22,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:44:22,917 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:44:22,918 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:44:23,007 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:44:23,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-26 00:44:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 68 proven. 76 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-26 00:44:24,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678899266] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [988825122] [2022-11-26 00:44:48,653 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-26 00:44:48,653 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:44:48,653 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:44:48,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:44:48,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21] total 49 [2022-11-26 00:44:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601376694] [2022-11-26 00:44:48,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:48,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-26 00:44:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:48,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-26 00:44:48,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2699, Unknown=4, NotChecked=0, Total=2862 [2022-11-26 00:44:48,656 INFO L87 Difference]: Start difference. First operand 1313 states and 2682 transitions. Second operand has 49 states, 41 states have (on average 2.268292682926829) internal successors, (93), 38 states have internal predecessors, (93), 20 states have call successors, (33), 9 states have call predecessors, (33), 16 states have return successors, (29), 22 states have call predecessors, (29), 17 states have call successors, (29) [2022-11-26 00:45:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:13,736 INFO L93 Difference]: Finished difference Result 1879 states and 3457 transitions. [2022-11-26 00:45:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-26 00:45:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 2.268292682926829) internal successors, (93), 38 states have internal predecessors, (93), 20 states have call successors, (33), 9 states have call predecessors, (33), 16 states have return successors, (29), 22 states have call predecessors, (29), 17 states have call successors, (29) Word has length 111 [2022-11-26 00:45:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:13,760 INFO L225 Difference]: With dead ends: 1879 [2022-11-26 00:45:13,760 INFO L226 Difference]: Without dead ends: 1764 [2022-11-26 00:45:13,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=959, Invalid=12609, Unknown=4, NotChecked=0, Total=13572 [2022-11-26 00:45:13,764 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 162 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 4089 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 4089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:13,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 4089 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-11-26 00:45:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-11-26 00:45:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1223. [2022-11-26 00:45:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 844 states have (on average 1.0770142180094786) internal successors, (909), 851 states have internal predecessors, (909), 166 states have call successors, (166), 100 states have call predecessors, (166), 212 states have return successors, (1448), 271 states have call predecessors, (1448), 97 states have call successors, (1448) [2022-11-26 00:45:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2523 transitions. [2022-11-26 00:45:14,511 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2523 transitions. Word has length 111 [2022-11-26 00:45:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:14,511 INFO L495 AbstractCegarLoop]: Abstraction has 1223 states and 2523 transitions. [2022-11-26 00:45:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 2.268292682926829) internal successors, (93), 38 states have internal predecessors, (93), 20 states have call successors, (33), 9 states have call predecessors, (33), 16 states have return successors, (29), 22 states have call predecessors, (29), 17 states have call successors, (29) [2022-11-26 00:45:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2523 transitions. [2022-11-26 00:45:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-26 00:45:14,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:14,525 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:45:14,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-26 00:45:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-26 00:45:14,735 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:45:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1652978726, now seen corresponding path program 8 times [2022-11-26 00:45:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081813308] [2022-11-26 00:45:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 20 proven. 122 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-26 00:45:20,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081813308] [2022-11-26 00:45:20,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081813308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:45:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981100421] [2022-11-26 00:45:20,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:45:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:45:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:45:20,876 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:45:20,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45957822-d380-44bc-92bf-69b481066ed6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 00:45:21,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-26 00:45:21,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:45:21,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-26 00:45:21,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:45:21,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-26 00:45:21,426 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-26 00:45:21,451 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:45:21,452 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 11 [2022-11-26 00:45:21,552 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-26 00:45:21,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:45:21,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-26 00:45:21,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-26 00:45:29,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:29,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:45:29,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2022-11-26 00:45:29,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 22 [2022-11-26 00:45:30,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:45:30,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-11-26 00:45:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 41 proven. 83 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-26 00:45:30,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:45:34,052 INFO L321 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2022-11-26 00:45:34,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 105 treesize of output 1 [2022-11-26 00:46:04,965 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)