./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 2329fc70 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_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/tree_max.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 05:49:59,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:49:59,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:49:59,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:49:59,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:49:59,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:49:59,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:49:59,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:49:59,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:49:59,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:49:59,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:49:59,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:49:59,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:49:59,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:49:59,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:49:59,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:49:59,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:49:59,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:49:59,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:49:59,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:49:59,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:49:59,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:49:59,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:49:59,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:49:59,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:49:59,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:49:59,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:49:59,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:49:59,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:49:59,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:49:59,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:49:59,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:49:59,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:49:59,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:49:59,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:49:59,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:49:59,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:49:59,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:49:59,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:49:59,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:49:59,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:49:59,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 05:49:59,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:49:59,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:49:59,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:49:59,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:49:59,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:49:59,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:49:59,629 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:49:59,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:49:59,630 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:49:59,630 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:49:59,631 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:49:59,631 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:49:59,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:49:59,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:49:59,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:49:59,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:49:59,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:49:59,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:49:59,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:49:59,633 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:49:59,633 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_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/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_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh 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-12-14 05:49:59,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:49:59,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:49:59,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:49:59,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:49:59,818 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:49:59,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/verifythis/tree_max.c [2022-12-14 05:50:02,327 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:50:02,486 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:50:02,487 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/sv-benchmarks/c/verifythis/tree_max.c [2022-12-14 05:50:02,491 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/data/632560b90/335a5f696db64037a5db48e950188e75/FLAG2f4cf94e8 [2022-12-14 05:50:02,904 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/data/632560b90/335a5f696db64037a5db48e950188e75 [2022-12-14 05:50:02,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:50:02,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:50:02,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:50:02,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:50:02,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:50:02,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:50:02" (1/1) ... [2022-12-14 05:50:02,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33df0629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:02, skipping insertion in model container [2022-12-14 05:50:02,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:50:02" (1/1) ... [2022-12-14 05:50:02,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:50:02,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:50:03,024 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_56d27129-e1d1-4659-91b9-910b10b0b194/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-14 05:50:03,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:50:03,044 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:50:03,052 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_56d27129-e1d1-4659-91b9-910b10b0b194/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-14 05:50:03,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:50:03,067 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:50:03,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03 WrapperNode [2022-12-14 05:50:03,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:50:03,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:50:03,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:50:03,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:50:03,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,090 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2022-12-14 05:50:03,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:50:03,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:50:03,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:50:03,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:50:03,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:50:03,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:50:03,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:50:03,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:50:03,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (1/1) ... [2022-12-14 05:50:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:50:03,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:03,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:50:03,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-12-14 05:50:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-12-14 05:50:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-12-14 05:50:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 05:50:03,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:50:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 05:50:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:50:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:50:03,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:50:03,234 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:50:03,236 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:50:03,365 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:50:03,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:50:03,395 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 05:50:03,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:50:03 BoogieIcfgContainer [2022-12-14 05:50:03,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:50:03,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:50:03,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:50:03,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:50:03,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:50:02" (1/3) ... [2022-12-14 05:50:03,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8bd64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:50:03, skipping insertion in model container [2022-12-14 05:50:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:50:03" (2/3) ... [2022-12-14 05:50:03,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8bd64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:50:03, skipping insertion in model container [2022-12-14 05:50:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:50:03" (3/3) ... [2022-12-14 05:50:03,406 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2022-12-14 05:50:03,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:50:03,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 05:50:03,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:50:03,477 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;@6ec0c0ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:50:03,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 05:50:03,480 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-12-14 05:50:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 05:50:03,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:03,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:50:03,487 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 473264591, now seen corresponding path program 1 times [2022-12-14 05:50:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:03,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116457874] [2022-12-14 05:50:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:50:03,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:03,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116457874] [2022-12-14 05:50:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116457874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:50:03,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:50:03,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:50:03,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254676519] [2022-12-14 05:50:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:50:03,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:50:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:50:03,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:50:03,838 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-12-14 05:50:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:03,949 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-12-14 05:50:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:50:03,952 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-12-14 05:50:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:03,960 INFO L225 Difference]: With dead ends: 65 [2022-12-14 05:50:03,960 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 05:50:03,963 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-12-14 05:50:03,967 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 05:50:03,968 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-12-14 05:50:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 05:50:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-14 05:50:04,004 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-12-14 05:50:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-12-14 05:50:04,007 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-12-14 05:50:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:04,007 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-12-14 05:50:04,008 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-12-14 05:50:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-12-14 05:50:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 05:50:04,010 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:04,010 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-12-14 05:50:04,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:50:04,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1325382702, now seen corresponding path program 1 times [2022-12-14 05:50:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612123524] [2022-12-14 05:50:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 05:50:04,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:04,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612123524] [2022-12-14 05:50:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612123524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:50:04,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:50:04,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 05:50:04,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827732439] [2022-12-14 05:50:04,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:50:04,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:50:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:50:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:50:04,159 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-12-14 05:50:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:04,245 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-12-14 05:50:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:50:04,246 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-12-14 05:50:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:04,247 INFO L225 Difference]: With dead ends: 45 [2022-12-14 05:50:04,247 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 05:50:04,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-14 05:50:04,249 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 05:50:04,249 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-12-14 05:50:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 05:50:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-14 05:50:04,256 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-12-14 05:50:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-12-14 05:50:04,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-12-14 05:50:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:04,258 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-12-14 05:50:04,258 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-12-14 05:50:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-12-14 05:50:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 05:50:04,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:04,259 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-12-14 05:50:04,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:50:04,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash 484307838, now seen corresponding path program 1 times [2022-12-14 05:50:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:04,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815030347] [2022-12-14 05:50:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 05:50:04,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:04,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815030347] [2022-12-14 05:50:04,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815030347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:04,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832703886] [2022-12-14 05:50:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:04,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:04,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:04,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:04,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:50:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:05,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 05:50:05,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:05,119 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-12-14 05:50:05,544 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-12-14 05:50:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 05:50:05,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:50:06,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832703886] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1349718540] [2022-12-14 05:50:06,337 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 05:50:06,338 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:06,342 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-12-14 05:50:06,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 11] total 31 [2022-12-14 05:50:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252379065] [2022-12-14 05:50:06,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 05:50:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 05:50:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2022-12-14 05:50:06,347 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-12-14 05:50:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:06,986 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-12-14 05:50:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:50:06,986 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-12-14 05:50:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:06,988 INFO L225 Difference]: With dead ends: 49 [2022-12-14 05:50:06,988 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 05:50:06,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 05:50:06,991 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:06,992 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.3s Time] [2022-12-14 05:50:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 05:50:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-12-14 05:50:06,997 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-12-14 05:50:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-12-14 05:50:06,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 39 [2022-12-14 05:50:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:06,998 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-12-14 05:50:06,998 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-12-14 05:50:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-12-14 05:50:06,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 05:50:06,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:06,999 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-12-14 05:50:07,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:50:07,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:07,201 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash -518813507, now seen corresponding path program 1 times [2022-12-14 05:50:07,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:07,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290199513] [2022-12-14 05:50:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:50:07,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:07,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290199513] [2022-12-14 05:50:07,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290199513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:07,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350487477] [2022-12-14 05:50:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:07,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:07,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:50:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:07,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 05:50:07,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:07,948 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-12-14 05:50:07,952 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-12-14 05:50:08,017 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-12-14 05:50:08,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-12-14 05:50:08,246 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-12-14 05:50:08,249 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-12-14 05:50:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:50:08,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:50:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350487477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:08,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [369009689] [2022-12-14 05:50:08,737 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:50:08,737 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:08,738 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-12-14 05:50:08,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:08,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 33 [2022-12-14 05:50:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740899110] [2022-12-14 05:50:08,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:08,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 05:50:08,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:08,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 05:50:08,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:50:08,741 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-12-14 05:50:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:10,339 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-12-14 05:50:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 05:50:10,340 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-12-14 05:50:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:10,344 INFO L225 Difference]: With dead ends: 116 [2022-12-14 05:50:10,344 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 05:50:10,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=3543, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 05:50:10,347 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 181 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:10,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 285 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 05:50:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 05:50:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-12-14 05:50:10,358 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-12-14 05:50:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2022-12-14 05:50:10,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 45 [2022-12-14 05:50:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:10,360 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2022-12-14 05:50:10,360 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-12-14 05:50:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2022-12-14 05:50:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 05:50:10,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:10,362 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-12-14 05:50:10,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:50:10,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:10,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash -402449861, now seen corresponding path program 1 times [2022-12-14 05:50:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:10,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329224311] [2022-12-14 05:50:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:50:10,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:10,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329224311] [2022-12-14 05:50:10,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329224311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:10,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182787843] [2022-12-14 05:50:10,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:10,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:10,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:50:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:10,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:50:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:11,017 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-12-14 05:50:11,020 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-12-14 05:50:11,171 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-12-14 05:50:11,172 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-12-14 05:50:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:50:11,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:50:11,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182787843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:11,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130017816] [2022-12-14 05:50:11,414 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:50:11,414 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:11,414 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-12-14 05:50:11,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:11,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 20 [2022-12-14 05:50:11,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304253665] [2022-12-14 05:50:11,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:11,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:50:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:50:11,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:50:11,416 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-12-14 05:50:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:11,840 INFO L93 Difference]: Finished difference Result 170 states and 252 transitions. [2022-12-14 05:50:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:50:11,841 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-12-14 05:50:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:11,844 INFO L225 Difference]: With dead ends: 170 [2022-12-14 05:50:11,844 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 05:50:11,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2022-12-14 05:50:11,845 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:11,846 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.3s Time] [2022-12-14 05:50:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 05:50:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 85. [2022-12-14 05:50:11,864 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-12-14 05:50:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2022-12-14 05:50:11,865 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 45 [2022-12-14 05:50:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:11,865 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2022-12-14 05:50:11,865 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-12-14 05:50:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2022-12-14 05:50:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 05:50:11,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:11,868 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-12-14 05:50:11,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:50:12,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:12,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -310864104, now seen corresponding path program 2 times [2022-12-14 05:50:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:12,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497196654] [2022-12-14 05:50:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:50:12,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:12,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497196654] [2022-12-14 05:50:12,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497196654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:12,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346915511] [2022-12-14 05:50:12,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:50:12,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:12,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:12,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:50:12,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:50:12,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:50:12,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:50:12,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:12,681 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-12-14 05:50:12,682 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-12-14 05:50:12,815 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-12-14 05:50:12,818 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-12-14 05:50:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 05:50:12,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:21,481 WARN L233 SmtUtils]: Spent 6.01s 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-12-14 05:50:27,549 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-12-14 05:50:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-14 05:50:27,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346915511] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:27,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [566716138] [2022-12-14 05:50:27,633 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:50:27,633 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:27,633 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-12-14 05:50:27,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:27,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 26 [2022-12-14 05:50:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162211084] [2022-12-14 05:50:27,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:27,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 05:50:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 05:50:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=585, Unknown=1, NotChecked=0, Total=650 [2022-12-14 05:50:27,635 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-12-14 05:50:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:27,936 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2022-12-14 05:50:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:50:27,937 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-12-14 05:50:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:27,938 INFO L225 Difference]: With dead ends: 131 [2022-12-14 05:50:27,938 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 05:50:27,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-12-14 05:50:27,939 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:27,939 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.2s Time] [2022-12-14 05:50:27,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 05:50:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2022-12-14 05:50:27,950 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-12-14 05:50:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2022-12-14 05:50:27,951 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 55 [2022-12-14 05:50:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2022-12-14 05:50:27,951 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-12-14 05:50:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2022-12-14 05:50:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:50:27,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:27,953 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-12-14 05:50:27,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:50:28,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:28,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:28,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1830536044, now seen corresponding path program 3 times [2022-12-14 05:50:28,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:28,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137027413] [2022-12-14 05:50:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 05:50:29,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137027413] [2022-12-14 05:50:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137027413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531800722] [2022-12-14 05:50:29,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:50:29,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:29,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:29,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:29,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:50:29,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:50:29,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:50:29,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 05:50:29,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:29,395 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-12-14 05:50:29,396 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-12-14 05:50:29,852 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-12-14 05:50:29,854 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-12-14 05:50:29,941 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-12-14 05:50:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-14 05:50:29,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:30,765 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-12-14 05:50:31,203 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-12-14 05:50:31,203 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-12-14 05:50:31,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531800722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [92308741] [2022-12-14 05:50:31,658 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:50:31,658 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:31,658 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-12-14 05:50:31,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:50:31,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2022-12-14 05:50:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321880372] [2022-12-14 05:50:31,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:31,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:50:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:50:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2592, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 05:50:31,662 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-12-14 05:50:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:50:32,698 INFO L93 Difference]: Finished difference Result 104 states and 145 transitions. [2022-12-14 05:50:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:50:32,699 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-12-14 05:50:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:50:32,700 INFO L225 Difference]: With dead ends: 104 [2022-12-14 05:50:32,700 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 05:50:32,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=323, Invalid=4369, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 05:50:32,701 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 55 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:50:32,701 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.5s Time] [2022-12-14 05:50:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 05:50:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-12-14 05:50:32,711 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-12-14 05:50:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2022-12-14 05:50:32,712 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 67 [2022-12-14 05:50:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:50:32,712 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2022-12-14 05:50:32,712 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-12-14 05:50:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-12-14 05:50:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:50:32,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:50:32,713 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-12-14 05:50:32,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:50:32,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:32,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:50:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:50:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 890264430, now seen corresponding path program 2 times [2022-12-14 05:50:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:50:32,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729684321] [2022-12-14 05:50:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:50:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:50:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:50:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 05:50:33,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:50:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729684321] [2022-12-14 05:50:33,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729684321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:50:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982768337] [2022-12-14 05:50:33,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:50:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:50:33,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:50:33,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:50:33,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:50:33,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:50:33,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:50:33,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 05:50:33,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:50:34,030 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-12-14 05:50:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 05:50:36,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:50:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 05:50:36,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982768337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:50:36,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028296666] [2022-12-14 05:50:36,784 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:50:36,784 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:50:36,785 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-12-14 05:50:36,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:50:36,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 13] total 43 [2022-12-14 05:50:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682061242] [2022-12-14 05:50:36,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:50:36,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 05:50:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:50:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 05:50:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1678, Unknown=1, NotChecked=0, Total=1806 [2022-12-14 05:50:36,788 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-12-14 05:50:41,588 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-12-14 05:50:43,602 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-12-14 05:50:47,651 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-12-14 05:50:51,710 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-12-14 05:50:53,725 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-12-14 05:50:55,751 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-12-14 05:50:59,810 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-12-14 05:51:01,822 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-12-14 05:51:03,856 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-12-14 05:51:05,890 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-12-14 05:51:26,811 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-12-14 05:51:28,819 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-12-14 05:51:30,837 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-12-14 05:51:43,213 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-12-14 05:51:45,568 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-12-14 05:51:47,588 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-12-14 05:51:50,273 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-12-14 05:51:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:51:50,830 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2022-12-14 05:51:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 05:51:50,830 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-12-14 05:51:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:51:50,832 INFO L225 Difference]: With dead ends: 150 [2022-12-14 05:51:50,832 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 05:51:50,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=762, Invalid=6532, Unknown=16, NotChecked=0, Total=7310 [2022-12-14 05:51:50,834 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 175 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:51:50,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 517 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 2916 Invalid, 18 Unknown, 0 Unchecked, 36.3s Time] [2022-12-14 05:51:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 05:51:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2022-12-14 05:51:50,854 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-12-14 05:51:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2022-12-14 05:51:50,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 67 [2022-12-14 05:51:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:51:50,855 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2022-12-14 05:51:50,856 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-12-14 05:51:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2022-12-14 05:51:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:51:50,857 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:51:50,857 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-12-14 05:51:50,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:51:51,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:51,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:51:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:51:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1689983060, now seen corresponding path program 3 times [2022-12-14 05:51:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:51:51,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957697673] [2022-12-14 05:51:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:51:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:51:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:51:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 05:51:52,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:51:52,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957697673] [2022-12-14 05:51:52,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957697673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:51:52,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846158101] [2022-12-14 05:51:52,417 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:51:52,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:51:52,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:51:52,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:51:52,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:51:52,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:51:52,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:51:52,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 05:51:52,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:51:53,309 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-12-14 05:51:53,311 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-12-14 05:51:53,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:51:53,484 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-12-14 05:51:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 05:51:53,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:51:54,363 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-12-14 05:51:54,368 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-12-14 05:51:54,374 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 05:51:54,375 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-12-14 05:51:57,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846158101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:51:57,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143632362] [2022-12-14 05:51:57,373 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:51:57,373 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:51:57,373 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-12-14 05:51:57,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:51:57,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 54 [2022-12-14 05:51:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121221327] [2022-12-14 05:51:57,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:51:57,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 05:51:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:51:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 05:51:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4601, Unknown=0, NotChecked=0, Total=4830 [2022-12-14 05:51:57,376 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-12-14 05:52:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:00,563 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2022-12-14 05:52:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 05:52:00,563 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-12-14 05:52:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:00,564 INFO L225 Difference]: With dead ends: 123 [2022-12-14 05:52:00,564 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 05:52:00,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=674, Invalid=10668, Unknown=0, NotChecked=0, Total=11342 [2022-12-14 05:52:00,566 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 136 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:00,566 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.2s Time] [2022-12-14 05:52:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 05:52:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2022-12-14 05:52:00,578 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-12-14 05:52:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2022-12-14 05:52:00,578 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 67 [2022-12-14 05:52:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2022-12-14 05:52:00,579 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-12-14 05:52:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2022-12-14 05:52:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 05:52:00,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:00,580 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-12-14 05:52:00,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 05:52:00,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:00,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:52:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1484444117, now seen corresponding path program 1 times [2022-12-14 05:52:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:00,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714054923] [2022-12-14 05:52:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:00,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:52:01,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714054923] [2022-12-14 05:52:01,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714054923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966418089] [2022-12-14 05:52:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:01,692 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:01,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:52:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:01,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-14 05:52:01,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:01,819 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-12-14 05:52:01,822 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-12-14 05:52:02,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:52:02,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:52:02,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:52:02,515 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-12-14 05:52:02,522 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-12-14 05:52:02,522 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-12-14 05:52:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 05:52:02,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:52:15,005 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-12-14 05:52:15,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966418089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:15,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115780548] [2022-12-14 05:52:15,026 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 05:52:15,026 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:52:15,027 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-12-14 05:52:15,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:52:15,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2022-12-14 05:52:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710486370] [2022-12-14 05:52:15,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:52:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:52:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:52:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1837, Unknown=1, NotChecked=0, Total=1980 [2022-12-14 05:52:15,028 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-12-14 05:52:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:16,809 INFO L93 Difference]: Finished difference Result 183 states and 268 transitions. [2022-12-14 05:52:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 05:52:16,810 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-12-14 05:52:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:16,811 INFO L225 Difference]: With dead ends: 183 [2022-12-14 05:52:16,811 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 05:52:16,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=413, Invalid=4556, Unknown=1, NotChecked=0, Total=4970 [2022-12-14 05:52:16,813 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:16,813 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.0s Time] [2022-12-14 05:52:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 05:52:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2022-12-14 05:52:16,830 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-12-14 05:52:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-12-14 05:52:16,831 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 73 [2022-12-14 05:52:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:16,831 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-12-14 05:52:16,831 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-12-14 05:52:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-12-14 05:52:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 05:52:16,832 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:16,832 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:52:16,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:52:17,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:52:17,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:52:17,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash 840899311, now seen corresponding path program 4 times [2022-12-14 05:52:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:17,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032376016] [2022-12-14 05:52:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:17,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 30 proven. 104 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 05:52:20,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:52:20,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032376016] [2022-12-14 05:52:20,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032376016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:20,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77348107] [2022-12-14 05:52:20,594 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:52:20,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:20,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:52:20,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:52:20,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:52:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:52:20,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 05:52:20,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:52:20,761 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-12-14 05:52:20,762 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-12-14 05:52:20,765 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-12-14 05:52:21,649 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-12-14 05:52:21,652 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-12-14 05:52:21,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:52:21,856 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-12-14 05:52:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 56 proven. 43 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-12-14 05:52:21,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:52:40,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77348107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:52:40,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898513301] [2022-12-14 05:52:40,281 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:52:40,281 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:52:40,282 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-12-14 05:52:40,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:52:40,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2022-12-14 05:52:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711692256] [2022-12-14 05:52:40,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:52:40,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 05:52:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:52:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 05:52:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3831, Unknown=6, NotChecked=0, Total=4032 [2022-12-14 05:52:40,284 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 49 states, 40 states have (on average 1.85) internal successors, (74), 37 states have internal predecessors, (74), 19 states have call successors, (27), 7 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2022-12-14 05:52:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:52:49,593 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2022-12-14 05:52:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-14 05:52:49,594 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.85) internal successors, (74), 37 states have internal predecessors, (74), 19 states have call successors, (27), 7 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) Word has length 101 [2022-12-14 05:52:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:52:49,595 INFO L225 Difference]: With dead ends: 223 [2022-12-14 05:52:49,595 INFO L226 Difference]: Without dead ends: 190 [2022-12-14 05:52:49,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=771, Invalid=10353, Unknown=6, NotChecked=0, Total=11130 [2022-12-14 05:52:49,597 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 105 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:52:49,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 255 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 05:52:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-12-14 05:52:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2022-12-14 05:52:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.108910891089109) internal successors, (112), 106 states have internal predecessors, (112), 28 states have call successors, (28), 15 states have call predecessors, (28), 21 states have return successors, (94), 29 states have call predecessors, (94), 18 states have call successors, (94) [2022-12-14 05:52:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2022-12-14 05:52:49,616 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 101 [2022-12-14 05:52:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:52:49,616 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2022-12-14 05:52:49,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.85) internal successors, (74), 37 states have internal predecessors, (74), 19 states have call successors, (27), 7 states have call predecessors, (27), 13 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2022-12-14 05:52:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2022-12-14 05:52:49,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 05:52:49,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:52:49,617 INFO L195 NwaCegarLoop]: trace histogram [11, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-12-14 05:52:49,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:52:49,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:52:49,818 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:52:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:52:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1942963340, now seen corresponding path program 5 times [2022-12-14 05:52:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:52:49,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633150084] [2022-12-14 05:52:49,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:52:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:52:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:53:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 40 proven. 167 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-14 05:53:00,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:53:00,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633150084] [2022-12-14 05:53:00,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633150084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:53:00,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972060504] [2022-12-14 05:53:00,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:53:00,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:53:00,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:53:00,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:53:00,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:53:00,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 05:53:00,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:53:00,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 05:53:00,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:53:00,802 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-12-14 05:53:00,894 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-12-14 05:53:00,908 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-14 05:53:00,908 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 1 case distinctions, treesize of input 26 treesize of output 37 [2022-12-14 05:53:03,089 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_task_~n#1.base_BEFORE_CALL_23| Int)) (and (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_task_~n#1.base_BEFORE_CALL_23|) 8)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_task_~n#1.base_BEFORE_CALL_23|) 8) 8)) 0)) (not (= |v_ULTIMATE.start_task_~n#1.base_BEFORE_CALL_23| 0)))) is different from true [2022-12-14 05:53:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 65 proven. 29 refuted. 0 times theorem prover too weak. 149 trivial. 18 not checked. [2022-12-14 05:53:17,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:53:26,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972060504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:53:26,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [388887889] [2022-12-14 05:53:26,826 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:53:26,826 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:53:26,827 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-12-14 05:53:26,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:53:26,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 44 [2022-12-14 05:53:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661522871] [2022-12-14 05:53:26,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:53:26,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:53:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:53:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:53:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2106, Unknown=4, NotChecked=92, Total=2352 [2022-12-14 05:53:26,829 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand has 44 states, 37 states have (on average 2.108108108108108) internal successors, (78), 35 states have internal predecessors, (78), 16 states have call successors, (26), 6 states have call predecessors, (26), 18 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2022-12-14 05:53:31,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-14 05:53:32,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-14 05:53:35,417 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-12-14 05:53:42,140 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-12-14 05:53:44,147 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-12-14 05:53:47,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-14 05:53:52,782 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-12-14 05:53:54,932 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-12-14 05:54:03,449 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 [] [2022-12-14 05:54:21,252 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-12-14 05:54:34,025 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-12-14 05:54:36,028 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-12-14 05:54:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:54:59,357 INFO L93 Difference]: Finished difference Result 300 states and 504 transitions. [2022-12-14 05:54:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 05:54:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 2.108108108108108) internal successors, (78), 35 states have internal predecessors, (78), 16 states have call successors, (26), 6 states have call predecessors, (26), 18 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) Word has length 103 [2022-12-14 05:54:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:54:59,360 INFO L225 Difference]: With dead ends: 300 [2022-12-14 05:54:59,360 INFO L226 Difference]: Without dead ends: 252 [2022-12-14 05:54:59,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 87.9s TimeCoverageRelationStatistics Valid=903, Invalid=9193, Unknown=8, NotChecked=198, Total=10302 [2022-12-14 05:54:59,361 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 87 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 3452 mSolverCounterSat, 218 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 3452 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:54:59,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 540 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 3452 Invalid, 9 Unknown, 133 Unchecked, 32.1s Time] [2022-12-14 05:54:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-12-14 05:54:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 211. [2022-12-14 05:54:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 138 states have (on average 1.0942028985507246) internal successors, (151), 145 states have internal predecessors, (151), 37 states have call successors, (37), 17 states have call predecessors, (37), 35 states have return successors, (183), 48 states have call predecessors, (183), 27 states have call successors, (183) [2022-12-14 05:54:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 371 transitions. [2022-12-14 05:54:59,389 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 371 transitions. Word has length 103 [2022-12-14 05:54:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:54:59,390 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 371 transitions. [2022-12-14 05:54:59,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 2.108108108108108) internal successors, (78), 35 states have internal predecessors, (78), 16 states have call successors, (26), 6 states have call predecessors, (26), 18 states have return successors, (27), 20 states have call predecessors, (27), 15 states have call successors, (27) [2022-12-14 05:54:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 371 transitions. [2022-12-14 05:54:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 05:54:59,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:54:59,392 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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-12-14 05:54:59,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:54:59,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:54:59,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:54:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:54:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -418692983, now seen corresponding path program 6 times [2022-12-14 05:54:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:54:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518289342] [2022-12-14 05:54:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:54:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:54:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 46 proven. 66 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 05:55:00,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:55:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518289342] [2022-12-14 05:55:00,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518289342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:55:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740424873] [2022-12-14 05:55:00,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:55:00,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:55:00,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:55:00,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:55:00,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:55:01,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:55:01,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:55:01,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 99 conjunts are in the unsatisfiable core [2022-12-14 05:55:01,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:55:01,371 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-12-14 05:55:01,373 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-12-14 05:55:01,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:55:01,940 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-12-14 05:55:01,940 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-12-14 05:55:01,946 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-12-14 05:55:01,947 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-12-14 05:55:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-14 05:55:01,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:55:14,574 WARN L233 SmtUtils]: Spent 12.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-12-14 05:55:24,714 WARN L233 SmtUtils]: Spent 10.03s 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-12-14 05:55:24,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740424873] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:55:24,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1771618914] [2022-12-14 05:55:24,715 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:55:24,716 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:55:24,716 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-12-14 05:55:24,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:55:24,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 38 [2022-12-14 05:55:24,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524184965] [2022-12-14 05:55:24,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:55:24,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 05:55:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:55:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 05:55:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2103, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 05:55:24,717 INFO L87 Difference]: Start difference. First operand 211 states and 371 transitions. Second operand has 38 states, 32 states have (on average 2.1875) internal successors, (70), 29 states have internal predecessors, (70), 14 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2022-12-14 05:55:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:55:27,340 INFO L93 Difference]: Finished difference Result 408 states and 713 transitions. [2022-12-14 05:55:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 05:55:27,341 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.1875) internal successors, (70), 29 states have internal predecessors, (70), 14 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) Word has length 93 [2022-12-14 05:55:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:55:27,343 INFO L225 Difference]: With dead ends: 408 [2022-12-14 05:55:27,343 INFO L226 Difference]: Without dead ends: 305 [2022-12-14 05:55:27,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=580, Invalid=7076, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 05:55:27,345 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 103 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:55:27,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 357 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 05:55:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-12-14 05:55:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 264. [2022-12-14 05:55:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 176 states have (on average 1.0795454545454546) internal successors, (190), 180 states have internal predecessors, (190), 47 states have call successors, (47), 23 states have call predecessors, (47), 40 states have return successors, (241), 60 states have call predecessors, (241), 34 states have call successors, (241) [2022-12-14 05:55:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 478 transitions. [2022-12-14 05:55:27,378 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 478 transitions. Word has length 93 [2022-12-14 05:55:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:55:27,379 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 478 transitions. [2022-12-14 05:55:27,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.1875) internal successors, (70), 29 states have internal predecessors, (70), 14 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2022-12-14 05:55:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 478 transitions. [2022-12-14 05:55:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 05:55:27,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:55:27,381 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-12-14 05:55:27,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 05:55:27,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:55:27,582 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:55:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:55:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1476709101, now seen corresponding path program 4 times [2022-12-14 05:55:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:55:27,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103002145] [2022-12-14 05:55:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:55:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:55:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 05:55:28,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:55:28,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103002145] [2022-12-14 05:55:28,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103002145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:55:28,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265860191] [2022-12-14 05:55:28,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:55:28,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:55:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:55:28,422 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:55:28,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:55:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:28,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-14 05:55:28,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:55:28,575 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-12-14 05:55:28,618 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-12-14 05:55:28,621 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-12-14 05:55:29,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:55:29,772 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-12-14 05:55:29,772 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-12-14 05:55:29,782 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-12-14 05:55:29,783 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-12-14 05:55:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 05:55:29,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:55:40,492 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-12-14 05:55:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265860191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:55:40,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [120492164] [2022-12-14 05:55:40,514 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:55:40,514 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:55:40,514 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-12-14 05:55:40,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:55:40,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 42 [2022-12-14 05:55:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648975315] [2022-12-14 05:55:40,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:55:40,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 05:55:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:55:40,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 05:55:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 05:55:40,516 INFO L87 Difference]: Start difference. First operand 264 states and 478 transitions. Second operand has 42 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 31 states have internal predecessors, (69), 15 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 05:55:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:55:47,483 INFO L93 Difference]: Finished difference Result 472 states and 900 transitions. [2022-12-14 05:55:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-14 05:55:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 31 states have internal predecessors, (69), 15 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) Word has length 73 [2022-12-14 05:55:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:55:47,488 INFO L225 Difference]: With dead ends: 472 [2022-12-14 05:55:47,488 INFO L226 Difference]: Without dead ends: 416 [2022-12-14 05:55:47,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1044, Invalid=10946, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 05:55:47,490 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 342 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:55:47,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 267 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 05:55:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-12-14 05:55:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 339. [2022-12-14 05:55:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 225 states have (on average 1.08) internal successors, (243), 231 states have internal predecessors, (243), 59 states have call successors, (59), 32 states have call predecessors, (59), 54 states have return successors, (319), 75 states have call predecessors, (319), 44 states have call successors, (319) [2022-12-14 05:55:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 621 transitions. [2022-12-14 05:55:47,554 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 621 transitions. Word has length 73 [2022-12-14 05:55:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:55:47,555 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 621 transitions. [2022-12-14 05:55:47,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 31 states have internal predecessors, (69), 15 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-12-14 05:55:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 621 transitions. [2022-12-14 05:55:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 05:55:47,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:55:47,557 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:55:47,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:55:47,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:55:47,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:55:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:55:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1985025547, now seen corresponding path program 7 times [2022-12-14 05:55:47,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:55:47,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619542321] [2022-12-14 05:55:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:55:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:55:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 25 proven. 129 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-14 05:55:48,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:55:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619542321] [2022-12-14 05:55:48,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619542321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:55:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450408755] [2022-12-14 05:55:48,737 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:55:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:55:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:55:48,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:55:48,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:55:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:55:48,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 94 conjunts are in the unsatisfiable core [2022-12-14 05:55:48,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:55:48,981 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-12-14 05:55:48,984 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-12-14 05:55:49,076 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 05:55:49,076 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-12-14 05:55:49,086 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 05:55:49,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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 05:55:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 87 proven. 35 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-14 05:55:50,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:55:59,066 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:56:07,689 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:56:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450408755] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:56:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703115994] [2022-12-14 05:56:07,691 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:56:07,691 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:56:07,691 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-12-14 05:56:07,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:56:07,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2022-12-14 05:56:07,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739086651] [2022-12-14 05:56:07,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:56:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:56:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:56:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:56:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 05:56:07,693 INFO L87 Difference]: Start difference. First operand 339 states and 621 transitions. Second operand has 44 states, 37 states have (on average 2.081081081081081) internal successors, (77), 35 states have internal predecessors, (77), 17 states have call successors, (27), 6 states have call predecessors, (27), 17 states have return successors, (27), 21 states have call predecessors, (27), 16 states have call successors, (27) [2022-12-14 05:56:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:56:15,190 INFO L93 Difference]: Finished difference Result 528 states and 1011 transitions. [2022-12-14 05:56:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-12-14 05:56:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 2.081081081081081) internal successors, (77), 35 states have internal predecessors, (77), 17 states have call successors, (27), 6 states have call predecessors, (27), 17 states have return successors, (27), 21 states have call predecessors, (27), 16 states have call successors, (27) Word has length 105 [2022-12-14 05:56:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:56:15,196 INFO L225 Difference]: With dead ends: 528 [2022-12-14 05:56:15,196 INFO L226 Difference]: Without dead ends: 467 [2022-12-14 05:56:15,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2884 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1040, Invalid=10950, Unknown=0, NotChecked=0, Total=11990 [2022-12-14 05:56:15,199 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 175 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:56:15,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 534 Invalid, 4347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-12-14 05:56:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-12-14 05:56:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 348. [2022-12-14 05:56:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 231 states have (on average 1.077922077922078) internal successors, (249), 237 states have internal predecessors, (249), 59 states have call successors, (59), 32 states have call predecessors, (59), 57 states have return successors, (342), 78 states have call predecessors, (342), 44 states have call successors, (342) [2022-12-14 05:56:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 650 transitions. [2022-12-14 05:56:15,271 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 650 transitions. Word has length 105 [2022-12-14 05:56:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:56:15,271 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 650 transitions. [2022-12-14 05:56:15,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 2.081081081081081) internal successors, (77), 35 states have internal predecessors, (77), 17 states have call successors, (27), 6 states have call predecessors, (27), 17 states have return successors, (27), 21 states have call predecessors, (27), 16 states have call successors, (27) [2022-12-14 05:56:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 650 transitions. [2022-12-14 05:56:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 05:56:15,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:56:15,273 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-12-14 05:56:15,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 05:56:15,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:56:15,474 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:56:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:56:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2079217582, now seen corresponding path program 2 times [2022-12-14 05:56:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:56:15,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946787161] [2022-12-14 05:56:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:56:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:56:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:56:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 40 proven. 49 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 05:56:16,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:56:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946787161] [2022-12-14 05:56:16,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946787161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:56:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359076349] [2022-12-14 05:56:16,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:56:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:56:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:56:16,329 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:56:16,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:56:16,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 05:56:16,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:56:16,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-14 05:56:16,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:56:17,223 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-14 05:56:17,223 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 69 treesize of output 36 [2022-12-14 05:56:17,232 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-12-14 05:56:17,232 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 27 treesize of output 21 [2022-12-14 05:56:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-14 05:56:17,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:56:31,808 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-12-14 05:56:41,921 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:56:41,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359076349] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:56:41,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98246481] [2022-12-14 05:56:41,924 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-12-14 05:56:41,924 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:56:41,924 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-12-14 05:56:41,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:56:41,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2022-12-14 05:56:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580770341] [2022-12-14 05:56:41,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:56:41,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 05:56:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:56:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 05:56:41,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2506, Unknown=2, NotChecked=0, Total=2652 [2022-12-14 05:56:41,925 INFO L87 Difference]: Start difference. First operand 348 states and 650 transitions. Second operand has 43 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 20 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 05:56:51,176 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-12-14 05:56:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:56:51,600 INFO L93 Difference]: Finished difference Result 722 states and 1617 transitions. [2022-12-14 05:56:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-14 05:56:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 20 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) Word has length 83 [2022-12-14 05:56:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:56:51,606 INFO L225 Difference]: With dead ends: 722 [2022-12-14 05:56:51,606 INFO L226 Difference]: Without dead ends: 673 [2022-12-14 05:56:51,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=643, Invalid=8097, Unknown=2, NotChecked=0, Total=8742 [2022-12-14 05:56:51,608 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 145 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 163 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:56:51,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 492 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 2651 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-12-14 05:56:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-12-14 05:56:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 559. [2022-12-14 05:56:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 370 states have (on average 1.0648648648648649) internal successors, (394), 375 states have internal predecessors, (394), 86 states have call successors, (86), 41 states have call predecessors, (86), 102 states have return successors, (910), 142 states have call predecessors, (910), 66 states have call successors, (910) [2022-12-14 05:56:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1390 transitions. [2022-12-14 05:56:51,711 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1390 transitions. Word has length 83 [2022-12-14 05:56:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:56:51,712 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1390 transitions. [2022-12-14 05:56:51,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 20 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (22), 18 states have call predecessors, (22), 16 states have call successors, (22) [2022-12-14 05:56:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1390 transitions. [2022-12-14 05:56:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 05:56:51,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:56:51,721 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:56:51,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:56:51,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:56:51,922 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:56:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:56:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 133315829, now seen corresponding path program 8 times [2022-12-14 05:56:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:56:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761453348] [2022-12-14 05:56:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:56:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:56:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:57:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 14 proven. 156 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 05:57:01,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:57:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761453348] [2022-12-14 05:57:01,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761453348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:57:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336523526] [2022-12-14 05:57:01,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:57:01,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:57:01,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:57:01,907 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:57:01,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:57:02,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-14 05:57:02,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:57:02,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 149 conjunts are in the unsatisfiable core [2022-12-14 05:57:02,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:57:02,924 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-12-14 05:57:03,469 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-12-14 05:57:03,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:57:03,664 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-12-14 05:57:03,670 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-12-14 05:57:03,800 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-14 05:57:03,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 30 [2022-12-14 05:57:03,923 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:57:03,924 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 40 treesize of output 37 [2022-12-14 05:57:03,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:57:03,932 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-12-14 05:57:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 61 proven. 103 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 05:57:05,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:57:16,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336523526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:57:16,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395241436] [2022-12-14 05:57:16,333 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 05:57:16,333 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:57:16,333 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-12-14 05:57:16,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 05:57:16,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 65 [2022-12-14 05:57:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518962357] [2022-12-14 05:57:16,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 05:57:16,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:57:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:57:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:57:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4640, Unknown=1, NotChecked=0, Total=4830 [2022-12-14 05:57:16,335 INFO L87 Difference]: Start difference. First operand 559 states and 1390 transitions. Second operand has 65 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 47 states have internal predecessors, (94), 22 states have call successors, (30), 9 states have call predecessors, (30), 21 states have return successors, (29), 27 states have call predecessors, (29), 18 states have call successors, (29) [2022-12-14 05:57:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:57:44,245 INFO L93 Difference]: Finished difference Result 965 states and 2301 transitions. [2022-12-14 05:57:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-12-14 05:57:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 47 states have internal predecessors, (94), 22 states have call successors, (30), 9 states have call predecessors, (30), 21 states have return successors, (29), 27 states have call predecessors, (29), 18 states have call successors, (29) Word has length 105 [2022-12-14 05:57:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:57:44,253 INFO L225 Difference]: With dead ends: 965 [2022-12-14 05:57:44,253 INFO L226 Difference]: Without dead ends: 897 [2022-12-14 05:57:44,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7691 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=1835, Invalid=31106, Unknown=1, NotChecked=0, Total=32942 [2022-12-14 05:57:44,256 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 139 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 9636 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 9930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 9636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:57:44,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 959 Invalid, 9930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 9636 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2022-12-14 05:57:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-12-14 05:57:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 703. [2022-12-14 05:57:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 461 states have (on average 1.0629067245119306) internal successors, (490), 471 states have internal predecessors, (490), 104 states have call successors, (104), 47 states have call predecessors, (104), 137 states have return successors, (1222), 184 states have call predecessors, (1222), 82 states have call successors, (1222) [2022-12-14 05:57:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1816 transitions. [2022-12-14 05:57:44,397 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1816 transitions. Word has length 105 [2022-12-14 05:57:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:57:44,397 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1816 transitions. [2022-12-14 05:57:44,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 47 states have internal predecessors, (94), 22 states have call successors, (30), 9 states have call predecessors, (30), 21 states have return successors, (29), 27 states have call predecessors, (29), 18 states have call successors, (29) [2022-12-14 05:57:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1816 transitions. [2022-12-14 05:57:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-14 05:57:44,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:57:44,402 INFO L195 NwaCegarLoop]: trace histogram [15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 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-12-14 05:57:44,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 05:57:44,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56d27129-e1d1-4659-91b9-910b10b0b194/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:57:44,603 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:57:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:57:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1370541158, now seen corresponding path program 3 times [2022-12-14 05:57:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:57:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122735917] [2022-12-14 05:57:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:57:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:57:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat